A hybrid schema for systematic local search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3060, Issue , 2014, Pages 248-260

  Havens, William S ^a   Dilkina, Bistra N ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; LOCAL SEARCH (OPTIMIZATION);

CONFLICT-DIRECTED BACKJUMPING; CONSTRAINT SOLVING; CONSTRUCTIVE SEARCH; FORWARD CHECKING; SEARCH SPACES; SYSTEMATICITY; VARIABLE ASSIGNMENT; VARIABLE ORDER;

HEURISTIC METHODS;

EID: 7444263055     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24840-8_18     Document Type: Conference Paper

References (21)

1. R. Bayardo and D. Miranker (1996) A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem, in proc. AAAI-96, pp. 298-304.
2. S. Bistarelli, U. Montanari and F. Rossi (1995) Constraint Solving over Semirings, in proc. IJCAI-95, Morgan-Kaufman.
3. D.A. Clark, J. Frank, I.P. Gent, E. MacIntyre, N. Tomov and T. Walsh (1996) Local Search and the Number of Solutions, in proc. Principles and Practice of Constraint Programming, pp. 119-133.
4. E.C. Freuder and R.J. Wallace (1992) Partial Constraint Satisfaction, Artificial Intelligence 58: 21-70
5. J. Gaschnig (1979) Performance measurement and analysis of certain search algorithms. Tech. report CMU-CS-79-124, Carnegie-Mellon University
6. M.L. Ginsberg (1993) Dynamic backtracking. Journal of Aritificial Intelligence Research 1: 25-46
7. M.L. Ginsberg and D.A. McAllester (1994) GSAT and dynamic backtracking. in proc. 4th Int. Conf. on Principles of Knowledge Representation and Reasoning
8. F. Glover (1990) Tabu search: a tutorial, Interfaces 20(74-94).
9. C. Gomes, B. Selman and H. Kautz (1998) Boosting Combinatorial Search through Randomization, proc. Fifteenth National Conference on Artificial Intelligence, pp. 431-437, Madison, WI, AAAI Press.
10. W.S. Havens (1997) NoGood Caching for MultiAgent Backtrack Search, in proc. AAAI-97 Constraints and Agents Workshop.
11. N. Jussein and O. Lhomme (2002) Local search with constraint propagation and conflict-based heuristics, Artificial Intelligence 139: 21-45.
12. V. Kumar (1992) Algorithms for constraint satisfaction problems - a survey, AI Magazine 13(32-44)
13. I. Lynce, L. Baptista and J. P. Marques-Silva (2001) Stochastic Systematic Search Algorithms for Satisfiability, LICS Workshop on Theory and Applications of Satisfiability Testing (LICS-SAT), June 2001.
14. S. Minton, M. Johnston, A. Phillips and P. Laird (1990) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58: 161-205
15. P. Morris (1993) The breakout method for escaping from local minima. in proc. AAAI-93 pp. 40-45
16. S. Prestwich (2001) Local Search and Backtracking vs Non-Systematic Backtracking, proc. AAAI 2001 Fall Symposium on Using Uncertainty within Computation.
17. P. Prosser (199x) Hybrid Algorithms for the Constraint Satisfaction Problem, Computational Intelligence 9(3): 269-xxx
18. B. Selman, H. Levesque and D. Mitchell (1992) A new method for solving hard satisfiability problems, in proc. 10th National Conf. on Artificial Intelligence,pp. 440-446.
19. R.M. Stallman and G.J. Sussman (1977) Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence 9: 135-196
20. E. Tsang (1994) Foundations of Constraint Satisfaction, Academic Press.
21. M. Yokoo (1994) Weak commitment search for solving constraint satisfaction problems, in proc. AAAI-94, pp. 313-318.