Sciweavers

ICAART
2010
INSTICC
16 years 29 days ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
98
Voted
ICAART
2010
INSTICC
16 years 29 days ago
A Cautious Approach to Generalization in Reinforcement Learning
Raphael Fonteneau, Susan A. Murphy, Louis Wehenkel...
ICAART
2010
INSTICC
16 years 29 days ago
AdaBoost based Door Detection for Mobile Robots
Jens Hensler, Michael Blaich, Oliver Bittel
Intelligent Agents
Top of PageReset Settings