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 8 as of 2011-06-09 18:37:00
AD Teaching Wiki:
  • EfficientRoutePlanningSS2011
  • Experiments2

Your experimental results for exercise sheet 3

Please sumarize your results from exercise sheet 3 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 Dijkstra's algorithm with arc-flags. 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

Ordinary Dijkstra

Arc-flags

Preprocessing

Dataset

Partitions

Partitioning

Hardware

Adrian,Christoph,Kevin

C++

0.029s/84K

0.001s/3.49K

522s

Saarland

100

Kd-Tree

Core2Duo P8600@2.4GHz

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