Sciweavers

844 search results - page 76 / 169
» Generalized crowding for genetic algorithms
Sort
View
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 4 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 1 months ago
Evolving hash functions by means of genetic programming
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
César Estébanez, Julio César ...
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
14 years 11 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski
GECCO
2008
Springer
111views Optimization» more  GECCO 2008»
14 years 11 months ago
Single-objective front optimization: application to rf circuit design
This paper proposes a new algorithm which promotes well distributed non-dominated fronts in the parameters space when a single-objective function is optimized. This algorithm is b...
Eduardo José Solteiro Pires, Luís Me...
IJON
2000
105views more  IJON 2000»
14 years 9 months ago
G-Prop: Global optimization of multilayer perceptrons using GAs
A general problem in model selection is to obtain the right parameters that make a model "t observed data. For a multilayer perceptron (MLP) trained with back-propagation (BP...
Pedro A. Castillo Valdivieso, Juan J. Merelo Guerv...