380 search results - page 7 / 76 » Mapping Problems with Finite-Domain Variables into Problems ... |
26
Voted
JNSM
2008
13 years 7 months ago
2008
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
JSCIC
2010
13 years 2 months ago
2010
In many problems, one wishes to solve the Helmholtz equation in cylindrical or spherical coordinates which introduces variable coefficients within the differentiated terms. Fourth ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...