Sciweavers

1795 search results - page 10 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ECCC
2006
107views more  ECCC 2006»
13 years 7 months ago
Energy Complexity and Entropy of Threshold Circuits
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
Wolfgang Maass, Kei Uchizawa, Rodney J. Douglas
ISMVL
2003
IEEE
112views Hardware» more  ISMVL 2003»
14 years 22 days ago
Iterative Symmetry Indices Decomposition for Ternary Logic Synthesis in Three-Dimensional Space
This paper introduces the implementation of the Iterative Symmetry Indices Decomposition (ISID) for the synthesis of ternary threedimensional logic circuits. The synthesis of regu...
Anas Al-Rabadi
COMPLEXITY
2006
91views more  COMPLEXITY 2006»
13 years 7 months ago
The evolution of technology within a simple computer model
Technology--the collection of devices and methods available to human society--evolves by constructing new devices and methods from ones that previously exist, and in turn offering...
W. Brian Arthur, Wolfgang Polak
COCOON
2009
Springer
14 years 2 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
DATE
2000
IEEE
136views Hardware» more  DATE 2000»
13 years 12 months ago
On Applying Incremental Satisfiability to Delay Fault Testing
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah...