ERA: An Algorithm for Reducing the Epistasis of SAT Problems
暂无分享,去创建一个
[1] James Smith,et al. On Appropriate Adaptation Levels for the Learning of Gene Linkage , 2002, Genetic Programming and Evolvable Machines.
[2] Yuval Davidor,et al. Epistasis Variance: A Viewpoint on GA-Hardness , 1990, FOGA.
[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[4] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.
[5] José Torres-Jiménez,et al. A New Measure for the Bandwidth Minimization Problem , 2000, IBERAMIA-SBIA.
[6] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[7] William M. Spears,et al. Simulated annealing for hard satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.
[8] Lashon B. Booker,et al. Proceedings of the fourth international conference on Genetic algorithms , 1991 .
[9] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[10] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[11] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[12] Fausto Giunchiglia,et al. The SAT-Based Approach for Classical Modal Logics , 1999, AI*IA.
[13] ISAAC VÁZQUEZ-MORÁN,et al. SAT Instances Construction Based on Hypergraphs , 2002 .
[14] Jin-Kao Hao,et al. A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems , 1995, ICANNGA.
[15] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[16] Lothar Thiele,et al. A Mathematical Analysis of Tournament Selection , 1995, ICGA.
[17] Fausto Giunchiglia,et al. SAT-Based Decision Procedures for Classical Modal Logics , 2004, Journal of Automated Reasoning.
[18] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[19] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[20] Gunar E. Liepins,et al. Schema Disruption , 1991, ICGA.
[21] Georges R. Harik,et al. Foundations of Genetic Algorithms , 1997 .