Effiziente Algorithmen für ein Fahrplanauskunftsystem

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:4eac15e1955bcd68ef709b881c9c5040

SCHULZ, Frank, 2000. Effiziente Algorithmen für ein Fahrplanauskunftsystem [Master thesis]

@mastersthesis{Schulz2000Effiz-5962, title={Effiziente Algorithmen für ein Fahrplanauskunftsystem}, year={2000}, author={Schulz, Frank} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5962"> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:abstract xml:lang="eng">Algorithms for timetable information systems are usually based on Dijkstra's algorithm. The concrete scenario that we have in mind is a central information server in the realm of public railroad traffic on wide-area networks. Due to the large size of the underlying timetables the efficiency of a naive implementation is not acceptable in practice, so usually heuristics are used to improve the efficiency. Typically, using such heuristics means that the optimality of the solutions can no longer be guaranteed. In contrast, we investigate optimality-preserving speed-up techniques for Dijkstra's algorithm. The basic question is whether algorithms that compute optimal solutions are competitive on contemporary computer technology. Therefore, we present the results of a computational study based on real-world data: the timetable that contains all German trains, and a snapshot of customer queries to an existing information server.</dcterms:abstract> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5962/1/preprint_110.pdf"/> <dcterms:title>Effiziente Algorithmen für ein Fahrplanauskunftsystem</dcterms:title> <dc:creator>Schulz, Frank</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5962"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5962/1/preprint_110.pdf"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:25Z</dc:date> <dc:contributor>Schulz, Frank</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:25Z</dcterms:available> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dc:language>eng</dc:language> <dc:format>application/pdf</dc:format> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:issued>2000</dcterms:issued> <dc:rights>deposit-license</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

preprint_110.pdf 89

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto