{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:37Z","timestamp":1760202817247,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"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":[[2019,8,27]]},"DOI":"10.1145\/3299904.3340305","type":"proceedings-article","created":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:43:29Z","timestamp":1566243809000},"page":"34-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["The benefits and limitations of voting mechanisms in evolutionary optimisation"],"prefix":"10.1145","author":[{"given":"Jonathan E.","family":"Rowe","sequence":"first","affiliation":[{"name":"University of Birmingham, Birmingham, UK"}]},{"family":"Aishwaryaprajna","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, UK"}]}],"member":"320","published-online":{"date-parts":[[2019,8,27]]},"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":"publisher","DOI":"10.1145\/1527125.1527135"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725508"},{"volume-title":"Proc. Intl. Conf. Genetic Algorithm","year":"1991","author":"Davis Lawrence","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00055"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908884"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2613739"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797971"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.3.303"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725498"},{"key":"e_1_3_2_1_11_1","first-page":"30","article-title":"Good lower and upper bounds on binomial coefficients","volume":"2","author":"Stanica Pantelimon","year":"2001","journal-title":"Journal of Inequalities in Pure and Applied Mathematics"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02056921"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99259-4_5"}],"event":{"name":"FOGA '19: Foundations of Genetic Algorithms XV","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Potsdam Germany","acronym":"FOGA '19"},"container-title":["Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299904.3340305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299904.3340305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:39Z","timestamp":1750204419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299904.3340305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":13,"alternative-id":["10.1145\/3299904.3340305","10.1145\/3299904"],"URL":"https:\/\/doi.org\/10.1145\/3299904.3340305","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2019-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}