Solving the MAXSAT problem using a multivariate EDA based on Markov networks
暂无分享,去创建一个
John A. W. McCall | Deryck Forsyth Brown | Alexander E. I. Brownlee | J. McCall | D. Brown | A. Brownlee
[1] David E. Goldberg,et al. A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..
[2] J. E. Glynn,et al. Numerical Recipes: The Art of Scientific Computing , 1989 .
[3] David E. Goldberg,et al. Hierarchical BOA Solves Ising Spin Glasses and MAXSAT , 2003, GECCO.
[4] J. Laurie Snell,et al. Markov Random Fields and Their Applications , 1980 .
[5] John McCall,et al. Updating the probability vector using MRF technique for a Univariate EDA , 2004 .
[6] Thomas Stützle,et al. SATLIB: An Online Resource for Research on SAT , 2000 .
[7] Siddhartha Shakya,et al. Solving the Ising Spin Glass Problem using a Bivariate EDA based on Markov Random Fields , 2006, 2006 IEEE International Conference on Evolutionary Computation.
[8] David S. Johnson. Approximation algorithms for combinatorial problems , 1973, STOC '73.
[9] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[10] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[11] Qingfu Zhang,et al. An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.
[12] Siddhartha Shakya,et al. DEUM : a framework for an estimation of distribution algorithm based on Markov random fields , 2006 .
[13] John A. W. McCall,et al. Markov Random Field Modelling of Royal Road Genetic Algorithms , 2001, Artificial Evolution.
[14] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.