Online Algorithms

The State of the Art

Häftad, Engelska, 1998

1 129 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This anthology presents the state of the art in the area of online algorithms and competitive analysis of such algorithms. The 17 papers are revised versions of presentations given 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.

Produktinformation

Utgivningsdatum1998-08-12
Mått155 x 235 x 25 mm
Vikt692 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor436
Upplaga1998
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540649175

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Optimering inom Naturvetenskap och teknik
Hårdvara inom Data och it

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.