Sciweavers

683 search results - page 89 / 137
» Coarticulation in Markov Decision Processes
Sort
View
CONCUR
2006
Springer
14 years 22 days ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger
EWRL
2008
13 years 10 months ago
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
Kirill Dyagilev, Shie Mannor, Nahum Shimkin
EDM
2010
165views Data Mining» more  EDM 2010»
13 years 10 months ago
Using a Bayesian Knowledge Base for Hint Selection on Domain Specific Problems
A Bayesian Knowledge Base is a generalization of traditional Bayesian Networks where nodes or groups of nodes have independence. In this paper we describe a method of generating a ...
John C. Stamper, Tiffany Barnes, Marvin J. Croy
AAAI
2004
13 years 10 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...
IJCAI
2003
13 years 10 months ago
Automated Generation of Understandable Contingency Plans
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
Max Horstmann, Shlomo Zilberstein