Genetic Algorithm Behavior in the MAXSAT Domain
暂无分享,去创建一个
[1] Jeremy Frank,et al. When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..
[2] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[3] J. Frank. A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3-SAT Problems , 1995 .
[4] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[5] Colin R. Reeves,et al. Epistasis in Genetic Algorithms: An Experimental Design Perspective , 1995, ICGA.
[6] David E. Goldberg,et al. Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..
[7] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[8] L. Darrell Whitley,et al. A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms , 1998, AAAI/IAAI.
[9] Colin R. Reeves,et al. An Experimental Design Perspective on Genetic Algorithms , 1994, FOGA.
[10] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[11] David E. Goldberg,et al. Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..