Online Algorithms The State of the Art /
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 e...
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | , |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
1998.
|
Έκδοση: | 1st ed. 1998. |
Σειρά: | Lecture Notes in Computer Science,
1442 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.