{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:49:15Z","timestamp":1761598155354,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030375980"},{"type":"electronic","value":"9783030375997"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37599-7_33","type":"book-chapter","created":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T09:02:43Z","timestamp":1578042163000},"page":"396-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Cartesian Genetic Programming with Guided and Single Active Mutations for Designing Combinational Logic Circuits"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Eduardo H.","family":"da Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas A. M.","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heder S.","family":"Bernardino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2821-6","volume-title":"Logic Minimization Algorithms for VLSI Synthesis","author":"RK Brayton","year":"1984","unstructured":"Brayton, R.K., Hachtel, G.D., McMullen, C., Sangiovanni-Vincentelli, A.: Logic Minimization Algorithms for VLSI Synthesis, vol. 2. Springer, Heidelberg (1984). \nhttps:\/\/doi.org\/10.1007\/978-1-4613-2821-6"},{"issue":"1","key":"33_CR2","first-page":"39","volume":"16","author":"CAC Coello","year":"2002","unstructured":"Coello, C.A.C., Aguirre, A.H.: Design of combinational logic circuits through an evolutionary multiobjective optimization approach. AI EDAM 16(1), 39\u201353 (2002)","journal-title":"AI EDAM"},{"key":"33_CR3","unstructured":"Coello, C.A.C., Alba, E., Luque, G.: Comparing different serial and parallel heuristics to design combinational logic circuits. In: Proceedings of the NASA\/DoD Conference on Evolvable Hardware, pp. 3\u201312 (2003)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-36553-2_36","volume-title":"Evolvable Systems: From Biology to Hardware","author":"CAC Coello","year":"2003","unstructured":"Coello, C.A.C., Luna, E.H., Aguirre, A.H.: Use of particle swarm optimization to design combinational logic circuits. In: Tyrrell, A.A.M., Haddow, P.C., Torresen, J. (eds.) ICES 2003. LNCS, vol. 2606, pp. 398\u2013409. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36553-2_36"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-37207-0_6","volume-title":"Genetic Programming","author":"BW Goldman","year":"2013","unstructured":"Goldman, B.W., Punch, W.F.: Reducing wasted evaluations in cartesian genetic programming. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.\u015e., Hu, B. (eds.) EuroGP 2013. LNCS, vol. 7831, pp. 61\u201372. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-37207-0_6"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-77553-1_13","volume-title":"Genetic Programming","author":"J Husa","year":"2018","unstructured":"Husa, J., Kalkreuth, R.: A comparative study on crossover in cartesian genetic programming. In: Castelli, M., Sekanina, L., Zhang, M., Cagnoni, S., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2018. LNCS, vol. 10781, pp. 203\u2013219. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-77553-1_13"},{"key":"33_CR7","volume-title":"Genetic Programming II, Automatic Discovery of Reusable Subprograms","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming II, Automatic Discovery of Reusable Subprograms. MIT Press, Cambridge (1992)"},{"key":"33_CR8","unstructured":"Lind-Nielsen, J., Cohen, H.: Buddy - a binary decision diagram package (2014). \nhttps:\/\/sourceforge.net\/projects\/buddy\/"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/978-3-319-45823-6_62","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"FAL Manfrini","year":"2016","unstructured":"Manfrini, F.A.L., Bernardino, H.S., Barbosa, H.J.C.: A novel efficient mutation for evolutionary design of combinational logic circuits. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 665\u2013674. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-45823-6_62"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Manfrini, F.A.L., Bernardino, H.S., Barbosa, H.J.C.: On heuristics for seeding the initial population of cartesian genetic programming applied to combinational logic circuits. In: Proceedings of GECCO, pp. 105\u2013106 (2016)","DOI":"10.1145\/2908961.2909031"},{"key":"33_CR11","unstructured":"Miller, J.F.: An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation, vol. 2, pp. 1135\u20131142. Morgan Kaufmann Pub. Inc. (1999)"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-17310-3_2","volume-title":"Cartesian Genetic Programming","author":"JF Miller","year":"2011","unstructured":"Miller, J.F.: Cartesian genetic programming. In: Miller, J. (ed.) Cartesian Genetic Programming, pp. 17\u201334. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17310-3_2"},{"issue":"1\u20132","key":"33_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1010016313373","volume":"1","author":"JF Miller","year":"2000","unstructured":"Miller, J.F., Job, D., Vassilev, V.K.: Principles in the evolutionary design of digital circuits - Part I. Genet. Program Evolvable Mach. 1(1\u20132), 7\u201335 (2000)","journal-title":"Genet. Program Evolvable Mach."},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"da Silva, J.E., Bernardino, H.: Cartesian genetic programming with crossover for designing combinational logic circuits. In: Proceedings of the 7th Brazilian Conference on Intelligent Systems (BRACIS), pp. 145\u2013150. IEEE (2018)","DOI":"10.1109\/BRACIS.2018.00033"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"da Silva, J.E.H., Manfrini, F.A., Bernardino, H.S., Barbosa, H.J.: Biased mutation and tournament selection approaches for designing combinational logic circuits via cartesian genetic programming. In: ENIAC, pp. 835\u2013846 (2018)","DOI":"10.5753\/eniac.2018.4471"},{"key":"33_CR16","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67997-6","volume-title":"Inspired by Nature: Essays Presented to Julian F. Miller on the Occasion of his 60th Birthday","year":"2018","unstructured":"Stepney, S., Adamatzky, A. (eds.): Inspired by Nature: Essays Presented to Julian F. Miller on the Occasion of his 60th Birthday. ECC, vol. 28. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67997-6"},{"issue":"4","key":"33_CR17","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10710-015-9244-6","volume":"16","author":"AJ Turner","year":"2015","unstructured":"Turner, A.J., Miller, J.F.: Neutral genetic drift: an investigation using cartesian genetic programming. GP Evolvable Mach. 16(4), 531\u2013558 (2015)","journal-title":"GP Evolvable Mach."},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-16501-1_12","volume-title":"Genetic Programming","author":"Z Vasicek","year":"2015","unstructured":"Vasicek, Z.: Cartesian GP in optimization of combinational circuits with hundreds of inputs and thousands of gates. In: Machado, P., et al. (eds.) EuroGP 2015. LNCS, vol. 9025, pp. 139\u2013150. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-16501-1_12"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Vasicek, Z., Sekanina, L.: How to evolve complex combinational circuits from scratch? In: Proceedings of the Conference on Evolvable Systems (ICES), pp. 133\u2013140. IEEE (2014)","DOI":"10.1109\/ICES.2014.7008732"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37599-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T10:12:43Z","timestamp":1578046363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37599-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030375980","9783030375997"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37599-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siena","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2019.icas.xyz\/","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":"158","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":"64","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":"0","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":"41% - 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":"5","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)"}}]}}