90 search results - page 7 / 18 » Failure Analysis in Backtrack Search for Constraint Satisfac... |
135
click to vote
SAC
2005
ACM
15 years 11 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
175
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
162
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
170
click to vote
TIME
2002
IEEE
15 years 11 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
171
click to vote
AAAI
2000
15 years 7 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...