Sciweavers

107 search results - page 1 / 22
» Finding Compact BDDs Using Genetic Programming
Sort
View
EVOW
2006
Springer
13 years 8 months ago
Finding Compact BDDs Using Genetic Programming
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
LCPC
2007
Springer
13 years 11 months ago
Using ZBDDs in Points-to Analysis
Binary Decision Diagrams (BDDs) have recently become widely accepted as a space-efficient method of representing relations in points-to analyses. When BDDs are used to represent re...
Ondrej Lhoták, Stephen Curial, José ...
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
13 years 10 months ago
Finding Building Blocks through Eigenstructure Adaptation
A fundamental aspect of many evolutionary approaches to synthesis of complex systems is the need to compose atomic elements into useful higher-level building blocks. However, the ...
Danica Wyatt, Hod Lipson
CEC
2007
IEEE
13 years 8 months ago
Mining association rules from databases with continuous attributes using genetic network programming
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
Karla Taboada, Eloy Gonzales, Kaoru Shimada, Shing...
ICSE
2009
IEEE-ACM
14 years 5 months ago
Automatically finding patches using genetic programming
Automatic repair of programs has been a longstanding goal in software engineering, yet debugging remains a largely manual process. We introduce a fully automated method for locati...
Westley Weimer, ThanhVu Nguyen, Claire Le Goues, S...