295 search results - page 42 / 59 » SAT, SMT and Applications |
118
click to vote
ISSTA
2010
ACM
15 years 5 months ago
2010
ACM
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
100
click to vote
DAC
2007
ACM
16 years 2 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
116
click to vote
INTERSPEECH
2010
14 years 8 months ago
2010
In the paper we present two techniques improving the recognition accuracy of multilayer perceptron neural networks (MLP ANN) by means of adopting Speaker Adaptive Training. The us...
106
Voted
AIPS
2006
15 years 3 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
113
click to vote
APPT
2005
Springer
15 years 7 months ago
2005
Springer
Simultaneous MultiThreading (SMT) achieves better system resource utilization and higher performance because it exploits ThreadLevel Parallelism (TLP) in addition to “conventiona...