1795 search results - page 222 / 359 » On the Complexity of Circuit Satisfiability |
116
click to vote
ISCA
2003
IEEE
15 years 6 months ago
2003
IEEE
To achieve high instruction throughput, instruction schedulers must be capable of producing high-quality schedules that maximize functional unit utilization while at the same time...
ASPDAC
2007
ACM
15 years 5 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
137
click to vote
DAC
2010
ACM
14 years 11 months ago
2010
ACM
Integrating a large number of on-chip voltage regulators holds the promise of solving many power delivery challenges through strong local load regulation and facilitates systemlev...
DAC
2003
ACM
16 years 1 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
145
click to vote
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Droplet-based microfluidic biochips have recently gained much attention and are expected to revolutionize the biological laboratory procedure. As biochips are adopted for the comp...