Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1110731#aggregation> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- aggregation classification "C1".
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2010".
- aggregation format "application/pdf".
- aggregation hasFormat 1110731.bibtex.
- aggregation hasFormat 1110731.csv.
- aggregation hasFormat 1110731.dc.
- aggregation hasFormat 1110731.didl.
- aggregation hasFormat 1110731.doc.
- aggregation hasFormat 1110731.json.
- aggregation hasFormat 1110731.mets.
- aggregation hasFormat 1110731.mods.
- aggregation hasFormat 1110731.rdf.
- aggregation hasFormat 1110731.ris.
- aggregation hasFormat 1110731.txt.
- aggregation hasFormat 1110731.xls.
- aggregation hasFormat 1110731.yaml.
- aggregation isPartOf urn:isbn:9781424476572.
- aggregation isPartOf urn:isbn:9781424476589.
- aggregation isPartOf urn:isbn:9781424476596.
- aggregation language "eng".
- aggregation publisher "IEEE".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Science General".
- aggregation title "The predecessor and the accounting algorithm speed up shortest path calculations in traffic routing applications".
- aggregation abstract "As traffic routing applications usually are heavily burdened due to the many requests, a low execution time of the shortest path algorithms is of uttermost importance. In this article two goal-directed heuristics are presented, which reduce this execution time. By guiding the search toward the destination and neglecting the less interesting areas of the network a remarkable speedup can be realized, especially in large networks like traffic networks. The predecessor algorithm makes use of local information in order to guide the search towards the destination, while the accounting algorithm additionally uses the path's history to direct the search in the right direction. Both algorithms have been tested on a European road network. It is shown experimentally that these heuristics indeed realize a speedup and are more accurate than most existing goal-directed heuristics.".
- aggregation authorList BK179151.
- aggregation endPage "985".
- aggregation startPage "980".
- aggregation aggregates 1110733.
- aggregation aggregates 1110735.
- aggregation isDescribedBy 1110731.
- aggregation similarTo ITSC.2010.5625085.
- aggregation similarTo LU-1110731.