866 search results - page 20 / 174 » On Dynamic Shortest Paths Problems |
INFORMS
2008
14 years 9 months ago
2008
64
Voted
JAL
2000
14 years 9 months ago
2000
107
click to vote
COMGEO
2006
ACM
14 years 9 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
ESOP
2006
Springer
15 years 1 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
CAV
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...