. .
Deutsch
Deutschland
Ähnliche Bücher
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Suchtools
Anmelden

Anmelden mit Facebook:

Registrieren
Passwort vergessen?


Such-Historie
Merkliste
Links zu eurobuch.com

Dieses Buch teilen auf…
..?
Buchtipps
Aktuelles
Tipp von eurobuch.com
FILTER
- 0 Ergebnisse
Kleinster Preis: 88.95 EUR, größter Preis: 90.49 EUR, Mittelwert: 89.51 EUR
Online Computation and Competitive Analysis - El-Yaniv, Ran; Borodin, Allan
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
El-Yaniv, Ran; Borodin, Allan:

Online Computation and Competitive Analysis - neues Buch

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

Neues Buch Buecher.de
No. 14684475 Versandkosten:, Versandkostenfrei innerhalb von Deutschland, DE, Versandfertig in über 4 Wochen, Lieferzeit 1-2 Werktage (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Online Computation and Competitive Analysis - El-Yaniv, Ran; Borodin, Allan
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)

El-Yaniv, Ran; Borodin, Allan:

Online Computation and Competitive Analysis - gebunden oder broschiert

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]

Neues Buch Buecher.de
Nr. 14684475 Versandkosten:, , DE. (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Online Computation and Competitive Analysis - Borodin, Allan; El-Yaniv, Ran
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Borodin, Allan; El-Yaniv, Ran:
Online Computation and Competitive Analysis - Taschenbuch

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.

Neues Buch Abebooks.de
Book Deals, Lewiston, NY, U.S.A. [60506629] [Rating: 4 (von 5)]
NEW BOOK Versandkosten: EUR 67.38
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Online Computation and Competitive Analysis - El-Yaniv, Ran Borodin, Allan
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
El-Yaniv, Ran Borodin, Allan:
Online Computation and Competitive Analysis - Taschenbuch

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]

Neues Buch Booklooker.de
buecher.de GmbH & Co. KG
Versandkosten:Versandkostenfrei, Versand nach Deutschland (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Online Computation and Competitive Analysis - Allan Borodin, Ran El-Yaniv
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Allan Borodin, Ran El-Yaniv:
Online Computation and Competitive Analysis - Taschenbuch

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

gebrauchtes bzw. antiquarisches Buch Biblio.com
ExtremelyReliable
Versandkosten: EUR 17.00
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

< zum Suchergebnis...
Details zum Buch
Online Computation and Competitive Analysis
Autor:

El-Yaniv, Ran; Borodin, Allan

Titel:

Online Computation and Competitive Analysis

ISBN-Nummer:

9780521619462

Detailangaben zum Buch - Online Computation and Competitive Analysis


EAN (ISBN-13): 9780521619462
ISBN (ISBN-10): 0521619467
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2005
Herausgeber: CAMBRIDGE UNIV PR
436 Seiten
Gewicht: 0,771 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 12.05.2007 14:18:08
Buch zuletzt gefunden am 28.06.2016 10:30:58
ISBN/EAN: 9780521619462

ISBN - alternative Schreibweisen:
0-521-61946-7, 978-0-521-61946-2

< zum Suchergebnis...
< zum Archiv...
Benachbarte Bücher