Evidence for Invariants in Local Search
暂无分享,去创建一个
[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[2] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[3] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..
[4] David Connolly. An improved annealing scheme for the QAP , 1990 .
[5] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[6] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[7] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[8] F. Glover,et al. In Modern Heuristic Techniques for Combinatorial Problems , 1993 .
[9] Toby Walsh,et al. Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.
[10] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[11] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[12] Bart Selman,et al. An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.
[13] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[14] Henry Kautz,et al. Noise Strategies for Local Search , 1994, AAAI 1994.
[15] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[16] Roberto Battiti,et al. Reactive Search, a history-based heuristic for MAX-SAT , 1996 .
[17] Andrew J. Parkes,et al. Tuning Local Search for Satisfiability Testing , 1996, AAAI/IAAI, Vol. 1.