Multitask Evolution with Cartesian Genetic Programming
classification
💻 cs.NE
keywords
geneticprogrammingallowsapproachbooleancartesiancircuitdirect
read the original abstract
We introduce a genetic programming method for solving multiple Boolean circuit synthesis tasks simultaneously. This allows us to solve a set of elementary logic functions twice as easily as with a direct, single-task approach.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.