{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:52:08Z","timestamp":1780635128315,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Bundesministerium f\u00fcr Bildung und Forschung","award":["03FH012PX5"],"award-info":[{"award-number":["03FH012PX5"]}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["637972"],"award-info":[{"award-number":["637972"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3319619.3321897","type":"proceedings-article","created":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T12:10:59Z","timestamp":1562760659000},"page":"115-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Are quality diversity algorithms better at generating stepping stones than objective-based search?"],"prefix":"10.1145","author":[{"given":"Adam","family":"Gaier","sequence":"first","affiliation":[{"name":"Bonn-Rhein-Sieg University of Applied Sciences and Inria \/ CNRS \/ Universit\u00e9 de Lorraine"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Asteroth","sequence":"additional","affiliation":[{"name":"Bonn-Rhein-Sieg University of Applied Sciences, Sankt Augustin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Baptiste","family":"Mouret","sequence":"additional","affiliation":[{"name":"Inria \/ CNRS \/ Universit\u00e9 de Lorraine, Nancy, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Robots that can adapt like animals. Nature","author":"Cully A","year":"2015","unstructured":"A Cully , J Chine , D Tarapore , and J-B Mouret . 2015. Robots that can adapt like animals. Nature ( 2015 ). A Cully, J Chine, D Tarapore, and J-B Mouret. 2015. Robots that can adapt like animals. Nature (2015)."},{"key":"e_1_3_2_1_2_1","volume-title":"Quality and diversity optimization: A unifying modular framework","author":"Cully A","year":"2018","unstructured":"A Cully and Y Demiris . 2018. Quality and diversity optimization: A unifying modular framework . IEEE Trans. on Evolutionary Computation ( 2018 ). A Cully and Y Demiris. 2018. Quality and diversity optimization: A unifying modular framework. IEEE Trans. on Evolutionary Computation (2018)."},{"key":"e_1_3_2_1_3_1","volume-title":"Reducing the dimensionality of data with neural networks. Science","author":"Hinton G","year":"2006","unstructured":"G Hinton and R Salakhutdinov . 2006. Reducing the dimensionality of data with neural networks. Science ( 2006 ). G Hinton and R Salakhutdinov. 2006. Reducing the dimensionality of data with neural networks. Science (2006)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00025"},{"key":"e_1_3_2_1_5_1","volume":"201","author":"Mouret J-B","unstructured":"J-B Mouret and J Clune. 201 5. Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909 (2015). J-B Mouret and J Clune. 2015. Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909 (2015).","journal-title":"J Clune."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1357054.1357328"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-007-9028-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602320169811"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001707"}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319619.3321897","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319619.3321897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:34Z","timestamp":1750204474000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319619.3321897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":9,"alternative-id":["10.1145\/3319619.3321897","10.1145\/3319619"],"URL":"https:\/\/doi.org\/10.1145\/3319619.3321897","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}