Sciweavers

34 search results - page 3 / 7
» Reachability in Recursive Markov Decision Processes
Sort
View
FORMATS
2006
Springer
14 years 2 months ago
A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
Abstract. Continuous-time Markov decision process are an important variant of labelled transition systems having nondeterminism through labels and stochasticity through exponential...
Nicolás Wolovick, Sven Johr
MFCS
2010
Springer
13 years 9 months ago
Qualitative Analysis of Partially-Observable Markov Decision Processes
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
QEST
2008
IEEE
14 years 5 months ago
Symbolic Magnifying Lens Abstraction in Markov Decision Processes
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 ...
Pritam Roy, David Parker, Gethin Norman, Luca de A...
ICALP
2009
Springer
14 years 11 months ago
Reachability in Stochastic Timed Games
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
Patricia Bouyer, Vojtech Forejt
MOR
2007
109views more  MOR 2007»
13 years 10 months ago
Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
We consider the problem of solving a nonhomogeneous infinite horizon Markov Decision Process (MDP) problem in the general case of potentially multiple optimal first period polic...
Torpong Cheevaprawatdomrong, Irwin E. Schochetman,...