Sciweavers

219
Voted
ICAART
2010
INSTICC
16 years 21 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
104
Voted
ICAART
2010
INSTICC
16 years 21 days ago
Opinion Polarity Detection - Using Word Sense Disambiguation to Determine the Polarity of Opinions
Tamara Martín-Wanton, Aurora Pons-Porrata, ...
94
Voted
ICAART
2010
INSTICC
16 years 21 days ago
A Cautious Approach to Generalization in Reinforcement Learning
Raphael Fonteneau, Susan A. Murphy, Louis Wehenkel...
81
Voted
ICAART
2010
INSTICC
16 years 21 days ago
Microservices - Lightweight Service Descriptions for REST Architectural Style
José Ignacio Fernández-Villamor, Car...
ICAART
2010
INSTICC
16 years 21 days ago
AdaBoost based Door Detection for Mobile Robots
Jens Hensler, Michael Blaich, Oliver Bittel
Intelligent Agents
Top of PageReset Settings