|
Size: 1226
Comment:
|
Size: 1675
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 5: | Line 5: |
| 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ü). 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 [[EfficientRoutePlanningSS2012/ReadOsmResults|Exercise Sheet 1]] and [[EfficientRoutePlanningSS2012/DijkstraResults|Exercise Sheet 2]]. | 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 [[EfficientRoutePlanningSS2012/ReadOsmResults|Exercise Sheet 1]] and [[EfficientRoutePlanningSS2012/DijkstraResults|Exercise Sheet 2]]. |
| Line 8: | Line 8: |
| ||Example ||1.11s / 11.11s ||111,111 / 1,111,111 ||1.11s / 11.11s ||111,111 / 1,111,111 ||1m11s / 11m01s ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ || ||SE KF ||0.030s / 0.612s ||98,817 / 1,286,541 ||0.0013s / 0.0167s ||4,237 / 39,065 ||0m03s / 0m53s ||Intel P8600 @ 2.4Ghz / 4 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 ||320ms / TODO ms ||30,260 / TODO ||32ms / TODOms ||4,668 / 51,049 ||1m33s / TODO ||Intel 2670QM @ 2.1GHz / 4 GB ||Java || ||Viktor K ||93ms / TODO ||35,806 / TODO ||85ms / TODO ||5,087 / TODO ||0m16s / TODO ||Intel T9300 @ 2.5GHz / 4 GB ||Java || ||nils ||35ms / 377ms ||50,148 / 495,077 ||2ms / 19ms ||3,685 / 46,231 ||0m07s / 0m49s ||AMD X2 BE2350 @ 2.1GHz / 4 GB ||C++ || |
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 |
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 |
320ms / TODO ms |
30,260 / TODO |
32ms / TODOms |
4,668 / 51,049 |
1m33s / TODO |
Intel 2670QM @ 2.1GHz / 4 GB |
Java |
Viktor K |
93ms / TODO |
35,806 / TODO |
85ms / TODO |
5,087 / TODO |
0m16s / TODO |
Intel T9300 @ 2.5GHz / 4 GB |
Java |
nils |
35ms / 377ms |
50,148 / 495,077 |
2ms / 19ms |
3,685 / 46,231 |
0m07s / 0m49s |
AMD X2 BE2350 @ 2.1GHz / 4 GB |
C++ |