Sciweavers

450 search results - page 17 / 90
» Adaptive Algorithms for Online Decision Problems
Sort
View
ICRA
2003
IEEE
167views Robotics» more  ICRA 2003»
14 years 1 months ago
Local exploration: online algorithms and a probabilistic framework
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
Volkan Isler, Sampath Kannan, Kostas Daniilidis
TSP
2010
13 years 2 months ago
Generalized adaptive notch smoothing revisited
The problem of identification of quasi-periodically varying dynamic systems is considered. This problem can be solved using generalized adaptive notch filtering (GANF) algorithms. ...
Maciej Niedzwiecki
ICIP
2009
IEEE
13 years 5 months ago
An incremental extremely random forest classifier for online learning and tracking
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li
ATAL
2009
Springer
14 years 2 months ago
Online exploration in least-squares policy iteration
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
Lihong Li, Michael L. Littman, Christopher R. Mans...
LION
2010
Springer
190views Optimization» more  LION 2010»
13 years 12 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber