Sciweavers

3229 search results - page 367 / 646
» Mixing
Sort
View
ML
2008
ACM
152views Machine Learning» more  ML 2008»
15 years 6 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
JSAT
2006
108views more  JSAT 2006»
15 years 6 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
NETWORKS
2008
15 years 6 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
MCS
2006
Springer
15 years 6 months ago
Three-phase immiscible displacement in heterogeneous petroleum reservoirs
We describe a fractional-step numerical procedure for the simulation of immiscible three-phase flow in heterogeneous porous media that takes into account capillary pressure and ap...
Eduardo Abreu, J. Douglas, Frederico Furtado, D. M...
FFA
2007
62views more  FFA 2007»
15 years 6 months ago
On the parameters of r-dimensional toric codes
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
Diego Ruano