844 search results - page 32 / 169 » Generalized crowding for genetic algorithms |
ICDAR
2003
IEEE
15 years 3 months ago
2003
IEEE
Classifier subset selection (CSS) from a large ensemble is an effective way to design multiple classifier systems (MCSs). Given a validation dataset and a selection criterion, the...
76
Voted
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a system that uses Genetic Algorithm (GA) to evolve hierarchical pulse sets (i.e., hierarchical duration vs. amplitude matrices) for expressive music performan...
ICGA
1993
14 years 11 months ago
1993
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper describes initial testing of a novel idea to combine a CGP with an EDA. In recent work a new improved crossover technique was successfully applied to a CGP. To implemen...