On-Line Algorithms, Proceedings of a Dimacs Workshop, February 11-13, 1991 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science Volume Seven)

Lyle A. McGeoch & Daniel D. Sleator, editors

ISBN 10: 082186596X / ISBN 13: 9780821865965

Verlag: American Mathematical Society, 1992

Beschreibung

*Price HAS BEEN REDUCED by 10% until Monday, Aug. 25 (weekend SALE item)* 192 pp., Hardcover, fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Bestandsnummer des Verkäufers ZB1198405

Bibliografische Details

• Titel: On-Line Algorithms, Proceedings of a Dimacs Workshop, February 11-13, 1991 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science Volume Seven)
• Verlag: American Mathematical Society
• Erscheinungsjahr: 1992
• Sprache: Englisch
• ISBN-10: 082186596X
• ISBN-13: 9780821865965
• Einband: Hardcover
• Zustand: Fine

Über diesen Titel

Inhaltsangabe

This volume contains the proceedings of the Workshop on On-line Algorithms held at the DIMACS Center at Rutgers University in February 1991. Presenting results in the theory of on-line algorithms, the articles discuss a broad range of problems. Most of the papers are based on competitive (worst-case) analysis of on-line algorithms, but some papers consider alternative approaches to on-line analysis. A critical question examined by some of the authors is how to modify competitive analysis to better reconcile the theory and practice of on-line algorithms. Many of the papers examine the ways in which randomization can be used to yield algorithms with improved performance. This book is aimed primarily at specialists in algorithm analysis, but most of the articles present clear expositions of previous work.

Reseña del editor

This volume contains the proceedings of the Workshop on On-line Algorithms held at the DIMACS Center at Rutgers University in February 1991. Presenting new results in the theory of on-line algorithms, the articles discuss a broad range of problems. Most of the papers are based on competitive (worst-case) analysis of on-line algorithms, but some papers consider alternative approaches to on-line analysis. A critical question examined by some of the authors is how to modify competitive analysis to better reconcile the theory and practice of on-line algorithms. Many of the papers examine the ways in which randomization can be used to yield algorithms with improved performance. This book is aimed primarily at specialists in algorithm analysis, but most of the articles present clear expositions of previous work.