{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:22Z","timestamp":1759639042346,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992587"},{"type":"electronic","value":"9783319992594"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99259-4_9","type":"book-chapter","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T13:28:18Z","timestamp":1534771698000},"page":"105-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Level-Based Analysis of the Population-Based Incremental Learning Algorithm"],"prefix":"10.1007","author":[{"given":"Per Kristian","family":"Lehre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phan Trung Hai","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"key":"9_CR1","unstructured":"Baluja, S.: Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical report, Carnegie Mellon University (1994)"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1214\/aop\/1176993520","volume":"11","author":"PJ Boland","year":"1983","unstructured":"Boland, P.J., Proschan, F.: The reliability of k out of n systems. Ann. Probab. 11(3), 760\u2013764 (1983)","journal-title":"Ann. Probab."},{"issue":"99","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2017.2745715","volume":"PP","author":"D Corus","year":"2017","unstructured":"Corus, D., Dang, D.C., Eremeev, A.V., Lehre, P.K.: Level-based analysis of genetic algorithms and other search processes. IEEE Trans. Evol. Comput. PP(99), 1 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Lehre, P.K.: Simplified runtime analysis of estimation of distribution algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2015, pp. 513\u2013518 (2015)","DOI":"10.1145\/2739480.2754814"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s11047-006-9001-0","volume":"5","author":"S Droste","year":"2006","unstructured":"Droste, S.: A rigorous analysis of the compact genetic algorithm for linear functions. Nat. Comput. 5(3), 257\u2013283 (2006)","journal-title":"Nat. Comput."},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1214\/aop\/1176996461","volume":"3","author":"LJ Gleser","year":"1975","unstructured":"Gleser, L.J.: On the distribution of the number of successes in independent trials. Ann. Probab. 3(1), 182\u2013188 (1975)","journal-title":"Ann. Probab."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Krejca, M.S., Witt, C.: Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax. In: Proceedings of the Foundation of Genetic Algorithms, FOGA 2017, pp. 65\u201379 (2017)","DOI":"10.1145\/3040718.3040724"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Nguyen, P.T.H.: Improved runtime bounds for the univariate marginal distribution algorithm via anti-concentration. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 1383\u20131390 (2017)","DOI":"10.1145\/3071178.3071317"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1214\/aop\/1176990746","volume":"18","author":"P Massart","year":"1990","unstructured":"Massart, P.: The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality. Ann. Probab. 18(3), 1269\u20131283 (1990)","journal-title":"Ann. Probab."},{"key":"9_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel Problem Solving from Nature\u2014PPSN IV","author":"H M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From recombination of genes to the estimation of distributions I. Binary parameters. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178\u2013187. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61723-X_982"},{"key":"9_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511817106","volume-title":"The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities","author":"JM Steele","year":"2004","unstructured":"Steele, J.M.: The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities. Cambridge University Press, Cambridge (2004)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Witt, C.: Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 1415\u20131422 (2017)","DOI":"10.1145\/3071178.3071216"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1109\/TEVC.2017.2667713","volume":"21","author":"Z Wu","year":"2017","unstructured":"Wu, Z., Kolonko, M., M\u00f6hring, R.H.: Stochastic runtime analysis of the cross-entropy algorithm. IEEE Trans. Evol. Comput. 21(4), 616\u2013628 (2017)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99259-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T14:33:42Z","timestamp":1535034822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99259-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992587","9783319992594"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99259-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}