Uniform metrical task systems with a limited number of states☆
References (12)
- et al.
Randomized algorithms for metrical task systems
Theoretical Computer Science
(1998) Unfair problems and randomized algorithms for metrical task systems
Information and Computation
(1999)Unfair problems and randomized algorithms for metrical task systems
Information and Computation
(1999)- et al.
A polylog(n)-competitive algorithm for metrical task systems
- et al.
On-line learning and the metrical task system problem
- A. Blum, H.J. Karloff, Y. Rabani, M.E. Saks, A decomposition theorem and bounds for randomized server problems, in:...
There are more references available in the full text version of this article.
Cited by (3)
Caching with dual costs
2017, 26th International World Wide Web Conference 2017, WWW 2017 CompanionA regularization approach to metrical task systems
2010, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Automated physical design in database caches
2008, Proceedings - International Conference on Data Engineering
- ☆
Research of these authors supported by NSF grant CCR-0312093.
- 1
Wolfgang Bein prepared this journal version while on sabbatical as Kyoto University Visiting Professor and while at the University of the Federal Armed Forces Munich under a Lehrauftrag.
Copyright © 2007 Elsevier B.V. All rights reserved.