ShopSpell

Online Computation and Competitive Analysis [Paperback]

$111.99       (Free Shipping)
80 available
  • Category: Books (Computers)
  • Author:  Borodin, Allan, El-Yaniv, Ran
  • Author:  Borodin, Allan, El-Yaniv, Ran
  • ISBN-10:  0521619467
  • ISBN-10:  0521619467
  • ISBN-13:  9780521619462
  • ISBN-13:  9780521619462
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  436
  • Pages:  436
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-May-2005
  • Pub Date:  01-May-2005
  • SKU:  0521619467-11-MPOD
  • SKU:  0521619467-11-MPOD
  • Item ID: 100847599
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Apr 01 to Apr 03
  • Notes: Brand New Book. Order Now.
Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms.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.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.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 portfolilsŒ
Add Review