552 search results - page 17 / 111 » Constrained Shortest Path Computation |
LCN
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
HIPC
2003
Springer
14 years 2 months ago
2003
Springer
4OR
2005
13 years 9 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
EMMCVPR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
IWANN
1997
Springer
14 years 1 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...