Online Computation and Competitive Analysis
Autor Allan Borodin, Ran El-Yaniven Limba Engleză Paperback – 16 feb 2005
Preț: 602.28 lei
Preț vechi: 752.85 lei
-20% Nou
Puncte Express: 903
Preț estimativ în valută:
115.26€ • 120.18$ • 95.79£
115.26€ • 120.18$ • 95.79£
Carte tipărită la comandă
Livrare economică 21 martie-04 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780521619462
ISBN-10: 0521619467
Pagini: 436
Ilustrații: 39 b/w illus. 7 tables
Dimensiuni: 188 x 246 x 22 mm
Greutate: 0.78 kg
Ediția:Pbk.
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States
ISBN-10: 0521619467
Pagini: 436
Ilustrații: 39 b/w illus. 7 tables
Dimensiuni: 188 x 246 x 22 mm
Greutate: 0.78 kg
Ediția:Pbk.
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States
Cuprins
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.
Descriere
Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms.