{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:39Z","timestamp":1750306959843,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":4,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,6]],"date-time":"2013-07-06T00:00:00Z","timestamp":1373068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,6]]},"DOI":"10.1145\/2464576.2464604","type":"proceedings-article","created":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T13:26:51Z","timestamp":1374672411000},"page":"47-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Comparing coevolution, genetic algorithms, and hill-climbers for finding real-time strategy game plans"],"prefix":"10.1145","author":[{"given":"Christopher","family":"Ballinger","sequence":"first","affiliation":[{"name":"University of Nevada, Reno, Reno, NV, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushil","family":"Louis","sequence":"additional","affiliation":[{"name":"University of Nevada, Reno, Reno, NV, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"265","volume-title":"Foundations of Genetic Algorithms","author":"Eshelman L. J.","year":"1991","unstructured":"L. J. Eshelman . The chc adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination . Foundations of Genetic Algorithms , pages 265 -- 283 , 1991 . L. J. Eshelman. The chc adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. Foundations of Genetic Algorithms, pages 265--283, 1991."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-009-9261-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.1.1"},{"key":"e_1_3_2_1_4_1","volume-title":"Ga-easy does not imply steepest-ascent optimizable","author":"Wilson S. W.","year":"1991","unstructured":"S. W. Wilson . Ga-easy does not imply steepest-ascent optimizable , 1991 . S. W. Wilson. Ga-easy does not imply steepest-ascent optimizable, 1991."}],"event":{"name":"GECCO '13: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Amsterdam The Netherlands","acronym":"GECCO '13"},"container-title":["Proceedings of the 15th annual conference companion on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464576.2464604","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2464576.2464604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464576.2464604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,6]]},"references-count":4,"alternative-id":["10.1145\/2464576.2464604","10.1145\/2464576"],"URL":"https:\/\/doi.org\/10.1145\/2464576.2464604","relation":{},"subject":[],"published":{"date-parts":[[2013,7,6]]},"assertion":[{"value":"2013-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}