Sciweavers

1795 search results - page 188 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
STOC
2007
ACM
85views Algorithms» more  STOC 2007»
14 years 10 months ago
Faster integer multiplication
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
Martin Fürer
ICCD
2002
IEEE
93views Hardware» more  ICCD 2002»
14 years 7 months ago
Impact of Scaling on the Effectiveness of Dynamic Power Reduction Schemes
Power is considered to be the major limiter to the design of more faster and complex processors in the near future. In order to address this challenge, a combination of process, c...
David Duarte, Narayanan Vijaykrishnan, Mary Jane I...
ICCAD
2006
IEEE
105views Hardware» more  ICCAD 2006»
14 years 7 months ago
An optimal simultaneous diode/jumper insertion algorithm for antenna fixing
As technology enters the nanometer territory, the antenna effect plays an important role in determining the yield and reliability of a VLSI circuit. Diode insertion and jumper in...
Zhe-Wei Jiang, Yao-Wen Chang
ICCAD
2001
IEEE
108views Hardware» more  ICCAD 2001»
14 years 7 months ago
Multigrid-Like Technique for Power Grid Analysis
— Modern sub-micron VLSI designs include huge power grids that are required to distribute large amounts of current, at increasingly lower voltages. The resulting voltage drop on ...
Joseph N. Kozhaya, Sani R. Nassif, Farid N. Najm
DATE
2009
IEEE
119views Hardware» more  DATE 2009»
14 years 4 months ago
Statistical fault injection: Quantified error and confidence
— Fault injection has become a very classical method to determine the dependability of an integrated system with respect to soft errors. Due to the huge number of possible error ...
Régis Leveugle, A. Calvez, Paolo Maistri, P...