{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T22:32:44Z","timestamp":1726007564711},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921363"},{"type":"electronic","value":"9783540921370"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92137-0_73","type":"book-chapter","created":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T11:23:27Z","timestamp":1229081007000},"page":"669-679","source":"Crossref","is-referenced-by-count":1,"title":["About the Computation Time of Adaptive Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Lixin","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinghu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"73_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(99)00089-4","volume":"229","author":"A.E. Eiben","year":"1999","unstructured":"Eiben, A.E., Rudolph, G.: Theory of evolutionary algorithms: A bird\u2019s eye view. Theoretical Computer Science\u00a0229(1-2), 3\u20139 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"73_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1162\/evco.1996.4.2.195","volume":"4","author":"G. Rudolph","year":"1996","unstructured":"Rudolph, G.: How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation\u00a04(2), 194\u2013205 (1996)","journal-title":"Evolutionary Computation"},{"issue":"2","key":"73_CR3","doi-asserted-by":"publisher","first-page":"167","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), 167\u2013203 (1999)","journal-title":"Evolutionary Computation"},{"issue":"1","key":"73_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/4235.843492","volume":"4","author":"J. Garnier","year":"2000","unstructured":"Garnier, J., Kallel, L.: Statistical distribution of the convergence time of evolutionary algorithms for long path problems. IEEE Trans.on Evolutionary Computation\u00a04(1), 16\u201330 (2000)","journal-title":"IEEE Trans.on Evolutionary Computation"},{"issue":"2","key":"73_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1162\/evco.1998.6.2.185","volume":"6","author":"S. Droste","year":"1998","unstructured":"Droste, S., Jansen, T., Wegener, I.: A rigorous complexity analysis of the (1\u2009+\u20091) evolutionary algorithm for linear functions with Boolean inputs. Evolutionary Computation\u00a06(2), 185\u2013196 (1998)","journal-title":"Evolutionary Computation"},{"issue":"1-2","key":"73_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1\u2009+\u20091) evolutionary algorithms. Theoretical Computer Science\u00a0276(1-2), 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"73_CR7","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(1), 57\u201385 (2001)","journal-title":"Artificial Intelligence"},{"issue":"5","key":"73_CR8","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1109\/TEVC.2002.800886","volume":"6","author":"J. He","year":"2002","unstructured":"He, J., Yao, X.: From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Trans. on Evolutionary computation\u00a06(5), 495\u2013511 (2002)","journal-title":"IEEE Trans. on Evolutionary computation"},{"issue":"1-2","key":"73_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0004-3702(02)00381-8","volume":"145","author":"J. He","year":"2003","unstructured":"He, J., Yao, X.: Towards an analytic framework for analyzing the computation time of evolutionary algorithms. Artificial Intelligence\u00a0145(1-2), 59\u201397 (2003)","journal-title":"Artificial Intelligence"},{"key":"73_CR10","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"},{"issue":"4","key":"73_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1162\/evco.2007.15.4.435","volume":"15","author":"J. He","year":"2007","unstructured":"He, J., et al.: A note on problem difficulty measure in black-box optimization: Classification, existence and predictability. Evolutionary Computation\u00a015(4), 435\u2013443 (2007)","journal-title":"Evolutionary Computation"},{"issue":"3","key":"73_CR12","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.: Time complexity of evolutionary for combinatorial optimization: A decade of results. International J. of Automation and Computing\u00a04(3), 281\u2013293 (2007)","journal-title":"International J. of Automation and Computing"},{"issue":"1","key":"73_CR13","first-page":"51","volume":"14","author":"L.X. Ding","year":"2006","unstructured":"Ding, L.X., Yu, J.H.: Some analysis about the time complexity of evolutionary algorithms. Neural, Parallel & Scientific Computation\u00a014(1), 51\u201368 (2006)","journal-title":"Neural, Parallel & Scientific Computation"},{"key":"73_CR14","series-title":"LNAI","first-page":"156","volume-title":"Some theoretical results about the asymptotic behaviors of evolutionary algorithms","author":"L.X. Ding","year":"2007","unstructured":"Ding, L.X., Yu, J.H.: Some theoretical results about the asymptotic behaviors of evolutionary algorithms. LNCS (LNAI), vol.\u00a04456, pp. 156\u2013166. Springer, Heidelberg (2007)"},{"key":"73_CR15","volume-title":"Markov Chains and Stochastic Stability","author":"S.P. Meyn","year":"1996","unstructured":"Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability, 3rd edn. Springer, New York (1996)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Advances in Computation and Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92137-0_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T06:41:16Z","timestamp":1551681676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92137-0_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921363","9783540921370"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92137-0_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}