3678 search results - page 129 / 736 » On the Stable Paths Problem |
131
click to vote
EMMCVPR
2007
Springer
15 years 4 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...
107
click to vote
JSAC
2006
15 years 23 days ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
109
Voted
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— The problem of establishing if it is possible to reach the desired location keeping all features in the field of view and following a straight line is considered. The proposed...
112
click to vote
JCO
2006
15 years 24 days ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
93
Voted
INFOCOM
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...