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.
"synopsis" may belong to another edition of this title.
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. 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. Seller Inventory # LU-9780821865965
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 192 pages. 10.50x7.50x0.75 inches. In Stock. Seller Inventory # __082186596X
Quantity: 2 available
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. Contains the proceedings of the Workshop on On-line Algorithms held at the DIMACS Center at Rutgers University in February 1991. This work examines the ways in which randomization can be used to yield algorithms with improved performance. It is suitable for specialists in algorithm analysis. Editor(s): McGeogh, Lyle A.; Sleator, Daniel D. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 192 pages. BIC Classification: PBC; UM; UNC. Category: (P) Professional & Vocational. Dimension: 267 x 190. Weight in Grams: 595. . 1992. hardcover. . . . . Books ship from the US and Ireland. Seller Inventory # V9780821865965
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. Contains the proceedings of the Workshop on On-line Algorithms held at the DIMACS Center at Rutgers University in February 1991. This work examines the ways in which randomization can be used to yield algorithms with improved performance. It is suitable for specialists in algorithm analysis. Editor(s): McGeogh, Lyle A.; Sleator, Daniel D. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 192 pages. BIC Classification: PBC; UM; UNC. Category: (P) Professional & Vocational. Dimension: 267 x 190. Weight in Grams: 595. . 1992. hardcover. . . . . Seller Inventory # V9780821865965
Quantity: 1 available
Seller: Rarewaves.com UK, London, United Kingdom
Hardback. Condition: New. 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. Seller Inventory # LU-9780821865965
Quantity: 1 available