422 search results - page 77 / 85 » Multithreaded SAT Solving |
TABLEAUX
2007
Springer
14 years 3 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...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
Genetic algorithms have been successfully applied to many difficult problems but there have been some disappointing results as well. In these cases the choice of the internal repre...
MICRO
2002
IEEE
14 years 2 months ago
2002
IEEE
Recently, graphics hardware architectures have begun to emphasize versatility, offering rich new ways to programmatically reconfigure the graphics pipeline. In this paper, we exp...
CP
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
AISC
2008
Springer
13 years 11 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...