425 search results - page 1 / 85 » On the additive constant of the k-server Work Function Algor... |
STACS
2000
Springer
13 years 8 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
IPL
2010
13 years 3 months ago
2010
We consider the Work Function Algorithm for the k-server problem [2, 3]. We show that if the Work Function algorithm is c-competitive, then it is also strictly (2c)-competitive. A...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
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...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We derive an exact and efficient Bayesian regression algorithm for piecewise constant functions of unknown segment number, boundary location, and levels. It works for any noise an...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...