Sciweavers

376 search results - page 1 / 76
» On the Advice Complexity of Online Problems
Sort
View
ICALP
2011
Springer
12 years 7 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
ISAAC
2009
Springer
145views Algorithms» more  ISAAC 2009»
13 years 10 months ago
On the Advice Complexity of Online Problems
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
AAAI
2008
13 years 6 months ago
Online Learning with Expert Advice and Finite-Horizon Constraints
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
Branislav Kveton, Jia Yuan Yu, Georgios Theocharou...
WEBI
2005
Springer
13 years 9 months ago
Providing Expert Advice by Analogy for On-Line Help
One of the principal problems of online help is the mismatch between the specialized knowledge and technical vocabulary of experts who are providing the help, and the relative naÃ...
Henry Lieberman, Ashwani Kumar
COLT
2008
Springer
13 years 5 months ago
Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs
Prediction from expert advice is a fundamental problem in machine learning. A major pillar of the field is the existence of learning algorithms whose average loss approaches that ...
Elad Hazan, Satyen Kale