6939 search results - page 547 / 1388 » Algorithm Engineering for Parallel Computation |
148
click to vote
IPPS
1998
IEEE
15 years 9 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....
151
Voted
ICPP
1999
IEEE
15 years 9 months ago
1999
IEEE
The implementation of bounded-delay services over integrated services networks relies admission control mechanisms that in turn use end-to-end delay computation algorithms. For gu...
171
Voted
ISPAN
2005
IEEE
15 years 10 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
159
Voted
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
High performance, freedom from deadlocks, and freedom from livelocks are desirable properties of interconnection networks. Unfortunately, these can be conflicting goals because n...
149
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...