119 search results - page 2 / 24 » An analysis of massively distributed evolutionary algorithms |
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
One of the most commonly used tools by computational biologists is some form of sequence alignment. Heuristic alignment algorithms developed for speed and their multiple results s...
PPSN
2010
Springer
13 years 2 months ago
2010
Springer
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
KES
1999
Springer
13 years 9 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
PPOPP
2012
ACM
12 years 12 days ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
CEC
2005
IEEE
13 years 6 months ago
2005
IEEE
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...