{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:15Z","timestamp":1750306395523,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T00:00:00Z","timestamp":1436572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"BioISI - FCT\/MCTES\/PIDDAC Portugal","award":["UID\/MULTI\/04046\/2013"],"award-info":[{"award-number":["UID\/MULTI\/04046\/2013"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,11]]},"DOI":"10.1145\/2739480.2754780","type":"proceedings-article","created":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T19:38:55Z","timestamp":1436297935000},"page":"887-894","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Parasite Diversity in Symbiogenetic Multiset Genetic Algorithm"],"prefix":"10.1145","author":[{"given":"Ant\u00f3nio M.R.","family":"Manso","sequence":"first","affiliation":[{"name":"Faculdade de Ci\u00eancias da Universidade de Lisboa, Lisbon, Portugal"}]},{"given":"Lu\u00eds M.P.","family":"Correia","sequence":"additional","affiliation":[{"name":"Faculdade de Ci\u00eancias da Universidade de Lisboa, Lisbon, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2015,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12239-2_6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554882"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S000497270000650X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463471"},{"volume-title":"A multiset model of multi-species evolution to solve big deceptive problems, in eprint arXiv:1502.00839v1 {cs.NE}","year":"2015","author":"Correia L. M. P.","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.1597062"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(90)90077-3"},{"key":"e_1_3_2_1_8_1","first-page":"145","volume-title":"Proceedings of the International Conference on Artificial Evolution","author":"Dumeur R.","year":"1995"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00114722"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645301.648440"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1771390.1771524"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001858.2002093"},{"volume-title":"Deceptive Problem. Genet. Algorithms Simulated Annealing","year":"1987","author":"Goldberg D.E","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","first-page":"37","volume-title":"Parallel Problem Solving from Nature -- PPSN II","author":"Goldberg D.E.","year":"1992"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85451-7_66"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science 3103","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-540-24855-2_17","volume-title":"Upper bounds on the time and space complexity of optimizing additively separable functions, In Genetic and Evolutionary Computation -- GECCO2004 Part 2","author":"Streeter M. J.","year":"2004"}],"event":{"name":"GECCO '15: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Madrid Spain","acronym":"GECCO '15"},"container-title":["Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754780","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2739480.2754780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:20Z","timestamp":1750223240000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754780"}},"subtitle":["Optimization of Large Binary Problems"],"short-title":[],"issued":{"date-parts":[[2015,7,11]]},"references-count":16,"alternative-id":["10.1145\/2739480.2754780","10.1145\/2739480"],"URL":"https:\/\/doi.org\/10.1145\/2739480.2754780","relation":{},"subject":[],"published":{"date-parts":[[2015,7,11]]},"assertion":[{"value":"2015-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}