942 search results - page 68 / 189 » Distance Constraint Satisfaction Problems |
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
KBS
2007
14 years 9 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
AAAI
2007
15 years 9 days ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
AGI
2008
14 years 11 months ago
2008
Whereas symbol
CP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...