Analysis of Computational Time of Simple Estimation of Distribution Algorithms
暂无分享,去创建一个
Xin Yao | Tianshi Chen | Guoliang Chen | Ke Tang | X. Yao | K. Tang | Guoliang Chen | Tianshi Chen
[1] David E. Goldberg,et al. The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..
[2] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[3] Yang Yu,et al. A new approach to estimating the expected first hitting time of evolutionary algorithms , 2006, Artif. Intell..
[4] Pedro Larrañaga,et al. Average Time Complexity of Estimation of Distribution Algorithms , 2005, IWANN.
[5] Xin Yao,et al. On the analysis of average time complexity of estimation of distribution algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.
[6] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[7] Heinz Mühlenbein,et al. Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.
[8] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[9] María Cristina González Morgado. Contributions on theoretical aspects of estimation of distributions algorithms , 2006 .
[10] Thomas Jansen,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 Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization , 2004 .
[11] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..
[12] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[13] Bojan Cestnik,et al. Estimating Probabilities: A Crucial Task in Machine Learning , 1990, ECAI.
[14] Mohammad Reza Meybodi,et al. A Study on the Global Convergence Time Complexity of Estimation of Distribution Algorithms , 2005, RSFDGrC.
[15] David E. Goldberg,et al. Scalability of the Bayesian optimization algorithm , 2002, Int. J. Approx. Reason..
[16] 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).
[17] W. Rudnick. Genetic algorithms and fitness variance with an application to the automated design of artificial neural networks , 1992 .
[18] Pedro Larrañaga,et al. Mathematical Modeling of Discrete Estimation of Distribution Algorithms , 2002, Estimation of Distribution Algorithms.
[19] Heinz Mühlenbein,et al. The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.
[20] Heinz Mühlenbein,et al. Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.
[21] Franz Rothlauf,et al. On the importance of the second largest eigenvalue on the convergence rate of genetic algorithms , 2001 .
[22] 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 .
[23] D. Goldberg,et al. Domino convergence, drift, and the temporal-salience structure of problems , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).
[24] Xin Yao,et al. Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..
[25] Shumeet Baluja,et al. A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .
[26] Lishan Kang,et al. On the Convergence Rates of Genetic Algorithms , 1999, Theor. Comput. Sci..
[27] Kalyanmoy Deb,et al. Long Path Problems , 1994, PPSN.
[28] Stefan Droste,et al. A rigorous analysis of the compact genetic algorithm for linear functions , 2006, Natural Computing.
[29] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .
[30] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[31] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[32] R. Serfling. Probability Inequalities for the Sum in Sampling without Replacement , 1974 .
[33] J. A. Lozano,et al. Analyzing the PBIL Algorithm by Means of Discrete Dynamical Systems , 2000 .
[34] Edward R. Scheinerman,et al. Invitation to Dynamical Systems , 1995 .
[35] M. Kimura,et al. An introduction to population genetics theory , 1971 .
[36] Qingfu Zhang,et al. On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm , 2004, IEEE Transactions on Evolutionary Computation.
[37] Heinz Mühlenbein,et al. Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning , 2002, Int. J. Approx. Reason..
[38] J. Rice. Mathematical Statistics and Data Analysis , 1988 .
[39] XI FachbereichInformatik. Finite Markov Chain Results in Evolutionary Computation: a Tour D'horizon , 1998 .
[40] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[41] Qingfu Zhang,et al. On the convergence of a class of estimation of distribution algorithms , 2004, IEEE Transactions on Evolutionary Computation.
[42] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[43] Xin Yao,et al. A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability , 2007, Evolutionary Computation.
[44] Ingo Wegener,et al. Simulated Annealing Beats Metropolis in Combinatorial Optimization , 2005, ICALP.