Sciweavers

763 search results - page 30 / 153
» Engineering Shortest Path Algorithms
Sort
View
KBSE
2007
IEEE
14 years 1 months ago
Synthesis of test purpose directed reactive planning tester for nondeterministic systems
We describe a model-based construction of an online tester for black-box testing of implementation under test (IUT). The external behavior of the IUT is modeled as an output obser...
Jüri Vain, Kullo Raiend, Andres Kull, Juhan P...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
14 years 1 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 23 days ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
PAMI
2010
188views more  PAMI 2010»
13 years 2 months ago
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
SSD
2005
Springer
153views Database» more  SSD 2005»
14 years 1 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...