290 search results - page 4 / 58 » Network as a Computer: Ranking Paths to Find Flows |
APNOMS
2006
Springer
13 years 9 months ago
2006
Springer
As the network technology has been developed, the Next Generation Internet (NGI) such as Internet2, KOREN, KREONET2 and etc has been deployed to support bandwidth of Giga bps. And,...
EMMCVPR
2007
Springer
13 years 9 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...
ICPPW
2002
IEEE
13 years 10 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
DSN
2011
IEEE
12 years 5 months ago
2011
IEEE
—As process technology shrinks devices, circuits experience accelerated wearout. Monitoring wearout will be critical for improving the efficiency of error detection and correctio...
IWANN
1997
Springer
13 years 10 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 ...