{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:38:33Z","timestamp":1742960313133,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031569913"},{"type":"electronic","value":"9783031569920"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56992-0_22","type":"book-chapter","created":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:02:01Z","timestamp":1711670521000},"page":"342-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enough is Enough: Learning to\u00a0Stop in\u00a0Generative Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1801-158X","authenticated-orcid":false,"given":"Colin","family":"Roitt","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0880-4460","authenticated-orcid":false,"given":"Simon","family":"Hickinbotham","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8533-2404","authenticated-orcid":false,"given":"Andy M.","family":"Tyrrell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"22_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-39432-7_24","volume-title":"Advances in Artificial Life","author":"W Banzhaf","year":"2003","unstructured":"Banzhaf, W.: On the dynamics of an artificial regulatory network. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds.) ECAL 2003. LNCS, pp. 217\u2013227. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39432-7_24"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/978-94-011-5576-2_68","volume-title":"CAAD Futures 1997","author":"T Broughton","year":"1997","unstructured":"Broughton, T., Tan, A., Coates, P.S.: The use of genetic programming in exploring 3D design worlds. In: Junge, R. (ed.) CAAD futures 1997, pp. 885\u2013915. Springer, Dordrecht (1997). https:\/\/doi.org\/10.1007\/978-94-011-5576-2_68"},{"key":"22_CR3","unstructured":"Davidson, E.H.: Genomic Regulatory Systems. In Development and Evolution, Elsevier (2001)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Dawkins, R.: The evolution of evolvability. On growth, form and computers, pp. 239\u2013255 (2003)","DOI":"10.1016\/B978-012428765-5\/50046-3"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"22_CR6","first-page":"115","volume":"9","author":"K Deb","year":"1994","unstructured":"Deb, K., Agrawal, R.B., et al.: Simulated binary crossover for continuous search space. Complex Syst. 9, 115\u2013148 (1994)","journal-title":"Complex Syst."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Deb, K., Sindhya, K., Okabe, T.: Self-adaptive simulated binary crossover for real-parameter optimization. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1187\u20131194. GECCO 2007, Association for Computing Machinery, New York, NY, USA (2007)","DOI":"10.1145\/1276958.1277190"},{"key":"22_CR8","unstructured":"Eggenberger, P.: Evolving morphologies of simulated 3d organisms based on deferential gene expression. In: Harvey, I., Husbands, P. (eds.) Proceedings of the 4th European Conference on Artificial Life, pp. 205\u2013213. Springer (1997)"},{"key":"22_CR9","first-page":"2171","volume":"13","author":"FA Fortin","year":"2012","unstructured":"Fortin, F.A., De Rainville, F.M., Gardner, M.A., Parizeau, M., Gagn\u00e9, C.: DEAP: evolutionary algorithms made easy. J. Mach. Learn. Res. 13, 2171\u20132175 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Frazer, J.: Chapter 9 - creative design and the generative evolutionary paradigm. In: Bentley, P.J., Corne, D.W. (eds.) Creative Evolutionary Systems, pp. 253\u2013274. Morgan Kaufmann, San Francisco (2002)","DOI":"10.1016\/B978-155860673-9\/50047-1"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Hickinbotham, S., Dubey, R., Friel, I., Colligan, A., Price, M., Tyrrell, A.: Evolving design modifiers. In: 2022 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1052\u20131058 (2022)","DOI":"10.1109\/SSCI51031.2022.10022087"},{"issue":"8","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997)","journal-title":"Neural Comput."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Hornby, G.S., Lipson, H., Pollack, J.B.: Evolution of generative design systems for modular physical robots. In: Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), vol.\u00a04, pp. 4146\u20134151. IEEE (2001)","DOI":"10.1109\/ROBOT.2001.933266"},{"key":"22_CR14","unstructured":"Hornby, G.S., Pollack, J.B.: Body-brain co-evolution using l-systems as a generative encoding. In: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation, pp. 868\u2013875. GECCO\u201901, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2001)"},{"key":"22_CR15","unstructured":"Jozefowicz, R., Zaremba, W., Sutskever, I.: An empirical exploration of recurrent network architectures. In: Proceedings of the 32nd International Conference on International Conference on Machine Learning, vol. 37, pp. 2342\u20132350. ICML 2015, JMLR.org (2015)"},{"issue":"5","key":"22_CR16","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1038\/s41580-023-00592-0","volume":"24","author":"I Lohmann","year":"2023","unstructured":"Lohmann, I.: The birth of evo-devo. Nat. Rev. Mol. Cell Biol. 24(5), 311 (2023)","journal-title":"Nat. Rev. Mol. Cell Biol."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Ollion, C., Pinville, T., Doncieux, S.: With a little help from selection pressures: evolution of memory in robot controllers. In: Artificial Life 13. MIT press (2012)","DOI":"10.1162\/978-0-262-31050-5-ch054"},{"key":"22_CR18","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-03302-6_18","volume-title":"Computational Intelligence in Information Systems","author":"S Phon-Amnuaisuk","year":"2019","unstructured":"Phon-Amnuaisuk, S., Salleh, N.D.H.M., Woo, S.-L.: Pixel-based LSTM generative model. In: Omar, S., Haji Suhaili, W.S., Phon-Amnuaisuk, S. (eds.) CIIS 2018. AISC, vol. 888, pp. 203\u2013212. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-03302-6_18"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Potash, P., Romanov, A., Rumshisky, A.: GhostWriter: using an LSTM for automatic rap lyric generation. In: M\u00e0rquez, L., Callison-Burch, C., Su, J. (eds.) Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pp. 1919\u20131924. Association for Computational Linguistics, Lisbon, Portugal (2015)","DOI":"10.18653\/v1\/D15-1221"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Rawal, A., Miikkulainen, R.: Evolving deep LSTM-based memory networks using an information maximization objective. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016. ACM, New York, NY, USA (2016)","DOI":"10.1145\/2908812.2908941"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Rawal, A., Miikkulainen, R.: From nodes to networks: evolving recurrent neural networks (2018)","DOI":"10.1016\/B978-0-12-815480-9.00015-3"},{"issue":"3","key":"22_CR22","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1162\/EVCO_a_00030","volume":"19","author":"J Secretan","year":"2011","unstructured":"Secretan, J., et al.: Picbreeder: a case study in collaborative evolutionary exploration of design space. Evol. Comput. 19(3), 373\u2013403 (2011)","journal-title":"Evol. Comput."},{"issue":"5964","key":"22_CR23","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1126\/science.1177894","volume":"327","author":"A Tero","year":"2010","unstructured":"Tero, A., et al.: Rules for biologically inspired adaptive network design. Science 327(5964), 439\u2013442 (2010)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence in Music, Sound, Art and Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56992-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T06:49:18Z","timestamp":1731653358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56992-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031569913","9783031569920"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56992-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoMUSART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Intelligence in Music, Sound, Art and Design (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aberystwyth","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evomusart2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2024\/evomusart\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}