Randomized algorithms for metrical task systems
From MaRDI portal
Publication:1127546
DOI10.1016/S0304-3975(97)00006-6zbMath0911.68071MaRDI QIDQ1127546
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Uniform metrical task systems with a limited number of states ⋮ Parametrized Metrical Task Systems ⋮ Online computation with advice ⋮ Ramsey-type theorems for metric spaces with applications to online problems ⋮ A Combinatorial Metrical Task System Problem Under the Uniform Metric ⋮ Unfair problems and randomized algorithms for metrical task systems ⋮ Competitive analysis of randomized paging algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the power of randomization in on-line algorithms
- Competitive randomized algorithms for nonuniform problems
- Competitive algorithms for server problems
- Self-adjusting binary search trees
- An optimal on-line algorithm for metrical task system
- Traversing Layered Graphs Using the Work Function Algorithm
- Randomized algorithms for metrical task systems