Sleator Daniel (5 results)
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 58.39
US$ 16.91 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 192 pages. 10.50x7.50x0.75 inches. In Stock.
- Hardcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
US$ 75.29
Free ShippingShips from United Kingdom to U.S.A.Quantity: 1 available
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) an…alysis 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.
- Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
US$ 86.46
US$ 10.50 shippingShips within U.S.A.Quantity: 1 available
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, L…yle 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.
- Hardcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
US$ 105.80
US$ 10.99 shippingShips from Ireland to U.S.A.Quantity: 1 available
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, L…yle 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. . . . .
- Hardcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
US$ 65.33
US$ 87.93 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
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) an…alysis 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.
