1071 search results - page 83 / 215 » An Experimental Study of Benchmarking Functions for Genetic ... |
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
PPSN
1998
Springer
14 years 1 months ago
1998
Springer
We present a novel approach to concept learning in which a coevolutionary genetic algorithm is applied to the construction of an immune system whose antibodies can discriminate bet...
ICARIS
2010
Springer
13 years 6 months ago
2010
Springer
In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
DAC
1999
ACM
14 years 10 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...