Sciweavers

159 search results - page 26 / 32
» On the Complexity of SAT
Sort
View
INTERSPEECH
2010
13 years 5 months ago
A comparative large scale study of MLP features for Mandarin ASR
MLP based front-ends have shown significant complementary properties to conventional spectral features. As part of the DARPA GALE program, different MLP features were developed fo...
Fabio Valente, Mathew Magimai-Doss, Christian Plah...
ENTCS
2006
113views more  ENTCS 2006»
13 years 11 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
DAC
2009
ACM
14 years 12 months ago
Computing bounds for fault tolerance using formal techniques
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...
André Sülflow, Görschwin Fey, Rol...
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 5 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
DATE
2008
IEEE
113views Hardware» more  DATE 2008»
14 years 5 months ago
Random Stimulus Generation using Entropy and XOR Constraints
Despite the growing research effort in formal verification, constraint-based random simulation remains an integral part of design validation, especially for large design componen...
Stephen Plaza, Igor L. Markov, Valeria Bertacco