38 search results - page 1 / 8 » Technology mapping by binate covering |
FPL
1997
Springer
13 years 8 months ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
DAC
2005
ACM
14 years 5 months ago
2005
ACM
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...
DAC
1998
ACM
13 years 8 months ago
1998
ACM
COCO
2009
Springer
13 years 11 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
ITC
1995
IEEE
13 years 8 months ago
1995
IEEE
During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide a sufficiently high fault coverage. This paper presents a new ...