Differences between revisions 3 and 8 (spanning 5 versions)

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ü). 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	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++

-  ⇤ ← Revision 3 as of 2012-05-08 20:32:20 → 
  Size: 926
  Editor: Hannah Bast
  Comment:
+   ← Revision 8 as of 2012-05-11 00:42:59 → ⇥
  Size: 1226
  Editor: frbg-4d029134
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 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ü). 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ü). 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:
-||Example ||1.11s / 11.11s ||111,111 / 1,111,111 ||1.11s / 11.11s ||111,111 / 1,111,111 ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ ||
+||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++||