{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:05:00Z","timestamp":1725660300905},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,8]]},"DOI":"10.1145\/1570256.1570320","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T09:32:17Z","timestamp":1248168737000},"page":"2295-2302","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A stigmergy-based algorithm for black-box optimization"],"prefix":"10.1145","author":[{"given":"Peter","family":"Koro\u0161ec","sequence":"first","affiliation":[{"name":"Jozef Stefan Institute, Ljubljana, Slovenia"}]},{"given":"Jurij","family":"\u0160ilc","sequence":"additional","affiliation":[{"name":"Jozef Stefan Institute, Ljubljana, Slovenia"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-60469-3_22","volume-title":"Evolutionary Computing","author":"Bilchev G.","year":"1995","unstructured":"G. Bilchev and I. C. Parmee . The ant colony metaphor for searching continuous design spaces . In T. C. Fogarty, editor, Evolutionary Computing , volume 993 of Lecture Notes in Computer Science , pages 25 -- 39 , Sheeld , UK , April 3-4 1995 . G. Bilchev and I. C. Parmee. The ant colony metaphor for searching continuous design spaces. In T. C. Fogarty, editor, Evolutionary Computing, volume 993 of Lecture Notes in Computer Science, pages 25--39, Sheeld, UK, April 3-4 1995."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11740698_25"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760972767"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1689599.1689652"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"e_1_3_2_1_10_1","first-page":"205","volume-title":"Foundations of Genetic Algorithms - 1","author":"Wright A. H.","year":"1991","unstructured":"A. H. Wright . Genetic algorithms for real parameter optimization . In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms - 1 , pages 205 -- 218 , San Mateo, CA , 1991 . Morgan Kaufman . A. H. Wright. Genetic algorithms for real parameter optimization. In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms - 1, pages 205--218, San Mateo, CA, 1991. Morgan Kaufman."}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1570256.1570320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T06:00:04Z","timestamp":1672984804000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1570256.1570320"}},"subtitle":["noiseless function testbed"],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":7,"alternative-id":["10.1145\/1570256.1570320","10.1145\/1570256"],"URL":"https:\/\/doi.org\/10.1145\/1570256.1570320","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}