Trap escape for local search by backtracking and conflict reverse
暂无分享,去创建一个
Anh Duc Duong | Abdul Sattar | Huu-Phuoc Duong | Thach-Thao Duong | Duc Nghia Pham | A. Duong | A. Sattar | D. Pham | Thach-Thao Duong | Huu-Phuoc Duong
[1] Abdul Sattar,et al. Weight-Enhanced Diversification in Stochastic Local Search for Satisfiability , 2013, IJCAI.
[2] Kaile Su,et al. Configuration Checking with Aspiration in Local Search for SAT , 2012, AAAI.
[3] Abdul Sattar,et al. Trap Avoidance in Local Search Using Pseudo-Conflict Learning , 2012, AAAI.
[4] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[5] Adrian Balint,et al. Improving Stochastic Local Search for SAT with a New Probability Distribution , 2010, SAT.
[6] Harry Zhang,et al. Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT , 2008, CP.
[7] Abdul Sattar,et al. Combining Adaptive and Dynamic Local Search for Satisfiability , 2008, J. Satisf. Boolean Model. Comput..
[8] Abdul Sattar,et al. A Method to Avoid Duplicative Flipping in Local Search for SAT , 2012, Australasian Conference on Artificial Intelligence.
[9] John Thornton,et al. Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.
[10] Steven David Prestwich,et al. Random Walk with Continuously Smoothed Variable Weights , 2005, SAT.
[11] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[12] Abdul Sattar,et al. A Study of Local Minimum Avoidance Heuristics for SAT , 2012, ECAI.
[13] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[14] Harry Zhang,et al. A Switching Criterion for Intensification and Diversification in Local Search for SAT , 2008, J. Satisf. Boolean Model. Comput..