Solving the even-n-parity problems using Best SubTree Genetic Programming

Best subtree genetic programming (BSTGP) is a special genetic programming (GP) variant whose aim is to offer more possibilities, for selecting the solution, compared to standard GP. In the case of BSTGP the best subtree is chosen for proving the solution. This is different from standard GP where the solution was given by the entire tree. In this paper we apply BSTGP for designing digital circuits for the even-n-parity problem. Numerical results show that BSTGP can improve GP search in terms of success rate and computational effort.

[1]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[2]  Riccardo Poli,et al.  A Schema Theory Analysis of the Evolution of Size in Genetic Programming with Linear Representations , 2001, EuroGP.

[3]  John R. Koza,et al.  Genetic programming 2 - automatic discovery of reusable programs , 1994, Complex Adaptive Systems.

[4]  Vu Duong,et al.  Silicon validation of evolution-designed circuits , 2003, NASA/DoD Conference on Evolvable Hardware, 2003. Proceedings..

[5]  J. Miller.  An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach , 1999 .

[6]  James R. Levenick.  Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology , 1991, ICGA.

[7]  Riccardo Poli,et al.  Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes , 2000, Genetic Programming and Evolvable Machines.

[8]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[9]  Wolfgang Banzhaf,et al.  A comparison of linear genetic programming and neural networks in medical data mining , 2001, IEEE Trans. Evol. Comput..

[10]  Riccardo Poli,et al.  Smooth Uniform Crossover with Smooth Point Mutation in Genetic Programming: A Preliminary Study , 1999, EuroGP.

[11]  Mihai Oltean,et al.  Best SubTree genetic programming , 2007, GECCO '07.

[12]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[13]  Enrique Alba,et al.  Comparing different serial and parallel heuristics to design combinational logic circuits , 2003, NASA/DoD Conference on Evolvable Hardware, 2003. Proceedings..

[14]  Julian Francis Miller,et al.  Cartesian genetic programming , 2000, GECCO '10.

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

[16]  Riccardo Poli,et al.  Sub-machine-code genetic programming , 1999 .

[17]  Astro Teller,et al.  A study in program response and the negative effects of introns in genetic programming , 1996 .

[18]  William B. Langdon,et al.  Quadratic Bloat in Genetic Programming , 2000, GECCO.

[19]  Lothar Thiele,et al.  Genetic Programming and Redundancy , 1994 .

[20]  Peter Ross,et al.  Tackling the Boolean Even N Parity Problem with Genetic Programming and Limited-Error Fitness , 1997 .

[21]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[22]  Jörn Hopf,et al.  Genetic algorithms within the framework of evolutionary computation: Proceedings of the KI-94 Workshop , 1994 .

[23]  P. Nordin,et al.  Explicitly defined introns and destructive crossover in genetic programming , 1996 .