Principles in the Evolutionary Design of Digital Circuits—Part I

By Julian Francis Miller, Dominic Edward Job, Vesselin K. Vassilev. Genetic Programming and Evolvable Machines, 2004

392 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/f191288f4bbd5a5cc129cfb6e7c4db2136963f2e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Competitive Coevolution through Evolutionary Complexification (2011, background): “CA, electrical circuits ( Miller et al., 2000a; Miller, Job, & Vassilev, 2000b), genetic programs (Koza, 1992), robot body morphologies (Lipson & Pollack, 2000), Bayesian networks (Mengshoel, 1999), finite automata (Brave, 1996), and building and vehicle architectures (O’Reilly, 2000) are all struc”
Redundancy and computational efficiency in Cartesian genetic programming (2006, background): “CGP has been applied to a growing number of domains and problems: digital circuit design [33], [34], digital filter design [31], image processing [48], [70], artificial life [45], bio-inspired developmental models [36]–[38], evolutionary art [3], and molecular docking [12], [13].”
Evolution of Cartesian Genetic Programs for Development of Learning Neural Architecture (2011, methodology): “The characteristics of this type of genotypic redundancy have been investigated in detail and found to be extremely beneficial to the evolutionary process of the problems studied (Miller et al., 2000; Vassilev and Miller, 2000; Yu and Miller, 2001).”
Cartesian Genetic Programming (2015, background): “The possibility of improving efﬁciency by stripping out non-coding instructions prior to phenotype evaluation has also been suggested for Linear GP [1].”
Coevolution of Neuro-developmental Programs That Play Checkers (2008, methodology): “The CGP function nodes we have used are variants of 2 to 1 multiplexers [3] in which data inputs are either inverted or not.”
In search of intelligence: evolving a developmental neuron capable of learning (2014, methodology): “The CGP function nodes used here are variants of binary if-statements known as 2 to 1 multiplexers (Miller et al., 2000) with three inputs each, as shown in Figure 2.”
Advances in Computational Intelligence (2003, neutral): “Everything simu- Multipliers SW SW SW Static [125] lated in software”