Sciweavers

467 search results - page 68 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
JPDC
2010
133views more  JPDC 2010»
13 years 2 months ago
Lock-free parallel dynamic programming
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
Alex Stivala, Peter J. Stuckey, Maria Garcia de la...
WEA
2010
Springer
245views Algorithms» more  WEA 2010»
14 years 2 months ago
Contraction of Timetable Networks with Realistic Transfers
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
Robert Geisberger
IICS
2009
Springer
14 years 1 months ago
An Adaptive Policy Routing with Thermal Field Approach
: This paper introduces an adaptive routing approach based on buffer status and distance in a mesh overlay network: Thermal Field is used for considering buffer stage and distance ...
Lada-On Lertsuwanakul, Herwig Unger
GCC
2005
Springer
14 years 27 days ago
A Routing Protocol Based on Trust for MANETs
Abstract. Ad hoc network is a peer-to-peer grid system. The combination of the Knowledge Grid and ad hoc network could have a great effect on the future interconnection environment...
Cuirong Wang, Xiaozong Yang, Yuan Gao
ISMIR
2005
Springer
141views Music» more  ISMIR 2005»
14 years 27 days ago
Rhythm-Based Segmentation of Popular Chinese Music
We present a new method to segment popular music based on rhythm. By computing a shortest path based on the self-similarity matrix calculated from a model of rhythm, segmenting bo...
Kristoffer Jensen, Jieping Xu, Martin Zachariasen