Experimental Comparison of Two Evolutionary Algorithms for the Independent Set Problem
暂无分享,去创建一个
[1] Thomas Bäck,et al. An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.
[2] Gilbert Syswerda,et al. A Study of Reproduction in Generational and Steady State Genetic Algorithms , 1990, FOGA.
[3] Marc Schoenauer,et al. A Priori Comparison of Binary Crossover Operators: No Universal Statistical Measure, But a Set of Hints , 1997, Artificial Evolution.
[4] Thomas Jansen,et al. A New Framework for the Valuation of Algorithms for Black-Box Optimization , 2002, FOGA.
[5] Egon Balas,et al. Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems , 1998, J. Heuristics.
[6] Gunar E. Liepins,et al. Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.
[7] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[8] David B. Fogel,et al. Using fitness distributions to design more efficient evolutionary computations , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[9] U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[10] Anton V. Eremeev,et al. A Study on Performance of the (1+1)-Evolutionary Algorithm , 2002, FOGA.
[11] Panos M. Pardalos,et al. The maximum clique problem , 1994, J. Glob. Optim..
[12] Zbigniew Michalewicz,et al. Evolutionary Computation 1 , 2018 .
[13] Thomas Bäck,et al. An evolutionary heuristic for the maximum independent set problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.