Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9780521619462_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms. Num Pages: 436 pages, 39 b/w illus. 7 tables. BIC Classification: UM. Category: (P) Professional & Vocational. Dimension: 253 x 177 x 22. Weight in Grams: 780. . 2008. Illustrated. paperback. . . . . Books ship from the US and Ireland. Artikel-Nr. V9780521619462
Anzahl: Mehr als 20 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 436 | Sprache: Englisch | Produktart: Bücher | 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. Artikel-Nr. 2511623/2
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9780521619462
Anzahl: 1 verfügbar