Sciweavers

1795 search results - page 57 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
CSL
2007
Springer
14 years 2 months ago
Propositional Logic for Circuit Classes
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
Klaus Aehlig, Arnold Beckmann
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
14 years 9 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
14 years 2 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...
HOST
2009
IEEE
14 years 3 months ago
Detecting Trojan Circuit Attacks
Abstract—Rapid advances in integrated circuit (IC) development predicted by Moore’s Law lead to increasingly complex, hard to verify IC designs. Design insiders or adversaries ...
Gedare Bloom, Bhagirath Narahari, Rahul Simha
BC
1999
104views more  BC 1999»
13 years 8 months ago
Control of multistability in ring circuits of oscillators
The essential dynamics of some biological central pattern generators (CPGs) can be captured by a model consisting of x neurons connected in a ring. These circuits, like many oscill...
Carmen C. Canavier, Douglas A. Baxter, J. W. Clark...