502 search results - page 28 / 101 » Monotone Approximation of Decision Problems |
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
INFORMS
2010
14 years 8 months ago
2010
We present an approximate dynamic programming approach for making ambulance redeployment decisions in an emergency medical service system. The primary decision is where we should ...
74
Voted
SARA
2005
Springer
15 years 3 months ago
2005
Springer
Sets of features in Markov decision processes can play a critical role ximately representing value and in abstracting the state space. Selection of features is crucial to the succe...
77
Voted
FLAIRS
2009
14 years 7 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...