Sciweavers

10718 search results - page 182 / 2144
» On the Circuit Implementation Problem
Sort
View
EMSOFT
2004
Springer
15 years 7 months ago
A methodology for generating verified combinatorial circuits
High-level programming languages offer significant expressivity but provide little or no guarantees about resource use. Resourcebounded languages -- such as hardware-description l...
Oleg Kiselyov, Kedar N. Swadi, Walid Taha
DAC
2005
ACM
15 years 6 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
ICCAD
2009
IEEE
144views Hardware» more  ICCAD 2009»
15 years 1 months ago
Virtual probe: A statistically optimal framework for minimum-cost silicon characterization of nanoscale integrated circuits
In this paper, we propose a new technique, referred to as virtual probe (VP), to efficiently measure, characterize and monitor both inter-die and spatially-correlated intra-die va...
Xin Li, Rob A. Rutenbar, R. D. (Shawn) Blanton
116
Voted
ASPDAC
2005
ACM
123views Hardware» more  ASPDAC 2005»
15 years 6 months ago
Yield driven gate sizing for coupling-noise reduction under uncertainty
Abstract— This paper presents a post-route gate-sizing algorithm for coupling-noise reduction that constrains the yield loss under process variations. Algorithms for coupling-noi...
Debjit Sinha, Hai Zhou
UAI
1996
15 years 5 months ago
Topological parameters for time-space tradeoff
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
Rina Dechter