{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:43:34Z","timestamp":1725864214412},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458229"},{"type":"electronic","value":"9783319458236"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_72","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T09:26:31Z","timestamp":1472549191000},"page":"771-781","source":"Crossref","is-referenced-by-count":2,"title":["On the Robustness of Evolving Populations"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew M.","family":"Sutton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"72_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York (2009)","edition":"1"},{"key":"72_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.tcs.2010.10.035","volume":"425","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. 425, 17\u201333 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"72_CR3","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.jtbi.2006.01.011","volume":"241","author":"A Gardner","year":"2006","unstructured":"Gardner, A., Kalinka, A.T.: Recombination and the evolution of mutational robustness. J. Theor. Biol. 241(4), 707\u2013715 (2006)","journal-title":"J. Theor. Biol."},{"key":"72_CR4","unstructured":"Janson, S.: Tail bounds for sums of geometric and exponential variables. (2014). http:\/\/www2.math.uu.se\/svante\/papers\/sjN14.pdf"},{"key":"72_CR5","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Sudholt, D., Theile, M.: How crossover helps in pseudo-Boolean optimization. In: GECCO, pp. 989\u2013996 (2011)","DOI":"10.1145\/2001576.2001711"},{"key":"72_CR6","unstructured":"Lehre, P.K., Witt, C.: General drift analysis with tail bounds. arXiv:1307.2559 [cs.NE] (2013)"},{"issue":"9","key":"72_CR7","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1007\/s00500-010-0610-2","volume":"15","author":"PK Lehre","year":"2011","unstructured":"Lehre, P.K., Yao, X.: Crossover can be constructive when computing unique input-output sequences. Soft Comput. 15(9), 1675\u20131687 (2011)","journal-title":"Soft Comput."},{"issue":"3","key":"72_CR8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00453-010-9387-z","volume":"59","author":"PS Oliveto","year":"2011","unstructured":"Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica 59(3), 369\u2013386 (2011)","journal-title":"Algorithmica"},{"key":"72_CR9","unstructured":"Oliveto, P.S., Witt, C.: Erratum: simplified drift analysis for proving lower bounds in evolutionary computation. arXiv:1211.7184 [cs.NE] (2012)"},{"key":"72_CR10","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: GECCO, pp. 1161\u20131167 (2005)","DOI":"10.1145\/1068009.1068202"},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Crossover speeds up building-block assembly. In: GECCO, pp. 689\u2013696 (2012)","DOI":"10.1145\/2330163.2330260"},{"key":"72_CR12","first-page":"65","volume":"14","author":"C Witt","year":"2006","unstructured":"Witt, C.: Runtime analysis of the ( $$\\mu $$ + 1) EA on simple Pseudo-Boolean functions. Evol. Comput. 14, 65\u201386 (2006)","journal-title":"Evol. Comput."},{"issue":"9","key":"72_CR13","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1109\/5.784219","volume":"87","author":"X Yao","year":"1999","unstructured":"Yao, X.: Evolving artificial neural networks. Proc. IEEE 87(9), 1423\u20131447 (1999)","journal-title":"Proc. IEEE"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:38:54Z","timestamp":1498325934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}