Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CEC
2005
IEEE

favoriteEmaildiscussreport

92views Artificial Intelligence» more CEC 2005»

Evolving binary decision diagrams using implicit neutrality

13 years 10 months ago

Evolving binary decision diagrams using implicit neutrality

Download www.cs.bham.ac.uk

Abstract- A new algorithm is presented for evolving Binary Decision Diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless neutral walk is taken; that is, a neutral walk that requires no ﬁtness evaluations. Experiments show the algorithm to be robust and scalable across a range of n-parity problems up to n = 17, and highly efﬁcient on a range of other functions with compact BDD representations. Evolvability and modularity issues are also discussed, and the search space is shown to be free of local optima.

Richard M. Downing

Real-time Traffic

Artificial Intelligence | Bdd Representations | CEC 2005 | Effortless Neutral Walk | Neutral Walk |

claim paper

Related Content

» Exact Minimization of Binary Decision Diagrams Using Implicit Techniques

» Efficient Rule Base Verification Using Binary Decision Diagrams

» NonEnumerative Path Delay Fault Diagnosis

» What Graphs can be Efficiently Represented by BDDs

» An Implicit Approach to Minimizing RangeEquivalent Circuits

» Experimental Studies of Symbolic ShortestPath Algorithms

» Reachability Set Generation for Petri Nets Can Brute Force Be Smart

» Biconnectivity on Symbolically Represented Graphs A Linear Solution

» Exploiting Regularities for Boolean Function Synthesis

Post Info
More Details (n/a)

Added	24 Jun 2010
Updated	24 Jun 2010
Type	Conference
Year	2005
Where	CEC
Authors	Richard M. Downing

Comments (0)