706 search results - page 46 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Continuous monitoring and diagnosis of network performance are of crucial importance for the Internet access service and virtual private network (VPN) service providers. Various o...
TIP
2010
13 years 2 months ago
2010
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
JCO
2006
13 years 7 months 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...
JCM
2007
13 years 7 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
BROADNETS
2007
IEEE
14 years 2 months ago
2007
IEEE
—Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flo...