论文信息 - Evolving Binary Decision Diagrams using Implicit Neutrality

Evolving Binary Decision Diagrams using Implicit Neutrality

A newalgorithm ispresented forevolving Bi- naryDecision Diagrams (BDD)thatemploys theneu- trality implicit intheBDDrepresentation. Itisshown that aneffortless neutral walkistaken; that is, aneutral walkthat requires nofitness evaluations. Experiments showthealgorithm toberobust andscalable across a rangeofn-parity problems upton = 17,andhighly ef- ficient onarangeofother functions withcompact BDD representations. Evolvability andmodularity issues are also discussed, andthesearch space isshowntobefree oflocal optima.

Richard MarkDowning

[1] Sheldon B. Akers,et al. Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[2] Peter Nordin,et al. Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[3] Wolfgang Banzhaf,et al. Genetic Programming: An Introduction , 1997 .

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

[5] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.