{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:11Z","timestamp":1760202671763},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319107615"},{"type":"electronic","value":"9783319107622"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10762-2_88","type":"book-chapter","created":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T10:58:55Z","timestamp":1410346735000},"page":"892-901","source":"Crossref","is-referenced-by-count":37,"title":["Unbiased Black-Box Complexity of\u00a0Parallel\u00a0Search"],"prefix":"10.1007","author":[{"given":"Golnaz","family":"Badkobeh","sequence":"first","affiliation":[]},{"given":"Per Kristian","family":"Lehre","sequence":"additional","affiliation":[]},{"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"88_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0012-365X(79)90084-0","volume":"25","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: The tail of the hypergeometric distribution. Discrete Math.\u00a025(3), 285\u2013287 (1979)","journal-title":"Discrete Math."},{"key":"88_CR2","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Ebel, F.: Lessons from the black-box: fast crossover-based genetic algorithms. In: Proc. of GECCO 2013, pp. 781\u2013788. ACM (2013)","DOI":"10.1145\/2463372.2463480"},{"key":"88_CR3","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D., K\u00f6tzing, T., Lehre, P.K., Wagner, M., Winzen, C.: Faster black-box algorithms through higher arity operators. In: Proc. of FOGA 2011, pp. 163\u2013172. ACM (2011)","DOI":"10.1145\/1967654.1967669"},{"key":"88_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-20712-9_2","volume-title":"Computer Science \u2013 Theory and Applications","author":"B. Doerr","year":"2011","unstructured":"Doerr, B., Winzen, C.: Towards a complexity theory of randomized search heuristics: Ranking-based black-box complexity. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol.\u00a06651, pp. 15\u201328. Springer, Heidelberg (2011)"},{"key":"88_CR5","doi-asserted-by":"crossref","unstructured":"Doerr, B., Winzen, C.: Playing Mastermind with Constant-Size Memory. Theory of Computing Systems (2012)","DOI":"10.1007\/s00224-012-9438-8"},{"issue":"4","key":"88_CR6","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S. Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems\u00a039(4), 525\u2013544 (2006)","journal-title":"Theory of Computing Systems"},{"key":"88_CR7","unstructured":"He, J., Chen, T., Yao, X.: Average drift analysis and its application. CoRR, abs\/1308.3080 (2013)"},{"issue":"1","key":"88_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J. He","year":"2004","unstructured":"He, J., Yao, X.: A Study of Drift Analysis for Estimating Computation Time of Evolutionary Algorithms. Natural Computing\u00a03(1), 21\u201335 (2004)","journal-title":"Natural Computing"},{"key":"88_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T. Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation\u00a013, 413\u2013440 (2005)","journal-title":"Evolutionary Computation"},{"key":"88_CR10","unstructured":"Johannsen, D.: Random Combinatorial Structures and Randomized Search Heuristics. PhD thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany and the Max-Planck-Institut f\u00fcr Informatik (2010)"},{"key":"88_CR11","unstructured":"L\u00e4ssig, J., Sudholt, D.: General upper bounds on the running time of parallel evolutionary algorithms. Evolutionary Computation (in press), \n                    \n                      http:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/EVCO_a_00114"},{"key":"88_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-25591-5_42","volume-title":"Algorithms and Computation","author":"J. L\u00e4ssig","year":"2011","unstructured":"L\u00e4ssig, J., Sudholt, D.: Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 405\u2013414. Springer, Heidelberg (2011)"},{"issue":"4","key":"88_CR13","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"P.K. Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica\u00a064(4), 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"88_CR14","doi-asserted-by":"crossref","unstructured":"Luque, G., Alba, E.: Parallel Genetic Algorithms\u2013Theory and Real World Applications. Springer (2011)","DOI":"10.1007\/978-3-642-22084-5"},{"key":"88_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-32937-1_2","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"A. Mambrini","year":"2012","unstructured":"Mambrini, A., Sudholt, D., Yao, X.: Homogeneous and heterogeneous island models for the set cover problem. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part I. LNCS, vol.\u00a07491, pp. 11\u201320. Springer, Heidelberg (2012)"},{"key":"88_CR16","doi-asserted-by":"crossref","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the (1,\u03bb)\u00a0EA. In: Proc. of GECCO 2012, pp. 1349\u20131356 (2012)","DOI":"10.1145\/2330163.2330350"},{"key":"88_CR17","first-page":"2035","volume-title":"Proc. of GECCO 2011","author":"J.E. Rowe","year":"2011","unstructured":"Rowe, J.E., Vose, M.D.: Unbiased black box search algorithms. In: Proc. of GECCO 2011, p. 2035. ACM, New York (2011)"},{"key":"88_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11844297_3","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"O. Teytaud","year":"2006","unstructured":"Teytaud, O., Gelly, S.: General lower bounds for evolutionary algorithms. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol.\u00a04193, pp. 21\u201331. Springer, Heidelberg (2006)"},{"key":"88_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-87700-4_12","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"C. Zarges","year":"2008","unstructured":"Zarges, C.: Rigorous runtime analysis of inversely fitness proportional mutation rates. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol.\u00a05199, pp. 112\u2013122. Springer, Heidelberg (2008)"},{"key":"88_CR20","doi-asserted-by":"crossref","unstructured":"Zarges, C.: On the utility of the population size for inversely fitness proportional mutation rates. In: Proc. of FOGA 2009, pp. 39\u201346. ACM (2009)","DOI":"10.1145\/1527125.1527132"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10762-2_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:07:39Z","timestamp":1558976859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10762-2_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319107615","9783319107622"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10762-2_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}