|
Size: 1299
Comment:
|
Size: 1516
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 4: | Line 4: |
| Add your row to the table below, following the examples already there. In the second column put Saar or !BaWü (put numbers for only one dataset, preferable !BaWü). In the third column, put the total precomputation time (in minutes ans seconds). In the fourth column, put the total number of shortcuts added in your precomputation. In the fifth column, put the average query time in milliseconds (precision: exactly one digit after the dot). In the sixth column, put the average shortest path cost (in minutes and seconds). Last two columns as usual, see the result tables for [[EfficientRoutePlanningSS2012/ReadOsmResults|Exercise Sheet 1]], [[EfficientRoutePlanningSS2012/DijkstraResults|Exercise Sheet 2]], [[EfficientRoutePlanningSS2012/AstarResults|Exercise Sheet 3]], [[EfficientRoutePlanningSS2012/ArcFlagsResults|Exercise Sheet 4]], [[EfficientRoutePlanningSS2012/ContractionResults|Exercise Sheet 6]]. | Add your row to the table below, following the examples already there. In the second column put Saar or !BaWü (put numbers for only one dataset, preferable !BaWü). In the third column, put the update heuristic(s). In the fourth column, put the total precomputation time (in minutes ans seconds). In the fifth column, put the total number of shortcuts added in your precomputation. In the sixth column, put the average query time in milliseconds (precision: exactly one digit after the dot). In the seventh column, put the average shortest path cost (in minutes and seconds). Last two columns as usual, see the result tables for [[EfficientRoutePlanningSS2012/ReadOsmResults|Exercise Sheet 1]], [[EfficientRoutePlanningSS2012/DijkstraResults|Exercise Sheet 2]], [[EfficientRoutePlanningSS2012/AstarResults|Exercise Sheet 3]], [[EfficientRoutePlanningSS2012/ArcFlagsResults|Exercise Sheet 4]], and [[EfficientRoutePlanningSS2012/ContractionResults|Exercise Sheet 6]]. |
| Line 6: | Line 6: |
| ||'''Name''' ||'''Dataset'''|| '''precomp time''' || '''#shortcuts''' || '''av. query time'''|| ''' av. SP cost''' || '''Processor / RAM''' ||'''Language''' || ||Example ||!BaWü || 11min1sec || 111,111 || 1.1ms || 111min11sec ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ || |
||'''Name''' ||'''Dataset'''|| '''ED update'''|| '''precomp. time''' || '''#shortcuts''' || '''av. query time'''|| ''' av. SP cost''' || '''Processor / RAM''' ||'''Language''' || ||Example ||!BaWü || lazy+spatial || 11min1sec || 111,111 || 1.1ms || 111min11sec ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ || ||SE KF ||!BaWü || lazy+neighbour || 1min10sec || 2,352,648 || 0.89ms || 92min31sec ||Intel 2600k @ 4.0Ghz / 16 GB ||C++ || |
Results for Exercise Sheet 6 (Contraction Hierarchies, precomputation + query results)
Add your row to the table below, following the examples already there. In the second column put Saar or BaWü (put numbers for only one dataset, preferable BaWü). In the third column, put the update heuristic(s). In the fourth column, put the total precomputation time (in minutes ans seconds). In the fifth column, put the total number of shortcuts added in your precomputation. In the sixth column, put the average query time in milliseconds (precision: exactly one digit after the dot). In the seventh column, put the average shortest path cost (in minutes and seconds). Last two columns as usual, see the result tables for Exercise Sheet 1, Exercise Sheet 2, Exercise Sheet 3, Exercise Sheet 4, and Exercise Sheet 6.
Name |
Dataset |
ED update |
precomp. time |
#shortcuts |
av. query time |
av. SP cost |
Processor / RAM |
Language |
Example |
BaWü |
lazy+spatial |
11min1sec |
111,111 |
1.1ms |
111min11sec |
Intel X5560 @ 2.8Ghz / 96 GB |
C++ |
SE KF |
BaWü |
lazy+neighbour |
1min10sec |
2,352,648 |
0.89ms |
92min31sec |
Intel 2600k @ 4.0Ghz / 16 GB |
C++ |