5 search results - page 1 / 1 » Algorithms for Finding Optimal Disjoint Paths Around a Recta... |
ISAAC
1997
Springer
13 years 8 months ago
1997
Springer
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Object localization in an image is usually handled by searching for an optimal subwindow that tightly covers the object of interest. However, the subwindows considered in previous ...
ICDCS
2009
IEEE
13 years 2 months ago
2009
IEEE
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
COMCOM
2008
13 years 4 months ago
2008
Internet IP networks utilize multiple-protocol label switching (MPLS), which provides a reliable label switched path (LSP). LSP in MPLS domains needs one label at each Ingress lab...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
We address the problem of navigating from an initial node to a goal node by a group of agents in an unknown physical environment. In such environments mobile agents must physicall...