280 search results - page 36 / 56 » Planning for Markov Decision Processes with Sparse Stochasti... |
105
click to vote
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
AIPS
2008
15 years 4 days ago
2008
We address the problem of coordinating the plans and schedules for a team of agents in an uncertain and dynamic environment. Bounded rationality, bounded communication, subjectivi...
AIPS
2007
15 years 4 days ago
2007
This paper summarizes research on a new emerging framework for learning to plan using the Markov decision process model (MDP). In this paradigm, two approaches to learning to plan...
NAACL
2007
14 years 11 months ago
2007
This paper explores what kind of user simulation model is suitable for developing a training corpus for using Markov Decision Processes (MDPs) to automatically learn dialog strate...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...