771 search results - page 63 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
144
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
134
click to vote
PERCOM
2007
ACM
16 years 3 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
135
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We present Variable Influence Structure Analysis, an algorithm that dynamically performs hierarchical decomposition of factored Markov decision processes. Our algorithm determines...
139
click to vote
NIPS
2004
15 years 5 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
150
click to vote
ICANN
2001
Springer
15 years 8 months ago
2001
Springer
Unlike traditional reinforcement learning (RL), market-based RL is in principle applicable to worlds described by partially observable Markov Decision Processes (POMDPs), where an ...