6105 search results - page 94 / 1221 » A Parallel Algorithm for Bound-Smoothing |
123
click to vote
CSB
2003
IEEE
15 years 6 months ago
2003
IEEE
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
101
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
SPAA
1990
ACM
15 years 5 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
143
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
CIARP
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we present a new parallel clustering algorithm based on the extended star clustering method. This algorithm can be used for example to cluster massive data sets of do...