763 search results - page 126 / 153 » Engineering Shortest Path Algorithms |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Burst loss and delay are two main issues in optical hop-count. Network diameter is the hop-count of the shortest burst switching (OBS) networks. In OBS, if the hop-count path be...
SIGCOMM
2012
ACM
11 years 10 months ago
2012
ACM
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
ISSTA
2010
ACM
13 years 9 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
EUROMICRO
2004
IEEE
13 years 11 months ago
2004
IEEE
A primary goal in the design of wireless sensor networks is lifetime maximization, constrained by the energy capacity of batteries. One well known method to reduce energy consumpt...