. .
Français
France
Livres similaires
Autres livres qui pourraient ressembler au livre recherché:
Outils de recherche
s'inscrire

Connectez-vous avec Facebook:

S'inscrire
Mot de passe oublié?


Historique de recherche
Liste pense-bête
Liens vers eurolivre.fr

Partager ce livre sur…
Livre conseillé
Actualités
Conseils d'eurolivre.fr
Publicité
FILTRE
- 0 Résultats
prix le plus bas: 44,05 €, prix le plus élevé: 101,83 €, prix moyen: 80,60 €
Online Computation and Competitive Analysis - El-Yaniv, Ran; Borodin, Allan
Livre non disponible
(*)
El-Yaniv, Ran; Borodin, Allan:
Online Computation and Competitive Analysis - nouveau livre

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

Nouveaux livres Buecher.de
No. 14684475 Frais d'envoi, Versandkostenfrei innerhalb von Deutschland, DE, Versandfertig in über 4 Wochen, Lieferzeit 1-2 Werktage (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Online Computation and Competitive Analysis - El-Yaniv, Ran; Borodin, Allan
Livre non disponible
(*)
El-Yaniv, Ran; Borodin, Allan:
Online Computation and Competitive Analysis - edition reliée, livre de poche

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]

Nouveaux livres Buecher.de
Nr. 14684475 Frais d'envoi, , DE. (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Online Computation Compet Analysis - Allan Borodin
Livre non disponible
(*)
Allan Borodin:
Online Computation Compet Analysis - Livres de poche

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

livre d'occasion Amazon.co.uk
WillFer
Gebraucht Frais d'envoiEuropa Zone 1: GBP 5,48 pro Produkt.. Usually dispatched within 1-2 business days (EUR 4.80)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Online Computation and Competitive Analysis - Borodin, Allan
Livre non disponible
(*)
Borodin, Allan:
Online Computation and Competitive Analysis - Livres de poche

2017, ISBN: 0521619467

ID: 22156410785

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

Nouveaux livres Abebooks.de
Murray Media, North Miami Beach, FL, U.S.A. [59705792] [Rating: 5 (von 5)]
NEW BOOK Frais d'envoi EUR 17.83
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Online Computation and Competitive Analysis - Allan Borodin; Ran El-Yaniv
Livre non disponible
(*)
Allan Borodin; Ran El-Yaniv:
Online Computation and Competitive Analysis - Livres de poche

2005, ISBN: 9780521619462

ID: 6425126

Softcover, Buch, [PU: Cambridge University Press]

Nouveaux livres Lehmanns.de
Frais d'envoiVersand in 15-20 Tagen, , Versandkostenfrei innerhalb der BRD (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.

Détails sur le livre
Online Computation and Competitive Analysis
Auteur:

El-Yaniv, Ran; Borodin, Allan

Titre:

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

Informations détaillées sur le livre - Online Computation and Competitive Analysis


EAN (ISBN-13): 9780521619462
ISBN (ISBN-10): 0521619467
Version reliée
Livre de poche
Date de parution: 2005
Editeur: CAMBRIDGE UNIV PR
436 Pages
Poids: 0,771 kg
Langue: eng/Englisch

Livre dans la base de données depuis 12.05.2007 14:18:08
Livre trouvé récemment le 15.06.2017 14:40:07
ISBN/EAN: 9780521619462

ISBN - Autres types d'écriture:
0-521-61946-7, 978-0-521-61946-2


< pour archiver...
Livres en relation