Sciweavers

178 search results - page 16 / 36
» gecco 2003
Sort
View
GECCO
2003
Springer
14 years 1 months ago
Dynamic Maximum Tree Depth
We present a technique, designated as dynamic maximum tree depth, for avoiding excessive growth of tree-based GP individuals during the evolutionary process. This technique introdu...
Sara Silva, Jonas Almeida
GECCO
2003
Springer
163views Optimization» more  GECCO 2003»
14 years 1 months ago
Swarms in Dynamic Environments
Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achie...
T. M. Blackwell
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
14 years 1 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
14 years 1 months ago
Selection Intensity in Asynchronous Cellular Evolutionary Algorithms
Abstract. This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a gene...
Mario Giacobini, Enrique Alba, Marco Tomassini
GECCO
2003
Springer
14 years 1 months ago
Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...
Tadahiko Murata, Shiori Kaige, Hisao Ishibuchi