59 search results - page 7 / 12 » Design diagnosis using Boolean satisfiability |
DAC
2002
ACM
16 years 2 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
114
click to vote
EUROCRYPT
2003
Springer
15 years 7 months ago
2003
Springer
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
105
Voted
AAAI
2008
15 years 4 months ago
2008
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
98
Voted
DAC
2003
ACM
16 years 2 months ago
2003
ACM
Noise affects circuit operation by increasing gate delays and causing latches to capture incorrect values. This paper proposes a method of characterizing correlation of signal tra...
102
click to vote
ENTCS
2008
15 years 1 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...