Online Algorithms: The State of the Art (Lecture Notes in Computer Science)

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.

Download Uploading.com (Only these country please: US, DE, ES, UK, FR, RU, UA, IT, CA, NL, AT, CZ, GR, PL)
Click Here

Download Rapidshare.com (Other countries)
Click Here

Disclaimer:
Contents of this page are indexed from the Internet. All actions are under your responsability. Email us to report illegal contents or external links and we'll remove them immediately.

Please check the description for download links if any or do a search to find alternative books.

Can't Download?
Please search mirrors if you can't find download links for "Online Algorithms: The State of the Art (Lecture Notes in Computer Science)" in "Description" and someone else may update the links. Check the comments when back to find any updates.

Search Mirrors
Maybe some mirror pages will be helpful, search this book at top of this page or click here to find more info.

1. Ebooks list page : 2826
2. Algorithms for Parallel Polygon Rendering (Lecture Notes in Computer Science)
3. Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)
4. Algorithms for Parallel Polygon Rendering (Lecture Notes in Computer Science)
5. Algorithms for Memory Hierarchies: Advanced Lectures (Lecture Notes in Computer Science)
6. Algorithms for Memory Hierarchies: Advanced Lectures (Lecture Notes in Computer Science)
7. A Collection of Test Problems for Constrained Global Optimization Algorithms (Lecture Notes in Computer Science)
8. A Collection of Test Problems for Constrained Global Optimization Algorithms (Lecture Notes in Computer Science)
9. Fun with Algorithms: 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings (Lecture Notes in Computer Science)
10. Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (Lecture Notes in Computer Science)
11. The Use of Projective Geometry in Computer Graphics (Lecture Notes in Computer Science, Vol 564)
12. New Algorithms for Macromolecular Simulation (Lecture Notes in Computational Science and Engineering) (Repost)
13. Transactions on Computational Science I (Lecture Notes in Computer Science)
14. Transactions on Computational Science I (Lecture Notes in Computer Science)
15. Deontic Logic in Computer Science: 7th International Workshop on Deontic Logic in Computer Science, DEON 2004, Madeira, Portugal, May 26-28, 2004. Proceedings (Lecture Notes in Computer Science)
16. CONLAN Report (Lecture Notes in Computer Science)