656 search results - page 60 / 132 » Complexity of finite-horizon Markov decision process problem... |
110
click to vote
NIPS
2000
15 years 3 months ago
2000
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
129
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
124
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
107
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
101
click to vote
HICSS
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper1 provides a view of modeling the information dominance problem of military systems as representative of modeling other complex systems. The ideas are an extension of ea...