5005 search results - page 225 / 1001 » The Design and Analysis of Parallel Algorithms |
146
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
120
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
118
click to vote
IEEEPACT
1998
IEEE
15 years 8 months ago
1998
IEEE
Determination of data dependences is a task typically performed with high-level language source code in today's optimizing and parallelizing compilers. Very little work has b...
135
click to vote
IPPS
1996
IEEE
15 years 8 months ago
1996
IEEE
This paper presents an optical interconnect model for kary n-cube network topologies based on free-space analysis. This model integrates relevant parameters inherent to optics wit...
174
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...