656 search results - page 16 / 132 » Complexity of finite-horizon Markov decision process problem... |
134
click to vote
NIPS
2004
15 years 3 months ago
2004
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
106
Voted
CORR
2010
Springer
15 years 1 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...
135
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
112
click to vote
CAV
2007
Springer
15 years 8 months ago
2007
Springer
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
143
Voted
CSL
2007
Springer
15 years 1 months ago
2007
Springer
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...