2095 search results - page 90 / 419 » Improved pebbling bounds |
111
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper introduces a new algorithm for reconstructing signals with sparse spectrums from noisy compressive measurements. The proposed model-based algorithm takes the signal str...
110
click to vote
DAC
2009
ACM
16 years 1 months ago
2009
ACM
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
DAC
2003
ACM
16 years 1 months ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
116
Voted
DAC
2004
ACM
16 years 1 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
128
click to vote
TABLEAUX
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...