Sciweavers

220 search results - page 11 / 44
» Using genetic programming to obtain implicit diversity
Sort
View
GPEM
2010
180views more  GPEM 2010»
13 years 6 months ago
Developments in Cartesian Genetic Programming: self-modifying CGP
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
Simon Harding, Julian F. Miller, Wolfgang Banzhaf

Publication
141views
12 years 5 months ago
Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
Claudio Mattiussi, Markus Waibel, Dario Floreano
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
13 years 8 months ago
Optinformatics for schema analysis of binary genetic algorithms
Given the importance of optimization and informatics which are the two broad fields of research, we present an instance of Optinformatics which denotes the specialization of info...
Minh Nghia Le, Yew-Soon Ong, Quang Huy Nguyen 0001
NC
1998
138views Neural Networks» more  NC 1998»
13 years 9 months ago
Parallel Adaptive Genetic Algorithm
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
Leo Budin, Marin Golub, Domagoj Jakobovic
PPSN
2010
Springer
13 years 5 months ago
Using Co-solvability to Model and Exploit Synergetic Effects in Evolution
Abstract. We introduce, analyze, and experimentally examine co-solvability, an ability of a solution to solve a pair of fitness cases (tests). Based on this concept, we devise a co...
Krzysztof Krawiec, Pawel Lichocki