268 search results - page 36 / 54 » Finding the k Shortest Paths |
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to allow recovery from failure. We consider constructing two kind...
SARA
2009
Springer
14 years 2 months ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
ICPR
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a method to construct a mosaic from multiple color and fluorescein retinal images. A set of images taken from different views at different times is difficult to registe...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...