Randomized algorithms for metrical task systems
From MaRDI portal
Publication:5057430
DOI10.1007/3-540-60220-8_59zbMath1502.68047OpenAlexW1575141434MaRDI QIDQ5057430
Publication date: 16 December 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60220-8_59
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (3)
Randomized algorithms for metrical task systems ⋮ Unfair problems and randomized algorithms for metrical task systems ⋮ A randomized algorithm for two servers on the line.
Cites Work
- Unnamed Item
- A note on the server problem and a benevolent adversary
- 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
This page was built for publication: Randomized algorithms for metrical task systems