Sciweavers

602 search results - page 45 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
72
Voted
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
15 years 3 months ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay
83
Voted
EUROGP
1999
Springer
15 years 1 months ago
Genetic Programming as a Darwinian Invention Machine
Genetic programming is known to be capable of creating designs that satisfy prespecified high-level design requirements for analog electrical circuits and other complex structures...
John R. Koza, Forrest H. Bennett III, Oscar Stiffe...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 1 months ago
Learning recursive programs with cooperative coevolution of genetic code mapping and genotype
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
Garnett Carl Wilson, Malcolm I. Heywood
ISDA
2009
IEEE
15 years 4 months ago
MAHATMA: A Genetic Programming-Based Tool for Protein Classification
Proteins can be grouped into families according to some features such as hydrophobicity, composition or structure, aiming to establish common biological functions. This paper pres...
Denise Fukumi Tsunoda, Alex Alves Freitas, Heitor ...
EUROGP
2003
Springer
119views Optimization» more  EUROGP 2003»
15 years 2 months ago
Maximum Homologous Crossover for Linear Genetic Programming
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar struc...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...