332 search results - page 31 / 67 » Ranking policies in discrete Markov decision processes |
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we propose a dynamic lightpath establishment method for service differentiation in all-optical WDM networks with the capability of full-range wavelength conversi...
NIPS
1996
13 years 9 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— While the Partially Observable Markov Decision Process (POMDP) provides a formal framework for the problem of robot control under uncertainty, it typically assumes a known and ...