Neighbourhood Clause Weight Redistribution in Local Search for SAT
暂无分享,去创建一个
Abdul Sattar | John Thornton | Duc Nghia Pham | Abdelraouf Ishtaiwi | A. Sattar | D. Pham | J. Thornton | Abdelraouf Ishtaiwi
[1] Bart Selman,et al. Evidence for Invariants in Local Search , 1997, AAAI/IAAI.
[2] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[3] Thomas Stützle,et al. Stochastic Local Search , 2007, Handbook of Approximation Algorithms and Metaheuristics.
[4] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[5] Dale Schuurmans,et al. The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming , 2001, IJCAI.
[6] Nicolas Barnier,et al. Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .
[7] Dale Schuurmans,et al. Local search characteristics of incomplete SAT procedures , 2000, Artif. Intell..
[8] Liang Zhao,et al. Resolvent Clause Weighting Local Search , 2004, Canadian Conference on AI.
[9] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.
[10] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[11] John Thornton,et al. Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.
[12] Byungki Cha,et al. Adding New Clauses for Faster Local Search , 1996, AAAI/IAAI, Vol. 1.