706 search results - page 53 / 142 » On a quasi-ordering on Boolean functions |
149
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
155
click to vote
FPGA
2007
ACM
16 years 13 days ago
2007
ACM
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
217
click to vote
COGSR
2011
15 years 1 months ago
2011
Cognitive architectures need to resolve the diversity dilemma – i.e., to blend diversity and simplicity – in order to couple functionality and efficiency with integrability, e...
149
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
An abundance of research e orts in low power logic synthesis have so far been focused on and or or nand nor based logic. A typical approach is to rst generate an initial multi-lev...
155
click to vote
IJCAI
1997
15 years 7 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...