Filters








5,493 Hits in 2.4 sec

Self-modifying cartesian genetic programming

Simon L. Harding, Julian F. Miller, Wolfgang Banzhaf
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
In this paper we introduce computational development using a form of Cartesian Genetic Programming that includes self-modification operations.  ...  We present results on a number of problems and demonstrate the characteristics and advantages that self-modification brings.  ...  SELF-MODIFYING CARTESIAN GENETIC PROGRAMMING (SMCGP) Cartesian Genetic Programming (CGP) Cartesian Genetic Programming was originally developed by Miller and Thomson [14] for the purpose of evolving  ... 
doi:10.1145/1276958.1277161 dblp:conf/gecco/HardingMB07 fatcat:6voqfueanna4jelxi3kzyaqfdq

Self modifying cartesian genetic programming

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2010 Proceedings of the 12th annual conference on Genetic and evolutionary computation - GECCO '10  
In this paper we introduce computational development using a form of Cartesian Genetic Programming that includes self-modification operations.  ...  We present results on a number of problems and demonstrate the characteristics and advantages that self-modification brings.  ...  SELF-MODIFYING CARTESIAN GENETIC PROGRAMMING (SMCGP) Cartesian Genetic Programming (CGP) Cartesian Genetic Programming was originally developed by Miller and Thomson [14] for the purpose of evolving  ... 
doi:10.1145/1830483.1830591 dblp:conf/gecco/HardingMB10 fatcat:36at7ffvlzgircswoukttfz2x4

Self-Modifying Cartesian Genetic Programming [chapter]

Simon L. Harding, Julian F. Miller, Wolfgang Banzhaf
2011 Natural Computing Series  
In this paper we introduce computational development using a form of Cartesian Genetic Programming that includes self-modification operations.  ...  We present results on a number of problems and demonstrate the characteristics and advantages that self-modification brings.  ...  SELF-MODIFYING CARTESIAN GENETIC PROGRAMMING (SMCGP) Cartesian Genetic Programming (CGP) Cartesian Genetic Programming was originally developed by Miller and Thomson [14] for the purpose of evolving  ... 
doi:10.1007/978-3-642-17310-3_4 fatcat:ygf6pxpdkvgihelp2tdlls3ica

Self modifying Cartesian Genetic Programming: Parity

S. Harding, J. F. Miller, W. Banzhaf
2009 2009 IEEE Congress on Evolutionary Computation  
Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It differs from CGP by including primitive functions which modify the program.  ...  Beginning with the evolved genotype the self-modifying functions produce a new program (phenotype) at each iteration.  ...  Self modifying Cartesian Genetic Programming has a number of virtues.  ... 
doi:10.1109/cec.2009.4982960 dblp:conf/cec/HardingMB09 fatcat:kb2npl2sdbeklf5q5435luenre

Developments in Cartesian Genetic Programming: self-modifying CGP

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2010 Genetic Programming and Evolvable Machines  
Self-modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming.  ...  In addition to the usual computational functions, it includes functions that can modify the program encoded in the genotype.  ...  The technique we discuss is based on Cartesian Genetic Programming (CGP), so we refer to it as self-modifying CGP (SMCGP). The representation used in SMCGP is very flexible.  ... 
doi:10.1007/s10710-010-9114-1 fatcat:kpfuiphf55dzrg5z3udl77zqla

A Survey of Self Modifying Cartesian Genetic Programming [chapter]

Simon Harding, Wolfgang Banzhaf, Julian F. Miller
2010 Genetic Programming Theory and Practice VIII  
Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Cartesian Genetic Programming.  ...  In addition to the usual computational functions found in CGP, SMCGP includes functions that can modify the evolved program at run time.  ...  Self Modifying Cartesian Genetic Programming As the name suggests, SMCGP is based on the Cartesian Genetic Programming technique.  ... 
doi:10.1007/978-1-4419-7747-2_6 fatcat:j557uvj5jvfu3d652hljqonqce

Self Modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing [chapter]

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2009 Lecture Notes in Computer Science  
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.  ...  Self Modifying CGP Cartesian Genetic Programming (CGP) Cartesian Genetic Programming represents programs as directed graphs [8] .  ...  In our previous work, we showed that by utilizing self-modification operations within an existing computational method (a form of genetic programming, called Cartesian Genetic Programming, CGP) we could  ... 
doi:10.1007/978-3-642-01181-8_12 fatcat:rciv6xnqzzbpvbfwjhbpu5done

Evolution, development and learning using self-modifying cartesian genetic programming

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2009 Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09  
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping.  ...  SELF MODIFYING CGP Cartesian Genetic Programming (CGP) Cartesian Genetic Programming is a graph-based representation of programs [7] .  ...  Previously we proposed a developmental mapping in the context of Cartesian Genetic Programming (CGP) by introducing self-modification (SM) [3] .  ... 
doi:10.1145/1569901.1569998 dblp:conf/gecco/HardingMB09 fatcat:5mnfiq3gwfcmzjvrbtrkehmeoy

Emergence in genetic programming

Anikó Ekárt
2013 Genetic Programming and Evolvable Machines  
Banzhaf explores the concept of emergence and how and where it happens in genetic programming [1] . Here we consider the question: what shall we do with it?  ...  We argue that given our ultimate goal to produce genetic programming systems that solve new and difficult problems, we should take advantage of emergence to get closer to this goal.  ...  Self-modifying Cartesian genetic programming In addition to the usual functions, in self-modifying Cartesian genetic programming the genotype includes primitive functions that act on the genotype itself  ... 
doi:10.1007/s10710-013-9199-4 fatcat:vqurbmc3uzc6vj6tdd4jsvotue

SMCGP2

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2011 Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO '11  
Self Modifying Cartesian Genetic Programming 2 (SM-CGP2) is a general purpose, graph-based, developmental form of Cartesian Genetic Programming.  ...  Using a combination of computational functions and special functions that can modify the phenotype at runtime, it has been employed to find general solutions to a number of computational problems.  ...  INTRODUCTION Self-Modifying Cartesian Genetic Programming (SMCGP) [1] is a form of Genetic Programming (GP) that includes time (i.e. iteration) in the genotype-phenotype map.  ... 
doi:10.1145/2001858.2001968 dblp:conf/gecco/HardingMB11a fatcat:y5s4sznohzcuhh7scas2cb27ey

Editorial to tenth anniversary issue on progress in genetic programming and evolvable machines

Julian F. Miller, Riccardo Poli
2010 Genetic Programming and Evolvable Machines  
It is called ''Self-modifying Cartesian Genetic Programming'' (SMCGP).  ...  In that year a paper entitled ''Cartesian Genetic Programming'' was presented by Julian Miller at European Conference on Genetic Programming in Edinburgh.  ... 
doi:10.1007/s10710-010-9115-0 fatcat:bgfdqrboljfbdghj4e4mkwkpee

Morphogenesis and Replication of Multi-Cellular Organisms with Evolved Variable Length Self-Modifying Genomes

Stefano Nichele, Gunnar Tufte
2015 07/20/2015-07/24/2015  
In a way, biological genomes are the result of a self-assembly process where parent's genes sometimes are not only copied to offspring but are also duplicated.  ...  There is scientific evidence that all species have evolved and diverged from a common ancestor, i.e. last universal ancestor (LUA), and the mechanisms of gene duplication played an important role for genetic  ...  tions that can modify the genotype itself, e.g. as in selfmodifying cartesian genetic programming (SMCGP).  ... 
doi:10.7551/978-0-262-33027-5-ch010 dblp:conf/ecal/NicheleT15 fatcat:j3i5gbwt3fdfzmlpjipubmamgu

Building Image Feature Kinetics for Cement Hydration Using Gene Expression Programming With Similarity Weight Tournament Selection

Lin Wang, Bo Yang, Shoude Wang, Zhifeng Liang
2015 IEEE Transactions on Evolutionary Computation  
F., Banzhaf, W.: Self-Modifying Cartesian Genetic Programming.  ...  using Cartesian Genetic Programming.  ... 
doi:10.1109/tevc.2014.2367111 fatcat:dsfdt3ngn5htfdg4ydmofrqznm

SMCGP2

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2011 Proceedings of the 13th annual conference on Genetic and evolutionary computation - GECCO '11  
Self Modifying Cartesian Genetic Programming is a general purpose, graph-based, developmental form of Cartesian Genetic Programming.  ...  Using a combination of computational functions and special functions that can modify the phenotype at runtime, it has been employed to find general solutions to certain Boolean circuits and mathematical  ...  INTRODUCTION Self Modifying Cartesian Genetic Programming (SM-CGP) is a generalization and modification of the graphbased form of Genetic Programming (GP) known as Cartesian Genetic Programming (CGP)  ... 
doi:10.1145/2001576.2001777 dblp:conf/gecco/HardingMB11 fatcat:f5lz564pozhizdmo3vr7dsw66m

A Comparison of Genetic Programming Variants for Hyper-Heuristics

Sean Harris, Travis Bueter, Daniel R. Tauritz
2015 Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference - GECCO Companion '15  
Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics.  ...  This research was funded in part by Sandia National Laboratories and in part by Missouri S&T's OURE program.  ...  programming variants on the boolean satisfiability (SAT) problem: Tree, Linear, Cartesian, Grammatical, and Stack genetic programming.  ... 
doi:10.1145/2739482.2768456 dblp:conf/gecco/HarrisBT15 fatcat:rakrl6poivcpxfu6yx5acw24ui
« Previous Showing results 1 — 15 out of 5,493 results