. .
English
United States
Similar books
More/other books that might be very similar to this book
Search tools
Sign in
Share this book on...
Book recommendations
Latest news
Tip from find-more-books.com
Advertising
FILTER
- 0 Results
Lowest price: 88.95 €, highest price: 90.49 €, average price: 89.51 €
Online Computation and Competitive Analysis - El-Yaniv, Ran; Borodin, Allan
book is out-of-stock
(*)
El-Yaniv, Ran; Borodin, Allan:

Online Computation and Competitive Analysis - new book

ISBN: 9780521619462

ID: 227332815

Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms. In online computation a computer algorithm must decide how to act on incoming items of information without any knowledge of future inputs. How should it route the next telephone call? Where in memory should it store a just-closed record? This book provides an in-depth presentation of competitive analysis, an attractive framework within which such problems can be analyzed and solved. In this framework, the quality of an algorithm is measured relative to the best possible performance of an algorithm that has complete knowledge of the future. This methodology for the analysis of online decision making has become a standard approach in computer science. Starting with the basic definitions of the competitive analysis model, the authors present most of the essential techniques through various examples, some of which are among the central problems of the field, 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. The book also shows how competitive analysis relates to more classical subjects such as game theory and decision theory. This is an important text and reference for researchers and graduate students in theoretical computer science and in operations research. Table of content: 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. Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms. In online computation a computer algorithm must decide how to act on incoming items of information without any knowledge of future inputs. How should it route the next telephone call? Where in memory should it store a just-closed record? This book provides an in-depth presentation of competitive analysis, an attractive framework within which such problems can be analyzed and solved. In Buch > Mathematik, Naturwissenschaft & Technik > Informatik & EDV, CAMBRIDGE UNIV PR

New book Buecher.de
No. 14684475 Shipping costs:, Versandkostenfrei innerhalb von Deutschland, DE, Versandfertig in über 4 Wochen, Lieferzeit 1-2 Werktage (EUR 0.00)
Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.
Online Computation and Competitive Analysis - El-Yaniv, Ran; Borodin, Allan
book is out-of-stock
(*)

El-Yaniv, Ran; Borodin, Allan:

Online Computation and Competitive Analysis - hardcover

ISBN: 9780521619462

ID: a214b4159cbf20fb039dc6f383243fde

Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms.In online computation a computer algorithm must decide how to act on incoming items of information without any knowledge of future inputs. How should it route the next telephone call? Where in memory should it store a just-closed record? This book provides an in-depth presentation of competitive analysis, an attractive framework within which such problems can be analyzed and solved. In this framework, the quality of an algorithm is measured relative to the best possible performance of an algorithm that has complete knowledge of the future. This methodology for the analysis of online decision making has become a standard approach in computer science. Starting with the basic definitions of the competitive analysis model, the authors present most of the essential techniques through various examples, some of which are among the central problems of the field, 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. The book also shows how competitive analysis relates to more classical subjects such as game theory and decision theory. This is an important text and reference for researchers and graduate students in theoretical computer science and in operations research.Table of content: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. Buch / Mathematik, Naturwissenschaft & Technik / Informatik & EDV, [PU: Cambridge University Press]

New book Buecher.de
Nr. 14684475 Shipping costs:, , DE. (EUR 0.00)
Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.
Online Computation and Competitive Analysis - Borodin, Allan; El-Yaniv, Ran
book is out-of-stock
(*)
Borodin, Allan; El-Yaniv, Ran:
Online Computation and Competitive Analysis - Paperback

2005

ISBN: 0521619467

ID: 14096142906

[EAN: 9780521619462], Neubuch, [PU: Cambridge University Press], Mathematics|Mathematical Analysis, Computers & the Internet|General, Computers & the Internet|Machine Theory, Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: 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.

New book Abebooks.de
Book Deals, Lewiston, NY, U.S.A. [60506629] [Rating: 4 (von 5)]
NEW BOOK Shipping costs: EUR 67.38
Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.
Online Computation and Competitive Analysis - El-Yaniv, Ran Borodin, Allan
book is out-of-stock
(*)
El-Yaniv, Ran Borodin, Allan:
Online Computation and Competitive Analysis - Paperback

ISBN: 9780521619462

[ED: Softcover], [PU: Cambridge University Press], 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.w. 39 figs.Versandfertig in über 4 Wochen, [SC: 0.00]

New book Booklooker.de
buecher.de GmbH & Co. KG
Shipping costs:Versandkostenfrei, Versand nach Deutschland (EUR 0.00)
Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.
Online Computation and Competitive Analysis - Allan Borodin, Ran El-Yaniv
book is out-of-stock
(*)
Allan Borodin, Ran El-Yaniv:
Online Computation and Competitive Analysis - Paperback

ISBN: 9780521619462

ID: 576488004

Cambridge University Press. Paperback. New. Buy with confidence. Excellent Customer Service & Return policy. Ships Fast. Expedite Shipping Available., Cambridge University Press

Used Book Biblio.com
ExtremelyReliable
Shipping costs: EUR 17.00
Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.