63 search results - page 4 / 13 » Mean field for Markov Decision Processes: from Discrete to C... |
JMLR
2006
13 years 5 months ago
2006
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are ...
COR
2006
13 years 5 months ago
2006
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
EMMCVPR
2001
Springer
13 years 10 months ago
2001
Springer
To segregate overlapping objects into depth layers requires the integration of local occlusion cues distributed over the entire image into a global percept. We propose to model thi...
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
JAIR
2006
13 years 5 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...