55 search results - page 6 / 11 » Optimal Sampling and Speed-Up for Genetic Algorithms on the ... |
GECCO
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Given an evolutionary algorithm for a problem and an instance of the problem, the results of several trials of the EA on the instance constitute a sample from the distrib...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
GECCO
1999
Springer
13 years 11 months ago
1999
Springer
The Commonality-Based Crossover Framework has been presented as a general model for designing problem specific operators. Following this model, the Common Features/Random Sample ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...