1300 search results - page 22 / 260 » Constraint satisfaction problems and global cardinality cons... |
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...
IJCAI
1989
14 years 10 months ago
1989
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
108
click to vote
AAAI
1994
14 years 11 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
CEC
2009
IEEE
15 years 1 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
AAAI
1998
14 years 11 months ago
1998
In [4], Freuderdefines several types of interchangeability to capture the equivalenceamongthe valuesof a variable in a discrete constraint satisfaction problem(CSP), and provides ...