{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:35:23Z","timestamp":1767980123417,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319458229","type":"print"},{"value":"9783319458236","type":"electronic"}],"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_71","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T09:26:31Z","timestamp":1472549191000},"page":"761-770","source":"Crossref","is-referenced-by-count":5,"title":["Graceful Scaling on Uniform Versus Steep-Tailed Noise"],"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":"Martin S.","family":"Krejca","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":"71_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2009","unstructured":"Bianchi, L., Dorigo, M., Gambardella, L., Gutjahr, W.: A survey on metaheuristics for stochastic combinatorial optimization. Nat. Comput. 8, 239\u2013287 (2009)","journal-title":"Nat. Comput."},{"key":"71_CR2","doi-asserted-by":"crossref","unstructured":"Dang, D.-C., Lehre, P.K.: Evolution under partial information. In: Proceedings of GECCO 2014, pp. 1359\u20131366 (2014)","DOI":"10.1145\/2576768.2598375"},{"key":"71_CR3","doi-asserted-by":"crossref","unstructured":"Doerr, B., Hota, A., K\u00f6tzing, T.: Ants easily solve stochastic shortest path problems. In: Proceedings of GECCO 2012, pp. 17\u201324 (2012)","DOI":"10.1145\/2330163.2330167"},{"issue":"4","key":"71_CR4","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64(4), 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"71_CR5","doi-asserted-by":"crossref","unstructured":"Feldmann, M., K\u00f6tzing, T.: Optimizing expected path lengths with ant colony optimization using fitness proportional update. In: Proceedings of FOGA 2013, pp. 65\u201374 (2013)","DOI":"10.1145\/2460239.2460246"},{"key":"71_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-662-48971-0_13","volume-title":"Algorithms and Computation","author":"T Friedrich","year":"2015","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: The benefit of recombination in noisy evolutionary search. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 140\u2013150. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48971-0_13"},{"key":"71_CR7","doi-asserted-by":"crossref","unstructured":"Gie\u00dfen, C., K\u00f6tzing, T.: Robustness of populations in stochastic environments. In: Proceedings of GECCO 2014, pp. 1383\u20131390 (2014)","DOI":"10.1145\/2576768.2598227"},{"key":"71_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/978-3-540-39816-5_2","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"WJ Gutjahr","year":"2003","unstructured":"Gutjahr, W.J.: A converging ACO algorithm for stochastic combinatorial optimization. In: Albrecht, A.A., Steinh\u00f6fel, K. (eds.) SAGA 2003. LNCS, vol. 2827, pp. 10\u201325. Springer, Heidelberg (2003)"},{"key":"71_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00229298","volume":"8","author":"W Gutjahr","year":"1996","unstructured":"Gutjahr, W., Pflug, G.: Simulated annealing for noisy cost functions. J. Glob. Optim. 8, 1\u201313 (1996)","journal-title":"J. Glob. Optim."},{"key":"71_CR10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments\u2013a survey. IEEE Trans. Evol. Comp. 9, 303\u2013317 (2005)","journal-title":"IEEE Trans. Evol. Comp."},{"key":"71_CR11","series-title":"Lecture Notes in Computer Science","first-page":"244","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"PK Lehre","year":"2010","unstructured":"Lehre, P.K.: Negative drift in populations. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 244\u2013253. Springer, Heidelberg (2010)"},{"key":"71_CR12","doi-asserted-by":"crossref","unstructured":"Pr\u00fcgel-Bennett, A., Rowe, J.E., Shapiro, J.: Run-time analysis of population-based evolutionary algorithm in noisy environments. In: Proceedings of FOGA 2015, pp. 69\u201375 (2015)","DOI":"10.1145\/2725494.2725498"},{"key":"71_CR13","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/s00453-011-9606-2","volume":"64","author":"D Sudholt","year":"2012","unstructured":"Sudholt, D., Thyssen, C.: A simple ant colony optimizer for stochastic shortest path problems. Algorithmica 64, 643\u2013672 (2012)","journal-title":"Algorithmica"},{"key":"71_CR14","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."}],"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_71","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_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}