A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences

[1]  Narendra Jussien,et al.  The Path repair algorithm , 2000, Electron. Notes Discret. Math..

[2]  Holger H. Hoos.  SAT-Encodings, Search Space Structure, and Local Search Performance , 1999, IJCAI.

[3]  Steven David Prestwich,et al.  Using an Incomplete Version of Dynamic Backtracking for Graph Colouring , 1999, Electron. Notes Discret. Math..

[4]  Barry Richards,et al.  Non-systematic Search and Learning: An Empirical Study , 1998, CP.

[5]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[6]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[7]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

[8]  Benjamin W. Wah,et al.  A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..

[9]  Makoto Yokoo,et al.  Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs , 1997, CP.

[10]  Andrea Schaerf,et al.  Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems , 1997, IJCAI.

[11]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[12]  S. Mertens,et al.  On the ground states of the Bernasconi model , 1997, cond-mat/9707104.

[13]  Henry Kautz,et al.  Exploiting Variable Dependency in Local Search , 1997, IJCAI 1997.

[14]  Marco Muselli,et al.  A Theoretical Approach to Restart in Global Optimization , 1997, J. Glob. Optim..

[15]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .

[16]  Michel Gendreau,et al.  A View of Local Search in Constraint Programming , 1996, CP.

[17]  Hantao Zhang,et al.  Combining Local Search and Backtracking Techniques for Constraint Satisfaction , 1996, AAAI/IAAI, Vol. 1.

[18]  Andrew J. Parkes,et al.  Tuning Local Search for Satisfiability Testing , 1996, AAAI/IAAI, Vol. 1.

[19]  S. Mertens.  Exhaustive search for low-autocorrelation binary sequences , 1996, cond-mat/9605050.

[20]  James M. Crawford,et al.  Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..

[21]  W. D. Harvey,et al.  Nonsystematic backtracking search , 1995 .

[22]  Bart Selman,et al.  Systematic Versus Stochastic Constraint Satisfaction , 1995, IJCAI.

[23]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[24]  Makoto Yokoo,et al.  Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

[25]  Thomas Schiex,et al.  Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.

[26]  David A. McAllester,et al.  GSAT and Dynamic Backtracking , 1994, KR.

[27]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[28]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[29]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[30]  Mark K. Goldberg,et al.  Constructing cliques using restricted backtracking , 1993, Cliques, Coloring, and Satisfiability.

[31]  P. Langley.  Systematic and nonsystematic search strategies , 1992 .

[32]  K. Hoffmann,et al.  Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies , 1992 .

[33]  J. Bernasconi.  Low autocorrelation binary sequences : statistical mechanics and configuration space analysis , 1987 .

[34]  Marcel J. E. Golay,et al.  The merit factor of long low autocorrelation binary sequences , 1982, IEEE Trans. Inf. Theory.

[35]  MARCEL J. E. GOLAY,et al.  Sieves for low autocorrelation binary sequences , 1977, IEEE Trans. Inf. Theory.