425 search results - page 10 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
106
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
153
click to vote
EMMCVPR
2007
Springer
15 years 6 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...
105
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
138
click to vote
HICSS
1999
IEEE
15 years 6 months ago
1999
IEEE
Time-critical logistics (TCL) refer to time-sensitive procurement, processing and distribution activities. A confounding factor is the transportation networks that contain these l...
127
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...