417 search results - page 8 / 84 » In Search of the Best Constraint Satisfaction Search |
97
Voted
AAAI
1996
15 years 29 days ago
1996
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
123
click to vote
AAAI
1996
15 years 29 days ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
70
Voted
AIMSA
2004
Springer
15 years 5 months 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...
AAAI
1990
15 years 24 days 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...
113
Voted
FLAIRS
2004
15 years 1 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...