Sciweavers

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

13

EVOW
2006
Springer

favoriteEmaildiscussreport

125views Artificial Intelligence» more EVOW 2006»

Finding Compact BDDs Using Genetic Programming

13 years 8 months ago

Finding Compact BDDs Using Genetic Programming

Download www.informatik.uni-bremen.de

Binary Decision Diagrams (BDDs) can be used to design multiplexor based circuits. Unfortunately, the most commonly used kind of BDDs

Ulrich Kühne, Nicole Drechsler

Real-time Traffic

Artificial Intelligence | Binary Decision Diagrams | Compact Bdds | EVOW 2006 | Multiplexor Based Circuits |

claim paper

Related Content

» Using ZBDDs in Pointsto Analysis

» Finding Building Blocks through Eigenstructure Adaptation

» Mining association rules from databases with continuous attributes using genetic network p...

» Automatically finding patches using genetic programming

» Finding deadlocks in large concurrent Java programs using genetic algorithms

» CostBounded Binary Decision Diagrams for 01 Programming

» On Threshold BDDs and the Optimal Variable Ordering Problem

» Evolving recursive programs by using adaptive grammar based genetic programming

» Finding needles in haystacks is harder with neutrality

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	EVOW
Authors	Ulrich Kühne, Nicole Drechsler

Comments (0)