Sciweavers

231 search results - page 22 / 47
» Improvements to combinational equivalence checking
Sort
View
ISSTA
2004
ACM
14 years 1 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
DATE
2006
IEEE
96views Hardware» more  DATE 2006»
14 years 2 months ago
On the relation between simulation-based and SAT-based diagnosis
The problem of diagnosis – or locating the source of an error or fault – occurs in several areas of Computer Aided Design, such as dynamic verification, property checking, eq...
Görschwin Fey, Sean Safarpour, Andreas G. Ven...
ECML
2007
Springer
13 years 12 months ago
On Pairwise Naive Bayes Classifiers
Class binarizations are effective methods for improving weak learners by decomposing multi-class problems into several two-class problems. This paper analyzes how these methods can...
Jan-Nikolas Sulzmann, Johannes Fürnkranz, Eyk...
PPOPP
2010
ACM
14 years 5 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
ICRA
2010
IEEE
194views Robotics» more  ICRA 2010»
13 years 6 months ago
Continuous collision detection for non-rigid contact computations using local advancement
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
Min Tang, Young J. Kim, Dinesh Manocha