Sleator daniel (5 Ergebnisse)
- Hardcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 50,47
EUR 14,62 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Hardcover. Zustand: Brand New. 192 pages. 10.50x7.50x0.75 inches. In Stock.
- Hardcover
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes KönigreichRarewaves.com USA
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 67,03
Versand gratisVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardback. Zustand: 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) anal…ysis 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
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 76,97
EUR 9,08 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: 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, Lyl…e 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
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandKennys Bookshop and Art Galleries Ltd.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 88,79
EUR 9,50 VersandVersand von Irland nach USAAnzahl: 1 verfügbar
Zustand: 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, Lyl…e 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
Anbieter: Rarewaves.com UK, London, Vereinigtes KönigreichRarewaves.com UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 56,46
EUR 76,00 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardback. Zustand: 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) anal…ysis 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.
