{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T01:15:38Z","timestamp":1730250938136,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/icmlc.2013.6890510","type":"proceedings-article","created":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T11:51:21Z","timestamp":1410349881000},"page":"469-475","source":"Crossref","is-referenced-by-count":0,"title":["A variant of Variable-Drift theorem for continuous (1+1)-Evolutionary Algorithm"],"prefix":"10.1109","author":[{"family":"Wei-Di Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Han Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Ji Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Hao-Xun Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-007-0281-3"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9585-3"},{"key":"2","volume":"1","author":"oliveto","year":"2012","journal-title":"Erratum Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation"},{"key":"1","first-page":"349l","article-title":"The choice of the offspring population size in the (1,\"-) EA","volume":"12","author":"sudholt","year":"2012","journal-title":"Proc of GECCO"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1108\/17563780910959893"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.12.030"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.06.002"},{"key":"5","article-title":"A new method for lower bounds on the running time of evolutionary algorithms","author":"sudholt","year":"2012","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"journal-title":"Random Combinatorial Structures and Random Ized Search Heuristics","year":"2010","author":"johannsen","key":"9"},{"journal-title":"A General Analysis of Evolutionary Algorithms for Hard and Easy Fitness Functions","year":"2012","author":"he","key":"8"}],"event":{"name":"2013 International Conference on Machine Learning and Cybernetics (ICMLC)","start":{"date-parts":[[2013,7,14]]},"location":"Tianjin","end":{"date-parts":[[2013,7,17]]}},"container-title":["2013 International Conference on Machine Learning and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6880948\/6890427\/06890510.pdf?arnumber=6890510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T16:58:30Z","timestamp":1519923510000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6890510\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icmlc.2013.6890510","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}