AD Teaching Wiki:

Results for Exercise Sheet 2 (A* results)

Add your row to the table below, following the examples already there. A*-Straight refers to A* with the straight-line heuristic. A*-Landmarks refers to A* with the landmarks heuristic with 16 landmarks picked at random. As usual, provide the figures (for columns 2 - 5 for both Saarland and Ba-Wü). Provide the query times in milliseconds (ms) please, rounded to the next integer. As noted on the exercise sheet, for the query times of A*-Landmarks do not include the time for the computation of the heuristic function. Last two columns as usual, see the result tables for Exercise Sheet 1 and Exercise Sheet 2.

Name

A*-Straight: query time

A*-Straight: #settled nodes

A*-Landmarks: query time

A*-Landmarks: #settled nodes

A*-Landmarks: precomp. time

Processor / RAM

Language

Example

11ms / 111ms

111,111 / 1,111,111

11ms / 111ms

111,111 / 1,111,111

1m11s / 11m01s

Intel X5560 @ 2.8Ghz / 96 GB

C++

SE KF

30ms / 600ms

98,817 / 1,286,541

1ms / 16ms

4,237 / 39,065

0m03s / 0m51s

Intel P8600 @ 2.4Ghz / 4 GB

C++

niklas m.

96ms / 1055ms

58,230 / 579,170

8ms / 99ms

5,445 / 51,049

0m14s / 3m10s

Intel 2410M @ 2.3GHz / 4 GB

C++

Stefan W

X ms / TODO ms

TODO / TODO

32ms / TODOms

4,668 / 51,049

1m33s / TODO

Intel 2670QM @ 2.1GHz / 4 GB

Java

AD Teaching Wiki: EfficientRoutePlanningSS2012/AstarResults (last edited 2012-05-14 16:17:19 by fp-192-52-25-140)