Online Computation and Competitive Analysis - Rilegato

Borodin, Allan; El-Yaniv, Ran

Rilegato

ISBN 10: 0521563925 ISBN 13: 9780521563925

Casa editrice: Cambridge University Press, 1998

Riassunto

Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms.

Su questo libro

Descrizione del libro

This graduate text and reference provides an in-depth presentation of competitive analysis, a framework for measuring the performance of online algorithms. The authors present the essential techniques through various examples and applications such as list accessing, paging in a virtual memory system, routing in a communication network, metrical task systems, k-server systems, load balancing, search, and portfolio selection.

Contenuti

Preface; 1. Introduction to competitive analysis: the list accessing problem; 2. Introduction to randomized algorithms: the list accessing problem; 3. Paging: deterministic algorithms; 4. Paging: randomized algorithms; 5. Alternative models for paging: beyond pure competitive analysis; 6. Game theoretic foundations; 7. Request - answer games; 8. Competitive analysis and zero-sum games; 9. Metrical task systems; 10. The k-server problem; 11. Randomized k-server algorithms; 12. Load-balancing; 13. Call admission and circuit-routing; 14. Search, trading and portfolio selection; 15. Competitive analysis and decision making under uncertainty; Appendices; Bibliography; Index.

Dettagli dell'edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 1998
• Lingua: Inglese
• ISBN 10: 0521563925
• ISBN 13: 9780521563925
• Rilegatura: Copertina rigida
• Numero di pagine: 432
• Contatto del produttore: non disponibile
• Persona responsabile: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; Francia