3360 search results - page 133 / 672 » An Optimal Distributed Edge-Biconnectivity Algorithm |
185
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
222
click to vote
ICNP
2002
IEEE
15 years 11 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
181
click to vote
TCS
2008
15 years 6 months ago
2008
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
172
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
177
click to vote
WDAG
1993
Springer
15 years 10 months ago
1993
Springer
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...