Multitask Evolution with Cartesian Genetic Programming
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Feb 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 0; 2026: 1.
2 papers.