. .
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: 44.05 €, highest price: 101.83 €, average price: 80.60 €
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 Compet Analysis - Allan Borodin
book is out-of-stock
(*)
Allan Borodin:
Online Computation Compet Analysis - Paperback

2008, ISBN: 0521619467

[SR: 1901905], Paperback, [EAN: 9780521619462], Cambridge University Press, Cambridge University Press, Book, [PU: Cambridge University Press], 2008-08-21, Cambridge University Press, 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..., 14288281, Amazon, 14288271, Online Shopping, 14288081, Digital Lifestyle, 71, Computing & Internet, 1025612, Subjects, 266239, Books, 269709, Algorithms, 269678, Programming, 71, Computing & Internet, 1025612, Subjects, 266239, Books, 269870, Software & Graphics, 404120, Applications, 269871, Business & Home Office, 269912, Desktop Publishing, 269938, Graphics & Multimedia, 269442, Internet Applications, 1035340, Software Design & Development, 71, Computing & Internet, 1025612, Subjects, 266239, Books

Used Book Amazon.co.uk
WillFer
Gebraucht Shipping costs:Europa Zone 1: GBP 5,48 pro Produkt.. Usually dispatched within 1-2 business days (EUR 4.80)
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
book is out-of-stock
(*)
Borodin, Allan:
Online Computation and Competitive Analysis - Paperback

2017, ISBN: 0521619467

ID: 22156410785

[EAN: 9780521619462], Neubuch, [PU: Cambridge University Press], This item is printed on demand.

New book Abebooks.de
Murray Media, North Miami Beach, FL, U.S.A. [59705792] [Rating: 5 (von 5)]
NEW BOOK Shipping costs: EUR 17.83
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

2005, ISBN: 9780521619462

ID: 6425126

Softcover, Buch, [PU: Cambridge University Press]

New book Lehmanns.de
Shipping costs:Versand in 15-20 Tagen, , Versandkostenfrei innerhalb der BRD (EUR 0.00)
Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.

Details of the book
Online Computation and Competitive Analysis
Author:

El-Yaniv, Ran; Borodin, Allan

Title:

Online Computation and Competitive Analysis

ISBN:

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...

Details of the book - Online Computation and Competitive Analysis


EAN (ISBN-13): 9780521619462
ISBN (ISBN-10): 0521619467
Hardcover
Paperback
Publishing year: 2005
Publisher: CAMBRIDGE UNIV PR
436 Pages
Weight: 0,771 kg
Language: eng/Englisch

Book in our database since 12.05.2007 14:18:08
Book found last time on 15.06.2017 14:40:07
ISBN/EAN: 0521619467

ISBN - alternate spelling:
0-521-61946-7, 978-0-521-61946-2


< to archive...
Related books