Johnson divid (5 Ergebnisse)
- Hardcover
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes KönigreichRarewaves.com USA
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 143,72
Versand gratisVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardback. Zustand: New. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image… segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950's and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings.
The Shortest Path Problem Ninth DIMACS Implementation Challenge
Demetrescu, Camil (Editor)/ Goldberg, Andrew V. (Editor)/ Johnson, Divid S. (Editor)
- Hardcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 128,88
EUR 14,60 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Hardcover. Zustand: Brand New. 319 pages. 10.24x7.24x0.87 inches. In Stock.
The Shortest Path Problem: Ninth Dimacs Implementation Challenge
. Ed(s): Demetrescu, Camil; Goldberg, Andrew V.; Johnson, David S.
- Hardcover
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 186,67
EUR 8,99 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: New. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art… in shortest path algorithms. Editor(s): Demetrescu, Camil; Goldberg, Andrew V.; Johnson, David S. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 319 pages, Illustrations 1 map, BIC Classification: PBD; PBV. Category: (UP) Postgraduate, Research & Scholarly. Weight in Grams: 756. . 2009. hardcover. . . . . Books ship from the US and Ireland.
- Hardcover
Anbieter: Rarewaves.com UK, London, Vereinigtes KönigreichRarewaves.com UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 137,14
EUR 75,90 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardback. Zustand: New. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image… segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950's and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings.
The Shortest Path Problem: Ninth Dimacs Implementation Challenge
. Ed(s): Demetrescu, Camil; Goldberg, Andrew V.; Johnson, David S.
- 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 217,43
EUR 9,50 VersandVersand von Irland nach USAAnzahl: 1 verfügbar
Zustand: New. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art… in shortest path algorithms. Editor(s): Demetrescu, Camil; Goldberg, Andrew V.; Johnson, David S. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 319 pages, Illustrations 1 map, BIC Classification: PBD; PBV. Category: (UP) Postgraduate, Research & Scholarly. Weight in Grams: 756. . 2009. hardcover. . . . .
