Sciweavers

118 search results - page 13 / 24
» Fitness Clouds and Problem Hardness in Genetic Programming
Sort
View
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
14 years 1 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang
EUROGP
2009
Springer
138views Optimization» more  EUROGP 2009»
14 years 2 months ago
Self Modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing
Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It is able to modify its own phenotype during execution of the evolved program. This is do...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
CORR
2006
Springer
130views Education» more  CORR 2006»
13 years 7 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparing genetic robustness in generational vs. steady state evolutionary algorithms
Previous research has shown that evolutionary systems not only try to develop solutions that satisfy a fitness requirement, but indirectly attempt to develop genetically robust so...
Josh Jones, Terry Soule
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 8 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski