{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T22:30:43Z","timestamp":1726007443560},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876991"},{"type":"electronic","value":"9783540877004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87700-4_9","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T07:50:04Z","timestamp":1221292204000},"page":"82-91","source":"Crossref","is-referenced-by-count":20,"title":["Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation"],"prefix":"10.1007","author":[{"given":"Pietro S.","family":"Oliveto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s11633-007-0281-3","volume":"4","author":"P.S. Oliveto","year":"2007","unstructured":"Oliveto, P.S., He, J., Yao, X.: Computational complexity analysis of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing\u00a04, 281\u2013293 (2007)","journal-title":"International Journal of Automation and Computing"},{"key":"9_CR2","volume-title":"Evolutionary Optimization","author":"I. Wegener","year":"2001","unstructured":"Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Sarker, R., Mohammadian, M., Yao, X. (eds.) Evolutionary Optimization. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"502","DOI":"10.2307\/1426671","volume":"13","author":"B. Hajek","year":"1982","unstructured":"Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability\u00a013, 502\u2013525 (1982)","journal-title":"Advances in Applied Probability"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J. He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence\u00a0127, 57\u201385 (2001)","journal-title":"Artificial Intelligence"},{"key":"9_CR5","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, 21\u201335 (2004)","journal-title":"Natural Computing"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-36494-3_37","volume-title":"STACS 2003","author":"O. Giel","year":"2003","unstructured":"Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 415\u2013426. Springer, Heidelberg (2003)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., He, J., Yao, X.: Evolutionary algorithms and the vertex cover problem. In: Proc. of CEC 2007, pp. 1430\u20131438 (2007)","DOI":"10.1109\/CEC.2007.4424701"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Oliveto, P.S., Sudholt, D., Witt, C.: Theoretical analysis of diversity mechanisms for global exploration. In: Proc. of GECCO 2008 (to appear, 2008)","DOI":"10.1145\/1389095.1389276"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Happ, E., Johannsen, D., Klein, C., Neumann, F.: Rigorous analyses of fitness-proportional selection for optimizing linear functions. In: Proc. of GECCO 2008 (to appear, 2008)","DOI":"10.1145\/1389095.1389277"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J. Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolutionary Computation\u00a07(2), 173\u2013203 (1999)","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN X"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87700-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T05:00:12Z","timestamp":1551589212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87700-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876991","9783540877004"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87700-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}