Sciweavers

450 search results - page 2 / 90
» Adaptive Algorithms for Online Decision Problems
Sort
View
ICPR
2008
IEEE
13 years 11 months ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
ICML
2009
IEEE
14 years 6 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 6 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
IJCAI
2007
13 years 6 months ago
Online Speed Adaptation Using Supervised Learning for High-Speed, Off-Road Autonomous Driving
The mobile robotics community has traditionally addressed motion planning and navigation in terms of steering decisions. However, selecting the best speed is also important – be...
David Stavens, Gabriel Hoffmann, Sebastian Thrun
ECCC
2010
80views more  ECCC 2010»
13 years 5 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...