AI Chat AI Image Generator AI Video Text to Speech

Multitask Evolution with Cartesian Genetic Programming

02/07/2017
∙
by   Eric O. Scott, et al.
∙
0
∙

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.

READ FULL TEXT

page 1

page 2

Related Research

research
∙ 03/16/2018

Towards Advanced Phenotypic Mutations in Cartesian Genetic Programming

Cartesian Genetic Programming is often used with a point mutation as the...
0 Roman Kalkreuth, et al. ∙
research
∙ 09/05/2010

Results of Evolution Supervised by Genetic Algorithms

A series of results of evolution supervised by genetic algorithms with i...
0 Lorentz Jäntschi, et al. ∙
research
∙ 09/22/2020

Multi-threaded Memory Efficient Crossover in C++ for Generational Genetic Programming

C++ code snippets from a multi-core parallel memory-efficient crossover ...
0 W. B. Langdon, et al. ∙
research
∙ 10/13/2021

Improving the Search by Encoding Multiple Solutions in a Chromosome

We investigate the possibility of encoding multiple solutions of a probl...
0 Mihai Oltean, et al. ∙
research
∙ 09/16/2022

Evolving Complexity is Hard

Understanding the evolution of complexity is an important topic in a wid...
0 Alden H. Wright, et al. ∙
research
∙ 07/26/2013

Finite State Machine Synthesis for Evolutionary Hardware

This article considers application of genetic algorithms for finite mach...
0 Andrey Bereza, et al. ∙
research
∙ 07/19/2016

Genetic Transfer or Population Diversification? Deciphering the Secret Ingredients of Evolutionary Multitask Optimization

Evolutionary multitasking has recently emerged as a novel paradigm that ...
0 Abhishek Gupta, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal