Sciweavers

60 search results - page 9 / 12
» Labelled Markov Processes as Generalised Stochastic Relation...
Sort
View
NIPS
2003
13 years 8 months ago
Approximate Policy Iteration with a Policy Language Bias
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
Alan Fern, Sung Wook Yoon, Robert Givan
ALT
2006
Springer
14 years 4 months ago
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
Daniil Ryabko, Marcus Hutter
SAC
2005
ACM
14 years 1 months ago
Formal modeling and quantitative analysis of KLAIM-based mobile systems
KLAIM is an experimental language designed for modeling and programming distributed systems composed of mobile components where distribution awareness and dynamic system architect...
Rocco De Nicola, Diego Latella, Mieke Massink
IJCAI
2001
13 years 8 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
FSTTCS
2010
Springer
13 years 5 months ago
One-Counter Stochastic Games
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...
Tomás Brázdil, Václav Brozek,...