335 search results - page 57 / 67 » The Compositional Construction of Markov Processes |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We present an algorithm to reduce per-pixel search ranges for Markov Random Fields-based stereo algorithms. Our algorithm is based on the intuitions that reliably matched pixels ne...
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...
AAAI
2008
13 years 9 months ago
2008
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
FLAIRS
2004
13 years 8 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
IJCAI
2003
13 years 8 months ago
2003
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...