Resolvent clause weighting local search

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

Volumn 3060, Issue , 2014, Pages 233-247

  Pullan, Wayne ^a   Zhao, Liang ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Constraints; Search

Indexed keywords

ARTIFICIAL INTELLIGENCE; EMBEDDED SYSTEMS; LAGRANGE MULTIPLIERS; LOCAL SEARCH (OPTIMIZATION); PARAMETER ESTIMATION; PROBLEM SOLVING; STOCHASTIC SYSTEMS;

BENCH-MARK PROBLEMS; CONSTRAINTS; LOCAL SEARCH ALGORITHM; PARAMETER SETTING; RUN TIME PARAMETERS; RUN-TIME PERFORMANCE; SEARCH; STOCHASTIC TECHNIQUES;

ALGORITHMS;

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

References (13)

1. B. Cha and K. Iwama. Adding new clauses for faster local search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 332-337, 1996.
2. J. Frank. Learning short term weights for GSAT. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), pages 384-389, 1997.
3. F. Glover. Tabu search: Part 1. ORSA Journal on Computing, 1(3): 190-206, 1989.
4. H.H. Hoos and T. Stutzle. Towards a characterisation of the behaviour of stochastic local search algorithms for sat. Artificial Intelligence Journal, 112: 213-232, 1999.
5. F. Hutter, A.D. Tompkins, and H.H. Hoos. Scaling and probabilistic smoothing: Efficient dynamic local search for sat. In Proceedings of CP-02, LNCS 2470, Springer Verlag, pages 233-248, 2002.
6. P. Morris. The Breakout method for escaping local minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 40-45, 1993.
7. W. Pullan, L. Zhao, and J. Thornton. Estimating problem metrics for sat clause weighting local search. In The 16th Australian Joint Conference on Artificial Intelligence - AI03, 2003.
8. D. Schuurmans and F. Southey. Local search characteristics of incomplete SAT procedures. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), pages 297-302, 2000.
9. D. Schuurmans, F. Southey, and R.C. Holte. The exponentiated subgradient algorithm for heuristic boolean programming. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), pages 334-341, 2001.
10. B. Selman and H. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pages 290-295, 1993.
11. Y. Shang and B. Wah. A discrete Lagrangian-based global search method for solving satisfiability problems. J. Global Optimization, 12: 61-99, 1998.
12. J. Thornton, W. Pullan, and J. Terry. Towards fewer parameters for sat clause weighting algorithms. In AI 2002: Advances in Artificial Intelligence, pages 569-578, 2002.
13. Z. Wu and B. Wah. An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), pages 310-315, 2000.