3678 search results - page 193 / 736 » On the Stable Paths Problem |
130
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
119
click to vote
ICCAD
1994
IEEE
15 years 8 months ago
1994
IEEE
- This paper addresses the problem of true delay estimation during high level design. The existing delay estimation techniques either estimate the topological delay of the circuit ...
143
Voted
STOC
1992
ACM
15 years 7 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
150
click to vote
FPGA
1995
ACM
15 years 7 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
133
click to vote
AR
2007
15 years 3 months ago
2007
This paper presents a new method to analyze the stability of a general class of mobile robot path tracking algorithms taking into account explicitly the computation and communicat...