A Large Population Size Can Be Unhelpful in Evolutionary Algorithms a Large Population Size Can Be Unhelpful in Evolutionary Algorithms
暂无分享,去创建一个
Xin Yao | Tianshi Chen | Guoliang Chen | Ke Tang | X. Yao | K. Tang | Guoliang Chen | Tianshi Chen | Ke Tang | Guoliang Chen | Xin Yao
[1] Pietro Simone Oliveto,et al. Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems , 2009, IEEE Transactions on Evolutionary Computation.
[2] Kalyanmoy Deb,et al. A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.
[3] Pietro Simone Oliveto,et al. Evolutionary algorithms and the Vertex Cover problem , 2007, 2007 IEEE Congress on Evolutionary Computation.
[4] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[5] Bruno O. Shubert,et al. Random variables and stochastic processes , 1979 .
[6] I. Miller. Probability, Random Variables, and Stochastic Processes , 1966 .
[7] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[8] John G. Proakis,et al. Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..
[9] Xin Yao,et al. Analysis of Computational Time of Simple Estimation of Distribution Algorithms , 2010, IEEE Transactions on Evolutionary Computation.
[10] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[11] Kenneth A. De Jong,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on the Choice of the Offspring Population Size in Evolutionary Algorithms on the Choice of the Offspring Population Size in Evolutionary Algorithms , 2004 .
[12] Xin Yao,et al. From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..
[13] Tony Greenfield,et al. Theory and Problems of Probability and Statistics , 1982 .
[14] Xin Yao,et al. Choosing selection pressure for wide-gap problems , 2010, Theor. Comput. Sci..
[15] Xin Yao,et al. A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[16] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[17] Carsten Witt,et al. An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions , 2004, GECCO.
[18] Pietro Simone Oliveto,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Theoretical Analysis of Diversity Mechanisms for Global Exploration Theoretical Analysis of Diversity Mechanisms for Global Exploration , 2022 .