332 search results - page 49 / 67 » Ranking policies in discrete Markov decision processes |
CCE
2004
13 years 7 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
WCNC
2010
IEEE
13 years 12 months ago
2010
IEEE
—Controlled mobile helper nodes called data ferries have recently been proposed to bridge communications between disconnected nodes in a delay-tolerant manner. While existing wor...
NIPS
2003
13 years 9 months ago
2003
We develop a protocol for optimizing dynamic behavior of a network of simple electronic components, such as a sensor network, an ad hoc network of mobile devices, or a network of ...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...