71 search results - page 5 / 15 » Fast Spectrum Computation for Logic Functions using Binary D... |
174
click to vote
EOR
2011
15 years 10 days ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
142
click to vote
DAC
2003
ACM
16 years 6 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
192
click to vote
DAC
2004
ACM
16 years 6 months ago
2004
ACM
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
119
click to vote
MST
2006
15 years 5 months ago
2006
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
166
click to vote
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...