Comparing global and local mutations on bit strings
暂无分享,去创建一个
[1] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[2] Günter Rudolph,et al. How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time , 1996, Evolutionary Computation.
[3] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[4] Thomas Jansen,et al. On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm , 1998, PPSN.
[5] Benjamin Doerr,et al. A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem , 2007 .
[6] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[7] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[8] Kalyanmoy Deb,et al. Long Path Problems , 1994, PPSN.
[9] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Choice of the Mutation Probability for the ( 1 + 1 ) EA , 2006 .