Multitask Evolution with Cartesian Genetic Programming
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Towards Advanced Phenotypic Mutations in Cartesian Genetic Programming
Cartesian Genetic Programming is often used with a point mutation as the sole genetic operator. In this paper, we propose two phenotypic mutation techniques and take a step towards advanced phenotypic mutations in Cartes…
regressionSymbolic RegressionImproving Evaluation of Recombination-based Cartesian Genetic Programming
Cartesian Genetic Programming has traditionally been using mutation as its main and often sole genetic operator to drive evolutionary search. Despite advancements in recent years, recombinationbased approaches have long …
Continuous Cartesian Genetic Programming based representation for Multi-Objective Neural Architecture Search
We propose a novel approach for the challenge of designing less complex yet highly effective convolutional neural networks (CNNs) through the use of cartesian genetic programming (CGP) for neural architecture search (NAS…
Evolutionary AlgorithmsNeural Architecture SearchSemantically-Oriented Mutation Operator in Cartesian Genetic Programming for Evolutionary Circuit Design
Despite many successful applications, Cartesian Genetic Programming (CGP) suffers from limited scalability, especially when used for evolutionary circuit design. Considering the multiplier design problem, for example, th…
CPUContinuous On-line Evolution of Agent Behaviours with Cartesian Genetic Programming
Evolutionary Computation has been successfully used to synthesise controllers for embodied agents and multi-agent systems in general. Notwithstanding this, continuous on-line adaptation by the means of evolutionary algor…
Evolutionary Algorithms