65 search results - page 1 / 13 » GSAT and Dynamic Backtracking |
62
Voted
KR
1994
Springer
15 years 2 months ago
1994
Springer
TIME
2002
IEEE
15 years 3 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] ...
65
Voted
AAAI
1997
14 years 11 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
87
Voted
CP
2005
Springer
15 years 3 months ago
2005
Springer
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
AIMSA
2008
Springer
15 years 5 days ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....