New search heuristics for Max-CSP

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

Volumn 1894, Issue , 2000, Pages 262-277

  Kask, Kalev ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; ECONOMIC AND SOCIAL EFFECTS; HEURISTIC ALGORITHMS; STOCHASTIC SYSTEMS;

APPROXIMATION SCHEME; BEST FIRST SEARCH; BUCKET ELIMINATIONS; CONSTRAINT PROBLEMS; PARAMETERIZED; SEARCH HEURISTICS; STATE OF THE ART; STOCHASTIC LOCAL SEARCHES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84945909875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_20     Document Type: Conference Paper

References (15)

1. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113: 41-85, 1999.
2. R. Dechter and J. Pearl. Generalized best-first search strategies and the optimality of a*. Journal of the ACM, 32: 506-536, 1985.
3. R. Dechter and I. Rish. A scheme for approximating probabilistic inference. In Proceedings of Uncertainty in Artificial Intelligence (UAI97), pages 132-141, 1997.
4. I. P. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for sat. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 28-33, 1993.
5. K. Kask I. Rish and R. Dechter. Approximation algorithms for probabilistic decoding. In Uncertainty in Artificial Intelligence (UAI-98), 1998.
6. K. Kask and R. Dechter. Branch and bound with mini-bucket heuristics. In Proc. IJCAI, pages 426-433, 1999.
7. K. Kask and R. Dechter. Mini-bucket heuristics for improved search. In Proc. UAI, 1999.
8. K. Kask and R. Dechter. Using mini-bucket heuristics for max-csp. UCI Technical report, 2000.
9. K. Kask and R. Dechter. Gsat and local consistency. In International Joint Conference on Artificial Intelligence (IJCAI95), pages 616-622, Montreal, Canada, August 1995.
10. J. Larossa and P. Meseguer. Partition-based lower bound for max-csp. Proc. CP99, 1999.
11. P. Morris. The breakout method for escaping from local minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 40-45, 1993.
12. A. B. Philips, S. Minton, M. D. Johnston and P. Laired. Solving large scale constraint satisfaction and scheduling problems using heuristic repair methods. In National Conference on Artificial Intelligence (AAAI-90), pages 17-24, Anaheim, CA, 1990.
13. B. Selman and H. Kautz. An empirical study of greedy local search for satisfiability testing. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 46-51, 1993.
14. B. Selman, H. Kautz, and B. Cohen. Noise strategies for local search. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 337-343, 1994.
15. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. National Conference on Artificial Intelligence (AAAI-92), 1992.