8540 search results - page 18 / 1708 » The Dynamic Servers Problem |
STACS
2000
Springer
14 years 1 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
13 years 1 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...
TPDS
2008
13 years 9 months ago
2008
Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. For these systems to be effective, lo...
ICALP
2010
Springer
13 years 7 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
FCT
2005
Springer
14 years 3 months ago
2005
Springer