Sciweavers

1129 search results - page 1 / 226
» Instruction-Matrix-Based Genetic Programming
Sort
View
TSMC
2008
100views more  TSMC 2008»
13 years 5 months ago
Instruction-Matrix-Based Genetic Programming
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
Gang Li, Jin Feng Wang, Kin-Hong Lee, Kwong-Sak Le...
ICANNGA
2007
Springer
138views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Liquid State Genetic Programming
Abstract. A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing...
Mihai Oltean
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
13 years 10 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
COMPSAC
2000
IEEE
13 years 9 months ago
GAPS: A Genetic Programming System
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
Michael D. Kramer, Du Zhang
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
13 years 9 months ago
Evolution, development and learning using self-modifying cartesian genetic programming
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping. This...
Simon Harding, Julian Francis Miller, Wolfgang Ban...