Divid Johnson (5 results)
The Shortest Path Problem Ninth DIMACS Implementation Challenge
Demetrescu, Camil (Editor)/ Goldberg, Andrew V. (Editor)/ Johnson, Divid S. (Editor)
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 150.54
US$ 17.05 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 319 pages. 10.24x7.24x0.87 inches. In Stock.
- Hardcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
US$ 163.01
Free ShippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardback. Condition: 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, ima…ge 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
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
US$ 211.72
US$ 10.50 shippingShips within U.S.A.Quantity: 1 available
Condition: 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 a…rt 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
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
US$ 160.19
US$ 88.66 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardback. Condition: 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, ima…ge 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
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
US$ 261.69
US$ 11.10 shippingShips from Ireland to U.S.A.Quantity: 1 available
Condition: 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 a…rt 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. . . . .
