142,438 research outputs found
Efficient data structures for backtrack search SAT solvers
The implementation of efficient Propositional Satisfiability (SAT) solvers entails the utilization of highly efficient data structures, as illustrated by most of the recent state-of-the-art SAT solvers. However, it is in general hard to compare existing data structures, since different solvers are often characterized by fairly different algorithmic organizations and techniques, and by different search strategies and heuristics. This paper aims the evaluation of data structures for backtrack search SAT solvers, under a common unbiased SAT framework. In addition, advantages and drawbacks of each existing data structure are identified. Finally, new data structures are proposed, that are competitive with the most efficient data structures currently available, and that may be preferable for the next generation SAT solvers
High-order numerical methods for 2D parabolic problems in single and composite domains
In this work, we discuss and compare three methods for the numerical
approximation of constant- and variable-coefficient diffusion equations in both
single and composite domains with possible discontinuity in the solution/flux
at interfaces, considering (i) the Cut Finite Element Method; (ii) the
Difference Potentials Method; and (iii) the summation-by-parts Finite
Difference Method. First we give a brief introduction for each of the three
methods. Next, we propose benchmark problems, and consider numerical tests-with
respect to accuracy and convergence-for linear parabolic problems on a single
domain, and continue with similar tests for linear parabolic problems on a
composite domain (with the interface defined either explicitly or implicitly).
Lastly, a comparative discussion of the methods and numerical results will be
given.Comment: 45 pages, 12 figures, in revision for Journal of Scientific Computin
- …