Sciweavers

119 search results - page 6 / 24
» An analysis of massively distributed evolutionary algorithms
Sort
View
BIBE
2007
IEEE
124views Bioinformatics» more  BIBE 2007»
14 years 28 days ago
Finding Cancer-Related Gene Combinations Using a Molecular Evolutionary Algorithm
—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...
Chan-Hoon Park, Soo-Jin Kim, Sun Kim, Dong-Yeon Ch...
CEC
2007
IEEE
14 years 1 months ago
A rigorous view on neutrality
Abstract—Motivated by neutrality observed in natural evolution often redundant encodings are used in evolutionary algorithms. Many experimental studies have been carried out on t...
Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus,...
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
13 years 7 months ago
Empirical analysis of a genetic algorithm-based stress test technique
Evolutionary testing denotes the use of evolutionary algorithms, e.g., Genetic Algorithms (GAs), to support various test automation tasks. Since evolutionary algorithms are heuris...
Vahid Garousi
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
14 years 7 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic
CORR
2004
Springer
153views Education» more  CORR 2004»
13 years 6 months ago
Cauchy Annealing Schedule: An Annealing Schedule for Boltzmann Selection Scheme in Evolutionary Algorithms
Abstract-Boltzmann selectionis an important selection mechanism in evolutionary algorithms as it has theoretical properties which help in theoretical analysis. However, Boltzmann s...
Ambedkar Dukkipati, M. Narasimha Murty, Shalabh Bh...