682 search results - page 46 / 137 » One-Counter Markov Decision Processes |
139
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
132
click to vote
UAI
1997
15 years 5 months ago
1997
Much recent research in decision theoretic planning has adopted Markov decision processes (MDPs) as the model of choice, and has attempted to make their solution more tractable by...
107
click to vote
AAAI
2010
15 years 5 months ago
2010
Automatically constructing novel representations of tasks from analysis of state spaces is a longstanding fundamental challenge in AI. I review recent progress on this problem for...
118
click to vote
NIPS
2000
15 years 5 months ago
2000
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
122
click to vote
JMLR
2010
14 years 10 months ago
2010
We consider reinforcement learning as solving a Markov decision process with unknown transition distribution. Based on interaction with the environment, an estimate of the transit...