Sciweavers

718 search results - page 64 / 144
» Timing Yield Calculation Using an Impulse-Train Approach
Sort
View
ASPDAC
2006
ACM
129views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Yield-area optimizations of digital circuits using non-dominated sorting genetic algorithm (YOGA)
With shrinking technology, the timing variation of a digital circuit is becoming the most important factor while designing a functionally reliable circuit. Gate sizing has emerged...
Vineet Agarwal, Janet Meiling Wang
HICSS
1995
IEEE
109views Biometrics» more  HICSS 1995»
13 years 11 months ago
HINT: A new way to measure computer performance
The computing community has long faced the problem of scientifically comparing different computers and different algorithms. When architecture, method, precision, or storage capac...
John L. Gustafson, Quinn Snell
ACL
2008
13 years 9 months ago
Robust Extraction of Named Entity Including Unfamiliar Word
This paper proposes a novel method to extract named entities including unfamiliar words which do not occur or occur few times in a training corpus using a large unannotated corpus...
Masatoshi Tsuchiya, Shinya Hida, Seiichi Nakagawa
FTCS
1993
87views more  FTCS 1993»
13 years 9 months ago
Disk Array Storage System Reliability
Fault tolerance requirements for near term disk array storage systems are analyzed. The excellent reliability provided by RAID Level 5 data organization is seen to be insu cient f...
Walter A. Burkhard, Jai Menon
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 5 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi