Evolving Constructors for Infinitely Growing Sorting Networks and Medians

An approach is presented in which the object under design can grow continually and infinitely. First, a small object (that we call the embryo) has to be prepared to solve the trivial instance of a problem. Then the evolved program (the constructor) is applied on the embryo to create a larger object (solving a larger instance of the problem). Then the same constructor is used to create a new instance of the object from the created larger object and so on. Every new instance of the object is able to perform the function of all previous instances. As an example, constructors for growing sorting and median networks are evolved and analyzed.

[1]  Julian Francis Miller,et al.  Principles in the Evolutionary Design of Digital Circuits—Part II , 2000, Genetic Programming and Evolvable Machines.

[2]  John R. Koza,et al.  Genetic Programming III: Darwinian Invention & Problem Solving , 1999 .

[3]  Peter J. Bentley,et al.  Towards development in evolvable hardware , 2002, Proceedings 2002 NASA/DoD Conference on Evolvable Hardware.

[4]  W. Daniel Hillis,et al.  Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .

[5]  Axel W. Krings,et al.  The test vector problem and limitations to evolving digital circuits , 2000, Proceedings. The Second NASA/DoD Workshop on Evolvable Hardware.

[6]  Marco Tomassini,et al.  Towards Evolvable Hardware , 1996, Lecture Notes in Computer Science.

[7]  Peter J. Bentley,et al.  Evolutionary Design By Computers , 1999 .

[8]  John R. Koza,et al.  Routine Duplication of Post-2000 Patented Inventions by Means of Genetic Programming , 2002, EuroGP.

[9]  Tughrul Arslan,et al.  Evolvable Components—From Theory to Hardware Implementations , 2005, Genetic Programming and Evolvable Machines.

[10]  Gregory S. Hornby,et al.  The advantages of generative grammatical encodings for physical design , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[11]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[12]  Gunnar Tufte,et al.  Shrinking the Genotype: L-systems for EHW? , 2001, ICES.

[13]  Byung Ro Moon,et al.  More Effective Genetic Search For The Sorting Network Problem , 2002, GECCO.

[14]  Hugo de Garis,et al.  ATR's artificial brain ("CAM-Brain") project: A sample of what individual "CoDi-1 Bit" model evolved neural net modules can do with digital and analog I/O , 1999, Proceedings of the First NASA/DoD Workshop on Evolvable Hardware.

[15]  Gianluca Tempesti,et al.  Ontogenetic Development and Fault Tolerance in the POEtic Tissue , 2003, ICES.

[16]  Julian Francis Miller,et al.  A Developmental Method for Growing Graphs and Circuits , 2003, ICES.

[17]  Su Wen,et al.  A fast median filter using AltiVec , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[18]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[19]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[20]  Hugues Juillé.  Evolution of Non-Deterministic Incremental Algorithms as a New Approach for Search in State Spaces , 1995, ICGA.

[21]  Hiroaki Kitano.  Morphogenesis for Evolvable Systems , 1995, Towards Evolvable Hardware.