771 search results - page 20 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
100
click to vote
ALT
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
123
click to vote
QEST
2008
IEEE
15 years 8 months ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
130
Voted
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
109
Voted
DA
2010
14 years 11 months ago
2010
. Direct approaches, which involve asking patients various abstract questions, have significant drawbacks. We propose a new approach that infers patient preferences based on observ...
106
click to vote
DSN
2006
IEEE
15 years 7 months ago
2006
IEEE
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...