Reactive search, a history-sensitive heuristic for MAX-SAT
暂无分享,去创建一个
[1] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[2] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[3] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[4] Torben Hagerup,et al. A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..
[5] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[6] Steven Minton,et al. Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.
[7] Jun Gu,et al. Parallel algorithms and architectures for very fast AI search , 1991 .
[8] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[9] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[10] Jun Gu,et al. Efficient local search for very large-scale satisfiability problems , 1992, SGAR.
[11] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[12] Toby Walsh,et al. Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.
[13] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[14] Toby Walsh,et al. An Empirical Analysis of Search in GSAT , 1993, J. Artif. Intell. Res..
[15] Jan Korst,et al. Deterministic and randomized local search , 1993 .
[16] Bart Selman,et al. An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.
[17] On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[18] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[19] Paola Alimonti. New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems , 1994, CIAC.
[20] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[21] Mauricio G. C. Resende,et al. Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.
[22] Giorgio Ausiello,et al. Theoretical Computer Science Approximate Solution of Np Optimization Problems * , 2022 .
[23] John N. Hooker,et al. Testing heuristics: We have it all wrong , 1995, J. Heuristics.
[24] Jun Gu,et al. Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.
[25] Roberto Battiti,et al. Solving MAX-SAT with non-oblivious functions and history-based heuristics , 1996, Satisfiability Problem: Theory and Applications.
[26] Panos M. Pardalos,et al. Continuous Approaches to Discrete Optimization Problems , 1996 .
[27] Dimitri P. Bertsekas,et al. Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems , 1996, NIPS.