473 search results - page 23 / 95 » Computing shortest paths with uncertainty |
167
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
165
click to vote
SPAA
2004
ACM
15 years 11 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...
155
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
185
click to vote
ICCAD
2005
IEEE
16 years 2 months ago
2005
IEEE
A priori wirelength estimation is concerned with predicting various wirelength characteristics before placement. In this work we propose a novel, accurate estimator of net lengths...
156
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...