72 search results - page 1 / 15 » Random search can outperform mutation |
CEC
2007
IEEE
13 years 6 months ago
2007
IEEE
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
AUSAI
2005
Springer
13 years 10 months ago
2005
Springer
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
BMCBI
2006
2006
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
13 years 5 months ago
Background: Understanding how amino acid substitutions affect protein functions is critical for the study of proteins and their implications in diseases. Although methods have bee...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
In this paper we describe a method for improving genetic-algorithm-based optimization using informed genetic operators. The idea is to make the genetic operators such as mutation ...
TEC
2012
11 years 7 months ago
2012
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...