1691 search results - page 1 / 339 » The Delayed k-Server Problem |
FCT
2005
Springer
13 years 10 months ago
2005
Springer
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...
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...
ICALP
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Cot
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
