A Game-Theoretic Approach for Designing Mixed Mutation Strategies
暂无分享,去创建一个
[1] Jörgen W. Weibull,et al. Evolutionary Game Theory , 1996 .
[2] David B. Fogel,et al. Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .
[3] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[4] Thomas Bck,et al. Evolutionary computation: Toward a new philosophy of machine intelligence , 1997 .
[5] Kumar Chellapilla,et al. Combining mutation operators in evolutionary programming , 1998, IEEE Trans. Evol. Comput..
[6] Xin Yao,et al. Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..
[7] J. Pollack,et al. A game-theoretic investigation of selection methods used in evolutionary algorithms , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[8] D. Fogel,et al. Multiple-vector self-adaptation in evolutionary algorithms. , 2001, Bio Systems.
[9] K.A. De Jong,et al. Analyzing cooperative coevolution with evolutionary game theory , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[10] Jordan B. Pollack,et al. A Game-Theoretic Memory Mechanism for Coevolution , 2003, GECCO.
[11] Xin Yao,et al. Adapting Self-Adaptive Parameters in Evolutionary Algorithms , 2001, Applied Intelligence.
[12] Xin Yao,et al. Evolutionary programming using mutations based on the Levy probability distribution , 2004, IEEE Transactions on Evolutionary Computation.
[13] David B. Fogel,et al. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence (IEEE Press Series on Computational Intelligence) , 2006 .