1217 search results - page 131 / 244 » Uncertainty-aware circuit optimization |
DAC
1989
ACM
15 years 3 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
ASPDAC
2009
ACM
15 years 3 months ago
2009
ACM
The number of vias generated during the global routing stage is a critical factor for the yield of final circuits. However, most global routers only approach the problem by chargin...
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
Many current integrated circuits designs, such as those released for the ISPD2005[14] placement contest, are extremely large and can contain a great deal of white space. These new...
SAT
2010
Springer
15 years 3 months ago
2010
Springer
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
ICCTA
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper, we propose a placement method for islandstyle FPGAs, based on fast yet very good initial placement followed by refinement using ultra-low temperature Simulated Anne...