7133 search results - page 238 / 1427 » Communication algorithms with advice |
166
click to vote
ICPP
1987
IEEE
15 years 9 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
163
Voted
WSC
2008
15 years 8 months ago
2008
In this paper, we suggest a framework that allows for the simulation-based performance assessment of algorithms for cooperative transportation planning. Therefore, we consider a c...
161
click to vote
FGCS
2000
15 years 6 months ago
2000
This paper overviews recent work on ant algorithms, that is, algorithms for discrete optimization which took inspiration from the observation of ant colonies foraging behavior, an...
157
click to vote
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
159
Voted
JGAA
2007
15 years 6 months ago
2007
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...