Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT
暂无分享,去创建一个
[1] Bart Selman,et al. Evidence for Invariants in Local Search , 1997, AAAI/IAAI.
[2] Holger H. Hoos,et al. UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT , 2004, SAT.
[3] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[4] Harry Zhang,et al. Combining Adaptive Noise and Look-Ahead in Local Search for SAT , 2007, SAT.
[5] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[6] Thomas Stützle,et al. Iterated Robust Tabu Search for MAX-SAT , 2003, Canadian Conference on AI.
[7] Holger H. Hoos,et al. Captain Jack: New Variable Selection Heuristics in Local Search for SAT , 2011, SAT.
[8] Dale Schuurmans,et al. Local search characteristics of incomplete SAT procedures , 2000, Artif. Intell..
[9] Bart Selman,et al. Incomplete Algorithms , 2021, Handbook of Satisfiability.
[10] L. Darrell Whitley,et al. Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT , 2012, GECCO '12.
[11] Toby Walsh,et al. Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.
[12] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[13] Ian P. Gent,et al. The Enigma of SAT Hill-climbing Procedures , 1992 .
[14] Toby Walsh,et al. An Empirical Analysis of Search in GSAT , 1993, J. Artif. Intell. Res..