49 search results - page 1 / 10 » Two Remarkable Computational Competencies of the Simple Gene... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
FOGA
2011
12 years 8 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
IAT
2008
IEEE
13 years 11 months ago
2008
IEEE
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Although semiautomatic to...
PPSN
2004
Springer
13 years 10 months ago
2004
Springer
Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa i...