{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T09:34:11Z","timestamp":1748338451750,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031295720"},{"type":"electronic","value":"9783031295737"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-29573-7_10","type":"book-chapter","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T13:03:02Z","timestamp":1680008582000},"page":"149-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive Batch Size CGP: Improving Accuracy and\u00a0Runtime for\u00a0CGP Logic Optimization Flow"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2752-7331","authenticated-orcid":false,"given":"Bryan Martins","family":"Lima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4883-4007","authenticated-orcid":false,"given":"Naiara","family":"Sachetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2495-2287","authenticated-orcid":false,"given":"Augusto","family":"Berndt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1088-1000","authenticated-orcid":false,"given":"Cristina","family":"Meinhardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9020-2076","authenticated-orcid":false,"given":"Jonata Tyska","family":"Carvalho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"de Abreu, B.A., et al.: Fast logic optimization using decision trees. In: 2021 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1\u20135 (2021). https:\/\/doi.org\/10.1109\/ISCAS51556.2021.9401664","DOI":"10.1109\/ISCAS51556.2021.9401664"},{"issue":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s40031-019-00418-8","volume":"100","author":"HB Barua","year":"2019","unstructured":"Barua, H.B., Mondal, K.C.: Approximate computing: a survey of recent trends\u2014bringing greenness to computing and communication. J. Inst. Eng. (India): Series B 100(6), 619\u2013626 (2019). https:\/\/doi.org\/10.1007\/s40031-019-00418-8","journal-title":"J. Inst. Eng. (India): Series B"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Berndt, A., et al.: Accuracy and size trade-off of a cartesian genetic programming flow for logic optimization. In: Proceedings of the 34th Symposium on Integrated Circuits and Systems Design. SBCCI 2021 (2021). https:\/\/doi.org\/10.1109\/SBCCI53441.2021.9529968","DOI":"10.1109\/SBCCI53441.2021.9529968"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Berndt, A.A.S., et al.: A CGP-based logic flow: optimizing accuracy and size of approximate circuits. J. Integr. Circ. Syst. 17(1), 1\u201312 (2022). https:\/\/doi.org\/10.29292\/jics.v17i1.546","DOI":"10.29292\/jics.v17i1.546"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Brayton, R.K., Hachtel, G.D., Mcmullen, C.T., Sangiovanni-Vincentelli, A.L.: Logic Minimization Algorithms for VLSI Synthesis. Kluwer Int. Ser. Eng. Comput. Sci. 2, 1\u2013194 (1984). https:\/\/doi.org\/10.1007\/978-1-4613-2821-6","DOI":"10.1007\/978-1-4613-2821-6"},{"key":"10_CR6","series-title":"The Springer International Series in Engineering and Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-0817-5_1","volume-title":"Logic Synthesis and Verification","author":"O Coudert","year":"2002","unstructured":"Coudert, O., Sasao, T.: Two-level logic minimization. In: Hassoun, S., Sasao, T. (eds.) Logic Synthesis and Verification. SECS, vol. 654, pp. 1\u201327. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-0817-5_1"},{"issue":"6","key":"10_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng, L.: The MNIST database of handwritten digit images for machine learning research. IEEE Signal Process. Mag. 29(6), 141\u2013142 (2012). https:\/\/doi.org\/10.1109\/MSP.2012.2211477","journal-title":"IEEE Signal Process. Mag."},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: applying the 1\/5-th rule in discrete settings. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1335\u20131342 (2015). https:\/\/doi.org\/10.1145\/2739480.2754684","DOI":"10.1145\/2739480.2754684"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/TEVC.2014.2324539","volume":"19","author":"BW Goldman","year":"2014","unstructured":"Goldman, B.W., Punch, W.F.: Analysis of cartesian genetic programming\u2019s evolutionary mechanisms. IEEE Trans. Evol. Comput. 19(3), 359\u2013373 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Harding, S.: Evolution of image filters on graphics processor units using cartesian genetic programming. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), pp. 1921\u20131928. IEEE (2008)","DOI":"10.1109\/CEC.2008.4631051"},{"key":"10_CR11","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-1-4614-6846-2_3","volume-title":"Genetic programming theory and practice X","author":"S Harding","year":"2013","unstructured":"Harding, S., Leitner, J., Schmidhuber, J.: Cartesian genetic programming for image processing. In: Riolo, R., Vladislavleva, E., Ritchie, M., Moore, J. (eds.) Genetic programming theory and practice X. (GEVO), pp. 31\u201344. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6846-2_3"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Karnaugh, M.: The map method for synthesis of combinational logic circuits. Trans. Am. Inst. Electr. Eng. Part I: Commun. Electron. 72(5), 593\u2013599 (1953). https:\/\/doi.org\/10.1109\/TCE.1953.6371932","DOI":"10.1109\/TCE.1953.6371932"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.neucom.2013.04.005","volume":"121","author":"MM Khan","year":"2013","unstructured":"Khan, M.M., Ahmad, A.M., Khan, G.M., Miller, J.F.: Fast learning neural networks using cartesian genetic programming. Neurocomputing 121, 274\u2013289 (2013)","journal-title":"Neurocomputing"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Khan, M.M., Khan, G.M., Miller, J.F.: Evolution of neural networks using cartesian genetic programming. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5586547"},{"key":"10_CR15","unstructured":"Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)"},{"issue":"6","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3275518","volume":"51","author":"A Manazir","year":"2019","unstructured":"Manazir, A., Raza, K.: Recent developments in cartesian genetic programming and its variants. ACM Comput. Surv. (CSUR) 51(6), 1\u201329 (2019). https:\/\/doi.org\/10.1145\/3275518","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s12065-018-00197-z","volume":"12","author":"N Milano","year":"2019","unstructured":"Milano, N., Pagliuca, P., Nolfi, S.: Robustness, evolvability and phenotypic complexity: insights from evolving digital circuits. Evol. Intel. 12(1), 83\u201395 (2019). https:\/\/doi.org\/10.1007\/s12065-018-00197-z","journal-title":"Evol. Intel."},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10710-019-09360-6","volume":"21","author":"JF Miller","year":"2019","unstructured":"Miller, J.F.: Cartesian genetic programming: its status and future. Genet. Program Evolvable Mach. 21(1), 129\u2013168 (2019). https:\/\/doi.org\/10.1007\/s10710-019-09360-6","journal-title":"Genet. Program Evolvable Mach."},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Miyasaka, Y., Zhang, X., Yu, M., Yi, Q., Fujita, M.: Logic synthesis for generalization and learning addition. In: 2021 Design, Automation Test in Europe Conference Exhibition (DATE), pp. 1032\u20131037 (2021). https:\/\/doi.org\/10.23919\/DATE51398.2021.9474169","DOI":"10.23919\/DATE51398.2021.9474169"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1162\/EVCO_a_00190","volume":"24","author":"S Picek","year":"2016","unstructured":"Picek, S., Carlet, C., Guilley, S., Miller, J.F., Jakobovic, D.: Evolutionary algorithms for Boolean functions in diverse domains of cryptography. Evol. Comput. 24(4), 667\u2013694 (2016)","journal-title":"Evol. Comput."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.asoc.2015.10.066","volume":"40","author":"S Picek","year":"2016","unstructured":"Picek, S., Jakobovic, D., Miller, J.F., Batina, L., Cupic, M.: Cryptographic Boolean functions: one output, many design criteria. Appl. Soft Comput. 40, 635\u2013653 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"10_CR22","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1080\/00029890.1955.11988710","volume":"62","author":"WV Quine","year":"1955","unstructured":"Quine, W.V.: A way to simplify truth functions. Am. Math. Mon. 62(9), 627\u2013631 (1955). https:\/\/doi.org\/10.1080\/00029890.1955.11988710","journal-title":"Am. Math. Mon."},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Rai, S., et al.: Logic synthesis meets machine learning: trading exactness for generalization. In: 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE (2021). https:\/\/doi.org\/10.23919\/DATE51398.2021.9473972","DOI":"10.23919\/DATE51398.2021.9473972"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Riener, H., Haaswijk, W., Mishchenko, A., De Micheli, G., Soeken, M.: On-the-fly and DAG-aware: rewriting Boolean networks with exact synthesis. In: 2019 Design, Automation Test in Europe Conference Exhibition (DATE), pp. 1649\u20131654 (2019). https:\/\/doi.org\/10.23919\/DATE.2019.8715185","DOI":"10.23919\/DATE.2019.8715185"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Rudell, R.L., Sangiovanni-Vincentelli, A.: Multiple-valued minimization for PLA optimization. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 6(5), 727\u2013750 (1987). https:\/\/doi.org\/10.1109\/TCAD.1987.1270318","DOI":"10.1109\/TCAD.1987.1270318"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Scarabottolo, I., et al.: Approximate logic synthesis: a survey. In: Proceedings of the IEEE, pp. 1\u201319 (2020). https:\/\/doi.org\/10.1109\/JPROC.2020.3014430","DOI":"10.1109\/JPROC.2020.3014430"},{"key":"10_CR27","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-17310-3_6","volume-title":"Cartesian genetic programming","author":"L Sekanina","year":"2011","unstructured":"Sekanina, L., Harding, S.L., Banzhaf, W., Kowaliw, T.: Image processing and CGP. In: Miller, J. (ed.) Cartesian genetic programming. NCS, pp. 181\u2013215. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17310-3_6"},{"issue":"1","key":"10_CR28","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1162\/evco_a_00253","volume":"28","author":"M Suganuma","year":"2020","unstructured":"Suganuma, M., et al.: Evolution of deep convolutional neural networks using cartesian genetic programming. Evol. Comput. 28(1), 141\u2013163 (2020). https:\/\/doi.org\/10.1162\/evco_a_00253","journal-title":"Evol. Comput."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Venkataramani, S., Kozhikkottu, V., Sabne, A., Roy, K., Raghunathan, A.: Logic synthesis of approximate circuits. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 39, 2503\u20132515 (2019)","DOI":"10.1109\/TCAD.2019.2940680"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29573-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:03:14Z","timestamp":1710360194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29573-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031295720","9783031295737"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29573-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EuroGP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Genetic Programming (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/eurogp\/","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":"38","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":"14","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":"37% - 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":"2.95","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":"2.9","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)"}}]}}