107 search results - page 19 / 22 » Finding Compact BDDs Using Genetic Programming |
BMCBI
2007
13 years 6 months ago
2007
Background: Molecular biologists need sophisticated analytical tools which often demand extensive computational resources. While finding, installing, and using these tools can be ...
EUROGP
1998
Springer
13 years 11 months ago
1998
Springer
The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Kn...
BMCBI
2006
13 years 6 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
ISCAS
2006
IEEE
14 years 21 days ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
ICCAD
2002
IEEE
14 years 3 months ago
2002
IEEE
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...