Author:
Liu Rui,Qian Bin,Zhang Sen,Hu Rong,Yu Nai-Kang
Publisher
Springer Nature Singapore
Reference21 articles.
1. Doerr, B., Krejca, M.S.: A simplified run time analysis of the univariate marginal distribution algorithm on Leading Ones. Theoret. Comput. Sci. 851(1), 121–128 (2021)
2. Dang, D.-C., Lehre, P.K., Nguyen, P.T.H.: Level-based analysis of the univariate marginal distribution algorithm. Algorithmica 81(2), 668–702 (2018)
3. Krejca, M.S., Witt, C.: Lower bounds on the run time of the univariate marginal distribution algorithm on onemax. contribution title. In: 9th International Proceedings on Proceedings, pp. 1–2. Publisher, Location (2010)
4. Sutton, A.M.: Superpolynomial lower bounds for the (1 + 1) EA on some easy combinatorial problems. Algorithmica 75(3), 507–528 (2016)
5. Zhang, Y., Hao, Z., Huang, H., et al.: Runtime analysis of (1+1) evolutionary algorithm for two combinatorial optimization instances. J. Inform. Comput. Sci. 8(15), 3497–3506 (2011)