390 search results - page 8 / 78 » When is an estimation of distribution algorithm better than ... |
CEC
2005
IEEE
14 years 29 days ago
2005
IEEE
Abstract- Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)...
BIBE
2007
IEEE
14 years 1 months ago
2007
IEEE
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
GECCO
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. In many real-world applications of evolutionary computation, it is essential to reduce the number of fitness evaluations. To this end, computationally efficient models c...
EUROPAR
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We describe a parallel Fortran 77 implementation, in ScaLAPACK style, of a block matrix 1-norm estimator of Higham and Tisseur. This estimator differs from that underlyi...
KES
1999
Springer
13 years 11 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...