Making the breakout algorithm complete using systematic search

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1374-1375

  Eisenberg, Carlos ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING ALGORITHM; HYBRID ALGORITHMS; LOCAL SEARCH ALGORITHM; ORDERS OF MAGNITUDE; OVER-CONSTRAINED PROBLEM; SOLVING SCHEMES; SYSTEMATIC SEARCH ALGORITHM; SYSTEMATIC SEARCHES;

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY;

LEARNING ALGORITHMS;

EID: 9444262924     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Andrew Davenport and Edward Tsang. An empirical investigation into the exceptionally hard problems. Technical Report CSM-239, Department of Computer Science, University of Essex, U.K., 1995.
2. Boi Faltings and Macho-Gonzalez. Open Constraint Satisfaction. Proceedings of the 8th International Conference, CP 2002 Ithaca, NY, USA, Sept. 2002.
3. Steven Minton and Mark D. Johnston and Andrew B. Philips and Philip Laird. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence, Vol. 58, P. 161-205,1992.
4. Paul Morris. The breakout method for escaping from local minima. Proc. of the 11th National Conf on Artificial Intelligence, Washington, DC, pp. 4(M5, 1993.