16091 search results - page 23 / 3219 » Solving |
119
Voted
SAT
2010
Springer
15 years 7 days ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
169
click to vote
CPAIOR
2010
Springer
14 years 12 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
156
click to vote
VLSID
2010
IEEE
14 years 11 months ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
136
click to vote
CONSTRAINTS
2011
14 years 9 months ago
2011
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
126
Voted
MMAS
2010
Springer
14 years 8 months ago
2010
Springer
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...