8118 search results - page 1532 / 1624 » The Newton Application Architecture |
108
click to vote
DAC
2001
ACM
16 years 2 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
DAC
2002
ACM
16 years 2 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
124
click to vote
DAC
2003
ACM
16 years 2 months ago
2003
ACM
As minimum feature sizes continue to shrink, patterned features have become significantly smaller than the wavelength of light used in optical lithography. As a result, the requir...
106
click to vote
DAC
2003
ACM
16 years 2 months ago
2003
ACM
We present in this paper a multilevel floorplanning/placement framework based on the B*-tree representation, called MB*-tree, to handle the floorplanning and packing for large-sca...
128
click to vote
DAC
2003
ACM
16 years 2 months ago
2003
ACM
Power dissipation is becoming the most challenging design constraint in nanometer technologies. Among various design implementation schemes, standard cell ASICs offer the best pow...