Runtime Analysis of Evolutionary Algorithms for Discrete Optimization
暂无分享,去创建一个
[1] Leslie Ann Goldberg,et al. Drift Analysis with Tail Bounds , 2010, PPSN.
[2] Benjamin Doerr,et al. Drift analysis and linear functions revisited , 2010, IEEE Congress on Evolutionary Computation.
[3] Benjamin Doerr,et al. Multiplicative Drift Analysis , 2010, GECCO '10.
[4] Thomas Jansen,et al. Maximal age in randomized search heuristics with aging , 2009, GECCO.
[5] Per Kristian Lehre,et al. When is an estimation of distribution algorithm better than an evolutionary algorithm? , 2009, 2009 IEEE Congress on Evolutionary Computation.
[6] Per Kristian Lehre,et al. Crossover Can Be Constructive When Computing Unique Input Output Sequences , 2008, SEAL.
[7] Jens Jägersküpper,et al. A Blend of Markov-Chain and Drift Analysis , 2008, PPSN.
[8] Carsten Witt,et al. Population size versus runtime of a simple evolutionary algorithm , 2008, Theor. Comput. Sci..
[9] Pietro Simone Oliveto,et al. Analysis of population-based evolutionary algorithms for the vertex cover problem , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).
[10] Xin Yao,et al. On the analysis of average time complexity of estimation of distribution algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.
[11] Per Kristian Lehre,et al. Runtime analysis of (1+l) EA on computing unique input output sequences , 2007, 2007 IEEE Congress on Evolutionary Computation.
[12] Dirk Sudholt,et al. On the runtime analysis of the 1-ANT ACO algorithm , 2007, GECCO '07.
[13] Xin Yao,et al. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results , 2007, Int. J. Autom. Comput..
[14] Jens Jägersküpper,et al. When the Plus Strategy Outperforms the Comma Strategyand When Not , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.
[15] Rajeev Kumar,et al. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..
[16] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[17] Ingo Wegener,et al. Real royal road functions for constant population size , 2003, Theor. Comput. Sci..
[18] Xin Yao,et al. Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..
[19] 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..
[20] I. Wegener,et al. Theoretical Aspects of Evolutionary Algorithms , 2001, ICALP.
[21] Ingo Wegener,et al. Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..
[22] Ingo Wegener,et al. On the utility of populations in evolutionary algorithms , 2001 .
[23] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[24] Stephen Marshall,et al. Convergence Criteria for Genetic Algorithms , 2000, SIAM J. Comput..
[25] Thomas Jansen,et al. On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm , 1998, PPSN.
[26] Ingo Wegener,et al. A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.
[27] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[28] Thomas Bäck,et al. Optimal Mutation Rates in Genetic Search , 1993, ICGA.
[29] Thomas Bäck,et al. An Overview of Evolutionary Computation , 1993, ECML.
[30] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[31] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[32] W. Feller. An Introduction to Probability Theory and Its Applications , 1959 .
[33] I. Wegener,et al. UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms and the Maximum Matching Problem , 2006 .
[34] 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 .
[35] I. Wegener. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2001 .
[36] Günter Rudolph,et al. Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon , 1998, Fundam. Informaticae.
[37] Günter Rudolph,et al. Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.
[38] Heinz Mühlenbein,et al. How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.
[39] William E. Hart,et al. Optimizing an Arbitrary Function is Hard for the Genetic Algorithm , 1991 .
[40] C. Witt,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of Binary Pso Runtime Analysis of Binary Pso * , 2022 .
[41] Xin Yao,et al. This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 On the Impact of Mutation-Selection Balance on the Runtime of , 2022 .
[42] H. Schwefel,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods How to Analyse Evolutionary Algorithms , 2022 .
[43] 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 .