Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007918866/catalog> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- catalog abstract "This coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996. An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work. The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area.".
- catalog contributor b10972386.
- catalog contributor b10972387.
- catalog contributor b10972388.
- catalog created "1998.".
- catalog date "1998".
- catalog date "1998.".
- catalog dateCopyrighted "1998.".
- catalog description "Competitive analysis of algorithms -- Self-organizing data structures -- Competitive analysis of paging -- Metrical task systems, the server problem and the work function algorithm -- Distributed paging -- Competitive analysis of distributed algorithms -- On-line packing and covering problems -- On-line load balancing -- On-line scheduling -- On-line searching and navigation -- On-line network routing -- On-line network optimization problems -- Coloring graphs on-line -- On-Line Algorithms in Machine Learning -- Competitive solutions for on-line financial problems -- On the performance of competitive algorithms in practice -- Competitive odds and ends.".
- catalog description "Includes bibliographical references (p. [395]-436)".
- catalog description "This coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996. An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work. The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area.".
- catalog extent "xviii, 436 p. :".
- catalog identifier "3540649174 (alk. paper)".
- catalog isPartOf "Lecture notes in computer science ; 1442".
- catalog issued "1998".
- catalog issued "1998.".
- catalog language "eng".
- catalog publisher "New York : Springer,".
- catalog subject "005.1 21".
- catalog subject "Computational complexity.".
- catalog subject "Computer Communication Networks.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Mathematical optimization.".
- catalog subject "Online algorithms.".
- catalog subject "QA76.9.A43 F53 1998".
- catalog tableOfContents "Competitive analysis of algorithms -- Self-organizing data structures -- Competitive analysis of paging -- Metrical task systems, the server problem and the work function algorithm -- Distributed paging -- Competitive analysis of distributed algorithms -- On-line packing and covering problems -- On-line load balancing -- On-line scheduling -- On-line searching and navigation -- On-line network routing -- On-line network optimization problems -- Coloring graphs on-line -- On-Line Algorithms in Machine Learning -- Competitive solutions for on-line financial problems -- On the performance of competitive algorithms in practice -- Competitive odds and ends.".
- catalog title "Online algorithms : the state of the art / Amos Fiat, Gerhard J. Woeginger (eds.).".
- catalog type "text".