25 search results - page 2 / 5 » Automating the Construction of Patchers That Satisfy Global ... |
109
click to vote
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
102
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
130
click to vote
JAR
2000
15 years 1 months ago
2000
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
CAD
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
DAC
2002
ACM
16 years 2 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...