4117 search results - page 205 / 824 » On the Satisfiability of Complex Constraints |
180
click to vote
IJDMB
2010
15 years 3 months ago
2010
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
164
click to vote
ISMVL
2009
IEEE
16 years 1 months ago
2009
IEEE
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
163
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
196
click to vote
CSL
2003
Springer
15 years 11 months ago
2003
Springer
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
159
click to vote
CP
1999
Springer
15 years 11 months ago
1999
Springer
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...