Sciweavers

3 search results - page 1 / 1
» Effective bounding techniques for solving unate and binate c...
Sort
View
DAC
2005
ACM
14 years 5 months ago
Effective bounding techniques for solving unate and binate covering problems
Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically impact both size and perf...
Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
13 years 8 months ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
13 years 9 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...