AD Teaching Wiki
  • Comments
  • Immutable Page
  • Menu
    • Navigation
    • RecentChanges
    • FindPage
    • Local Site Map
    • Help
    • HelpContents
    • HelpOnMoinWikiSyntax
    • Display
    • Attachments
    • Info
    • Raw Text
    • Print View
    • Edit
    • Load
    • Save
  • Login

FrontPage

Revision 12 as of 2011-05-18 23:43:31
AD Teaching Wiki:
  • EfficientRoutePlanningSS2011
  • Experiments

Your experimental results for exercise sheet 1

Please sumarize your results from exercise sheet 1 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 average running time (in seconds) for 1000 random queries using Dijkstra's algorithm. In the fourth column put the average running time (in seconds) for 1000 random queries using A-star with the straightline heuristic. In the last column put the name of the dataset you computed these average times on (preferably Ba-Wü, but if that didn't work Saarland).

|| Name || Language || Dijkstra || A-Star || Dataset || # of routes tested || Hardware

Adrian,Kevin,Christoph

C++

0.113(#settled:81744)

0.078s(#settled: 46587)

Saarland

1000

Core2Duo P8600 @ 2.4Ghz

Adrian,Kevin,Christoph

C++

5.46s

3.29s

Ba-Wü

100

Core2Duo P8600 @ 2.4Ghz

Michael,Sebastian,Simon

Java

0.018s

0.027s

Saarland

1000

Core i7 920 @ 2.67 GHz

Michael,Sebastian,Simon

Java

0.282s

0.435s

Ba-Wü

1000

Core i7 920 @ 2.67 GHz

  • MoinMoin Powered
  • Python Powered
  • GPL licensed
  • Valid HTML 4.01