Sciweavers

1795 search results - page 44 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ICALP
2003
Springer
14 years 1 months ago
Oracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
Ph. Schnoebelen
NIPS
2003
13 years 10 months ago
Information Dynamics and Emergent Computation in Recurrent Circuits of Spiking Neurons
We employ an efficient method using Bayesian and linear classifiers for analyzing the dynamics of information in high-dimensional states of generic cortical microcircuit models....
Thomas Natschläger, Wolfgang Maass
DAC
2007
ACM
14 years 18 days ago
Skewed Flip-Flop Transformation for Minimizing Leakage in Sequential Circuits
Mixed Vt has been widely used to control leakage without affecting circuit performance. However, current approaches target the combinational circuits even though sequential elemen...
Jun Seomun, Jaehyun Kim, Youngsoo Shin
ETS
2010
IEEE
150views Hardware» more  ETS 2010»
13 years 9 months ago
Improving CNF representations in SAT-based ATPG for industrial circuits using BDDs
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
Daniel Tille, Stephan Eggersglüß, Rene ...
IPL
2006
86views more  IPL 2006»
13 years 8 months ago
Monotone circuits for monotone weighted threshold functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
Amos Beimel, Enav Weinreb