Sciweavers

602 search results - page 79 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
CEC
2010
IEEE
14 years 3 days ago
An examination on the modularity of grammars in grammatical evolutionary design
Abstract-- This work furthers the understanding of modularity in grammar-based genetic programming approaches by analyzing how different grammars may be capable of producing the sa...
John Mark Swafford, Michael O'Neill
KES
1999
Springer
14 years 3 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
14 years 4 months ago
Combining competent crossover and mutation operators: a probabilistic model building approach
This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
Cláudio F. Lima, Kumara Sastry, David E. Go...
CONTEXT
2001
Springer
14 years 3 months ago
Learning Appropriate Contexts
Genetic Programming is extended so that the solutions being evolved do so in the context of local domains within the total problem domain. This produces a situation where different...
Bruce Edmonds
EVOW
2010
Springer
14 years 5 months ago
Comparing Aesthetic Measures for Evolutionary Art
Abstract. In this paper we investigate and compare four aesthetic measures within the context of evolutionary art. We evolve visual art with an unsupervised evolutionary art system...
E. den Heijer, A. E. Eiben