268 search results - page 39 / 54 » Finding the k Shortest Paths |
ALGORITHMICA
2005
13 years 7 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
ICSE
2009
IEEE-ACM
13 years 5 months ago
2009
IEEE-ACM
Statistical debugging aims to automate the process of isolating bugs by profiling several runs of the program and using statistical analysis to pinpoint the likely causes of failu...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We present the first method to compute depth cues from images taken solely under uncalibrated near point lighting. A stationary scene is illuminated by a point source that is move...
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
NETWORKS
2006
13 years 7 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...