{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T09:24:20Z","timestamp":1759742660982,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Fundamental Research Funds for the Central Universities"},{"name":"CCF-Tencent Open Research Fund"},{"name":"NSFC","award":["61603367, 61672478"],"award-info":[{"award-number":["61603367, 61672478"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1145\/3071178.3071347","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"1399-1406","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise"],"prefix":"10.1145","author":[{"given":"Chao","family":"Qian","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Bian","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu","family":"Jiang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Tang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.04.008"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"A. Auger and B. Doerr. 2011. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Singapore.   A. Auger and B. Doerr. 2011. Theory of Randomized Search Heuristics: Foundations and Recent Developments . World Scientific Singapore.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-008-9098-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725508"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330167"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_107"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"T. Friedrich T. K\u00f6tzing M. Krejca and A. Sutton. 2016. The compact genetic algorithm is efficient under extreme Gaussian noise. IEEE Transactions on Evolutionary Computation (2016) in press.  T. Friedrich T. K\u00f6tzing M. Krejca and A. Sutton. 2016. The compact genetic algorithm is efficient under extreme Gaussian noise. IEEE Transactions on Evolutionary Computation (2016) in press.","DOI":"10.1109\/TEVC.2016.2613739"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00178"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3040718.3040723"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0072-0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.846356"},{"volume-title":"Combinatorial Optimization: Algorithms and Their Computational Complexity","year":"2010","author":"Neumann F.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9387-z"},{"volume-title":"Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. CORR abs\/1211.7184","year":"2012","author":"Oliveto P.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725498"},{"key":"e_1_3_2_1_18_1","unstructured":"C. Qian Y. Yu K. Tang Y. Jin X. Yao and Z.-H. Zhou. 2016. On the effectiveness of sampling for evolutionary optimization in noisy environments. Evolutionary Computation (2016) in press.  C. Qian Y. Yu K. Tang Y. Jin X. Yao and Z.-H. Zhou. 2016. On the effectiveness of sampling for evolutionary optimization in noisy environments. Evolutionary Computation (2016) in press."},{"key":"e_1_3_2_1_19_1","unstructured":"C. Qian Y. Yu and Z.-H. Zhou. 2015. Analyzing evolutionary optimization in noisy environments. Evolutionary Computation (2015) in press.  C. Qian Y. Yu and Z.-H. Zhou. 2015. Analyzing evolutionary optimization in noisy environments. Evolutionary Computation (2015) in press."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Berlin Germany","acronym":"GECCO '17"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071347","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:05Z","timestamp":1750217405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":20,"alternative-id":["10.1145\/3071178.3071347","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071347","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"2017-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}