Sciweavers

1509 search results - page 212 / 302
» Computational Evolutionary Embryogeny
Sort
View
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
15 years 10 months ago
Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax
Abstract. Although evolutionary algorithms (EAs) are often successfully used for the optimization of dynamically changing objective function, there are only very few theoretical re...
Stefan Droste
GECCO
2003
Springer
101views Optimization» more  GECCO 2003»
15 years 10 months ago
Population Implosion in Genetic Programming
With the exception of a small body of adaptive-parameter literature, evolutionary computation has traditionally favored keeping the population size constant through the course of t...
Sean Luke, Gabriel Catalin Balan, Liviu Panait
155
Voted
AUSAI
1999
Springer
15 years 10 months ago
Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
Edmund K. Burke, Graham Kendall
CEC
2009
IEEE
15 years 9 months ago
A dynamic artificial immune algorithm applied to challenging benchmarking problems
Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of the...
Fabrício Olivetti de França, Fernand...
169
Voted
NICSO
2010
Springer
15 years 9 months ago
Accelerated Genetic Algorithms with Markov Chains
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
Guan Wang, Chen Chen, Kwok Yip Szeto