{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:19:38Z","timestamp":1769923178051,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":11,"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":"Austrian Science Fund FWF","award":["P29651-N32"],"award-info":[{"award-number":["P29651-N32"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1145\/3071178.3079195","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"689-696","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Analysis of the pcCMSA-ES on the noisy ellipsoid model"],"prefix":"10.1145","author":[{"given":"Hans-Georg","family":"Beyer","sequence":"first","affiliation":[{"name":"Vorarlberg University of Applied Sciences, Dornbirn, Austria"}]},{"given":"Michael","family":"Hellwig","sequence":"additional","affiliation":[{"name":"Vorarlberg University of Applied Sciences, Dornbirn, Austria"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Noisy optimization with evolution strategies","author":"Arnold Dirk V.","unstructured":"Dirk V. Arnold . 2002. Noisy optimization with evolution strategies . Kluwer Academic Publishers . Dirk V. Arnold. 2002. Noisy optimization with evolution strategies. Kluwer Academic Publishers."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725500"},{"key":"e_1_3_2_1_3_1","volume-title":"The Theory of Evolution Strategies","author":"Beyer H.-G.","unstructured":"H.-G. Beyer . 2001. The Theory of Evolution Strategies . Springer . H.-G. Beyer. 2001. The Theory of Evolution Strategies. Springer."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-005-7617-y"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2283968"},{"key":"e_1_3_2_1_6_1","first-page":"123","article-title":"Covariance Matrix Adaptation Revisited - The CMSA Evolution Strategy. In Parallel Problem Solving from Nature - PPSN X, G. Rudolph et al. (Eds.)","author":"Beyer H.-G.","year":"2008","unstructured":"H.-G. Beyer and B. Sendhoff . 2008 . Covariance Matrix Adaptation Revisited - The CMSA Evolution Strategy. In Parallel Problem Solving from Nature - PPSN X, G. Rudolph et al. (Eds.) . LNCS 5199 , Spring er, 123 -- 132 . H.-G. Beyer and B. Sendhoff. 2008. Covariance Matrix Adaptation Revisited - The CMSA Evolution Strategy. In Parallel Problem Solving from Nature - PPSN X, G. Rudolph et al. (Eds.). LNCS 5199, Springer, 123--132.","journal-title":"LNCS 5199"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2006.14.3.255"},{"key":"e_1_3_2_1_8_1","volume-title":"Parallel Problems Solving from Nature - PPSN XIV, J. Handl et al. (Eds.). LNCS 9921","author":"Hellwig M.","unstructured":"M. Hellwig and H.-G. Beyer . 2016. Evolution under Strong Noise: A Self-Adaptive Evolution Strategy Can Reach the Lower Performance Bound - the pcCMSA-ES . In Parallel Problems Solving from Nature - PPSN XIV, J. Handl et al. (Eds.). LNCS 9921 , Springer , 26--37. M. Hellwig and H.-G. Beyer. 2016. Evolution under Strong Noise: A Self-Adaptive Evolution Strategy Can Reach the Lower Performance Bound - the pcCMSA-ES. In Parallel Problems Solving from Nature - PPSN XIV, J. Handl et al. (Eds.). LNCS 9921, Springer, 26--37."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.846356"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754800"},{"key":"e_1_3_2_1_11_1","volume-title":"COLT - The 26th Annual Conference on Learning Theory, NJ, USA. 3--24","author":"Shamir O.","year":"2013","unstructured":"O. Shamir . 2013 . On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization .. In COLT - The 26th Annual Conference on Learning Theory, NJ, USA. 3--24 . O. Shamir. 2013. On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization.. In COLT - The 26th Annual Conference on Learning Theory, NJ, USA. 3--24."}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","location":"Berlin Germany","acronym":"GECCO '17","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3079195","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3079195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:37:21Z","timestamp":1750217841000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3079195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":11,"alternative-id":["10.1145\/3071178.3079195","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3079195","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"}}]}}