Sciweavers

334 search results - page 19 / 67
» How to Dynamically Merge Markov Decision Processes
Sort
View
IJCAI
2007
14 years 11 months ago
Bayesian Inverse Reinforcement Learning
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...
Deepak Ramachandran, Eyal Amir
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
15 years 4 months ago
Considering Unseen States as Impossible in Factored Reinforcement Learning
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 ...
Olga Kozlova, Olivier Sigaud, Pierre-Henri Wuillem...
ISSS
1999
IEEE
121views Hardware» more  ISSS 1999»
15 years 1 months ago
Event-Driven Power Management of Portable Systems
The policy optimization problem for dynamic power management has received considerable attention in the recent past. We formulate policy optimization as a constrained optimization...
Tajana Simunic, Giovanni De Micheli, Luca Benini
FSTTCS
2006
Springer
15 years 1 months ago
Testing Probabilistic Equivalence Through Reinforcement Learning
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...
Josee Desharnais, François Laviolette, Sami...
HYBRID
2010
Springer
15 years 4 months ago
On the connections between PCTL and dynamic programming
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...
Federico Ramponi, Debasish Chatterjee, Sean Summer...