Sciweavers

1162 search results - page 134 / 233
» Cartesian genetic programming
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 4 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
PRL
2006
95views more  PRL 2006»
13 years 10 months ago
Evolving visual sonar: Depth from monocular images
To recover depth from images, the human visual system uses many monocular depth cues, which vision research has only begun to explore. Because a given image can have many possible...
Martin C. Martin
GECCO
2009
Springer
174views Optimization» more  GECCO 2009»
13 years 7 months ago
Shape grammars and grammatical evolution for evolutionary design
We describe the first steps in the adoption of Shape Grammars with Grammatical Evolution for application in Evolutionary Design. Combining the concepts of Shape Grammars and Genet...
Michael O'Neill, John Mark Swafford, James McDermo...
ICPPW
2002
IEEE
14 years 3 months ago
Near-Optimal Loop Tiling by Means of Cache Miss Equations and Genetic Algorithms
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transf...
Jaume Abella, Antonio González, Josep Llosa...