714 search results - page 13 / 143 » Lexicographically-ordered constraint satisfaction problems |
117
click to vote
CORR
2007
Springer
14 years 9 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
AICCSA
2006
IEEE
15 years 3 months ago
2006
IEEE
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
74
Voted
AAAI
1990
14 years 10 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
83
Voted
SPDP
1991
IEEE
15 years 28 days ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...