334 search results - page 19 / 67 » How to Dynamically Merge Markov Decision Processes |
117
click to vote
IJCAI
2007
15 years 2 months ago
2007
Inverse Reinforcement Learning (IRL) is the problem of learning the reward function underlying a Markov Decision Process given the dynamics of the system and the behaviour of an e...
100
click to vote
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...
108
Voted
ISSS
1999
IEEE
15 years 4 months ago
1999
IEEE
The policy optimization problem for dynamic power management has received considerable attention in the recent past. We formulate policy optimization as a constrained optimization...
109
Voted
FSTTCS
2006
Springer
15 years 4 months ago
2006
Springer
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
101
click to vote
HYBRID
2010
Springer
15 years 7 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...