Size: 994
Comment:
|
Size: 1002
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 3: | Line 3: |
||<tablestyle="width: 1200px; height: 47px;">'''Name''' ||'''Language''' ||'''Preprocessing''' ||'''Query-time''' ||'''Dataset''' ||'''Hardware''' || ||Adrian,Kevin,Christoph ||C++ ||3.7s/244K ||0.39ms/2.3K ||Saarland ||Intel Xeon X5560 @ 2.8GHz || |
|
Line 4: | Line 6: |
||<tablewidth="1200px" tableheight="120px">'''Name''' ||'''Language''' ||'''Preprocessing''' ||'''Query-time''' ||'''Dataset''' ||'''Hardware''' || ||Richard Routenplanung ||C++ ||500s/300K || 5ms/2.3K || Saarland || Intel XFuture @ 200GHz || |
Your experimental results for exercise sheet 5
Please sumarize your results from exercise sheet 5 in a row in the table below. In the first column, write your name (abbreviate if you are in a group, to keep it short). In the second column, put the programming language you used (C++ or Java). In the third column put the preprocessing time (in seconds) and the number of inserted shortcuts. In the fourth column put the average running time (in milliseconds) and the number of settled nodes for 1000 random queries using the Contraction Hierarchies algorithm. In the fifth column put the name of the dataset you computed these average times on (preferably Ba-Wü, but if that didn't work Saarland). In the last column put the used hardware.
Name |
Language |
Preprocessing |
Query-time |
Dataset |
Hardware |
Adrian,Kevin,Christoph |
C++ |
3.7s/244K |
0.39ms/2.3K |
Saarland |
Intel Xeon X5560 @ 2.8GHz |