Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability
暂无分享,去创建一个
Wei Wu | Kaile Su | Shaowei Cai | Chuan Luo | Wei Wu | Chuan Luo | Shaowei Cai | Kaile Su
[1] C.H. Papadimitriou,et al. On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[2] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[3] S Kirkpatrick,et al. Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.
[4] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[5] Thomas Stützle,et al. Systematic vs. Local Search for SAT , 1999, KI.
[6] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.
[7] Nicolas Barnier,et al. Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .
[8] Andrew J. Parkes. Scaling Properties of Pure Random Walk on Random 3-SAT , 2002, CP.
[9] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[10] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[11] W. Kern,et al. An improved deterministic local search algorithm for 3-SAT , 2004, Theor. Comput. Sci..
[12] Erik Aurell,et al. Comparing Beliefs, Surveys, and Random Walks , 2004, NIPS.
[13] Chu Min Li,et al. Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.
[14] Bernd Becker,et al. Speedup Techniques Utilized in Modern SAT Solvers , 2005, SAT.
[15] M. Mézard,et al. Survey propagation: An algorithm for satisfiability , 2005 .
[16] Ke Xu,et al. A Simple Model to Generate Hard Satisfiable Instances , 2005, IJCAI.
[17] Harry Zhang,et al. Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT , 2008, CP.
[18] Adrian Balint,et al. Improving Stochastic Local Search for SAT with a New Probability Distribution , 2010, SAT.
[19] Ofer Strichman,et al. Theory and Applications of Satisfiability Testing – SAT 2010 , 2010, Lecture Notes in Computer Science.
[20] Abdul Sattar,et al. Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..
[21] Kaile Su,et al. Local Search with Configuration Checking for SAT , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.
[22] Armin Biere,et al. Simulating Circuit-Level Simplifications on CNF , 2011, Journal of Automated Reasoning.
[23] Karem A. Sakallah,et al. Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings , 2011, SAT.
[24] Holger H. Hoos,et al. Captain Jack: New Variable Selection Heuristics in Local Search for SAT , 2011, SAT.
[25] Yu Li,et al. Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation) , 2012, SAT.
[26] Kaile Su,et al. Configuration Checking with Aspiration in Local Search for SAT , 2012, AAAI.
[27] Uwe Schöning,et al. Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break , 2012, SAT.
[28] Alessandro Cimatti,et al. Theory and Applications of Satisfiability Testing – SAT 2012 , 2012, Lecture Notes in Computer Science.
[29] Kaile Su,et al. Improving Local Search for Random 3-SAT Using Quantitative Configuration Checking , 2012, ECAI.
[30] Guowu Yang,et al. Complete Boolean Satisfiability Solving Algorithms Based on Local Search , 2013, Journal of Computer Science and Technology.
[31] Abdul Sattar,et al. NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover , 2014, J. Artif. Intell. Res..