942 search results - page 8 / 189 » Distance Constraint Satisfaction Problems |
AAAI
1994
13 years 8 months ago
1994
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
AIMSA
2004
Springer
14 years 23 days ago
2004
Springer
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
JGO
2008
13 years 7 months ago
2008
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
DAGSTUHL
2008
13 years 8 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...