A Theoretical Analysis of the k-Satisfiability Search Space
暂无分享,去创建一个
[1] Toby Walsh,et al. Local Search and the Number of Solutions , 1996, CP.
[2] Gert Smolka. Principles and Practice of Constraint Programming-CP97 , 1997, Lecture Notes in Computer Science.
[3] Makoto Yokoo. Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs , 1997, CP.
[4] Jeremy Frank,et al. When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..
[5] H. Waelbroeck,et al. Complex Systems and Binary Networks , 1995 .
[6] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .
[7] Toby Walsh,et al. Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.
[8] Peter F. Stadler,et al. Fast Fourier Transform for Fitness Landscapes , 2002 .
[9] Lov K. Grover. Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..
[11] L. Darrell Whitley,et al. A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms , 1998, AAAI/IAAI.
[12] P. Stadler. Landscapes and their correlation functions , 1996 .
[13] Andrew M. Sutton,et al. Understanding elementary landscapes , 2008, GECCO '08.
[14] Andrew J. Parkes,et al. Tuning Local Search for Satisfiability Testing , 1996, AAAI/IAAI, Vol. 1.