{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:54:07Z","timestamp":1742972047031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030588168"},{"type":"electronic","value":"9783030588175"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58817-5_65","type":"book-chapter","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T15:03:56Z","timestamp":1601391836000},"page":"923-938","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Ambidextrous Socio-Cultural Algorithms"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Lemus-Romani","sequence":"first","affiliation":[]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Gino","family":"Astorga","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]},{"given":"Kathleen","family":"Crawford","sequence":"additional","affiliation":[]},{"given":"Giancarla","family":"Foschino","sequence":"additional","affiliation":[]},{"given":"Agust\u00edn","family":"Salas-Fern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,30]]},"reference":[{"issue":"1","key":"65_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00521-016-2334-4","volume":"28","author":"S-A Ahmadi","year":"2017","unstructured":"Ahmadi, S.-A.: Human behavior-based optimization: a novel metaheuristic approach to solve complex optimization problems. Neural Comput. Appl. 28(1), 233\u2013244 (2017)","journal-title":"Neural Comput. Appl."},{"key":"65_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadi-Javid, A.: Anarchic society optimization: a human-inspired method. In: 2011 IEEE Congress of Evolutionary Computation (CEC), pp. 2586\u20132592. IEEE (2011)","DOI":"10.1109\/CEC.2011.5949940"},{"key":"65_CR3","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari, E., Lucas, C.: Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE Congress on Evolutionary Computation, pp. 4661\u20134667. IEEE (2007)","DOI":"10.1109\/CEC.2007.4425083"},{"issue":"2","key":"65_CR4","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"65_CR5","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. (CSUR) 35(3), 268\u2013308 (2003)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"65_CR6","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Astorga, G., Lemus-Romani, J., Misra, S., Rubio, J.-M.: An adaptive intelligent water drops algorithm for set covering problem. In: 2019 19th International Conference on Computational Science and Its Applications (ICCSA), pp. 39\u201345. IEEE (2019)","DOI":"10.1109\/ICCSA.2019.000-6"},{"key":"65_CR7","doi-asserted-by":"crossref","unstructured":"Crawford, B., et al.: A binary cat swarm optimization algorithm for the non-unicost set covering problem. Math. Probl. Eng. (2015)","DOI":"10.1155\/2015\/578541"},{"key":"65_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-030-21902-4_4","volume-title":"Social Computing and Social Media. Design, Human Behavior and Analytics","author":"B Crawford","year":"2019","unstructured":"Crawford, B., Soto, R., Cabrera, G., Salas-Fern\u00e1ndez, A., Paredes, F.: Using a social media inspired optimization algorithm to solve the set covering problem. In: Meiselwitz, G. (ed.) HCII 2019. LNCS, vol. 11578, pp. 43\u201352. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21902-4_4"},{"key":"65_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-319-07857-1_86","volume-title":"HCI International 2014 - Posters Extended Abstracts","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Using the bee colony optimization method to solve the weighted set covering problem. In: Stephanidis, C. (ed.) HCI 2014. CCIS, vol. 434, pp. 493\u2013497. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07857-1_86"},{"key":"65_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-319-07857-1_90","volume-title":"HCI International 2014 - Posters Extended Abstracts","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., de la Barra, C.L., Crawford, K., Paredes, F., Johnson, F.: A better understanding of the behaviour of metaheuristics: a psychological view. In: Stephanidis, C. (ed.) HCI 2014. CCIS, vol. 434, pp. 515\u2013518. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07857-1_90"},{"key":"65_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-15705-4_5","volume-title":"Intelligent Information and Database Systems","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Pe\u00f1a, C., Palma, W., Johnson, F., Paredes, F.: Solving the set covering problem with a shuffled frog leaping algorithm. In: Nguyen, N.T., Trawi\u0144ski, B., Kosala, R. (eds.) ACIIDS 2015. LNCS (LNAI), vol. 9012, pp. 41\u201350. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15705-4_5"},{"key":"65_CR12","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Su\u00e1rez, M.O., Paredes, F., Johnson, F.: Binary firefly algorithm for the set covering problem. In: 2014 9th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1\u20135. IEEE (2014)","DOI":"10.1109\/CISTI.2014.6877090"},{"issue":"1","key":"65_CR13","first-page":"167","volume":"1","author":"RB Duncan","year":"1976","unstructured":"Duncan, R.B.: The ambidextrous organization: designing dual structures for innovation. Manag. Organ. 1(1), 167\u2013188 (1976)","journal-title":"Manag. Organ."},{"issue":"3","key":"65_CR14","doi-asserted-by":"publisher","first-page":"591","DOI":"10.3233\/AIC-140652","volume":"28","author":"H Emami","year":"2015","unstructured":"Emami, H., Derakhshan, F.: Election algorithm: a new socio-politically inspired strategy. AI Commun. 28(3), 591\u2013603 (2015)","journal-title":"AI Commun."},{"key":"65_CR15","doi-asserted-by":"crossref","unstructured":"Hosseini, S., Al Khaled, A.: A survey on the imperialist competitive algorithm metaheuristic: implementation in engineering domain and directions for future research. Appl. Soft Comput. 24, 1078\u20131094 (2014)","DOI":"10.1016\/j.asoc.2014.08.024"},{"issue":"1","key":"65_CR16","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s00521-016-2379-4","volume":"28","author":"TT Huan","year":"2017","unstructured":"Huan, T.T., Kulkarni, A.J., Kanesan, J., Huang, C.J., Abraham, A.: Ideology algorithm: a socio-inspired optimization methodology. Neural Comput. Appl. 28(1), 845\u2013876 (2017)","journal-title":"Neural Comput. Appl."},{"key":"65_CR17","unstructured":"Karp, R.M.: Reducibility among combinatorial problems (1972). https:\/\/people.eecs.berkeley.edu\/~luca\/cs172\/karp.pdf"},{"key":"65_CR18","doi-asserted-by":"crossref","unstructured":"Kashan, A.H.: League championship algorithm: a new algorithm for numerical function optimization. In: 2009 International Conference of Soft Computing and Pattern Recognition, pp. 43\u201348. IEEE (2009)","DOI":"10.1109\/SoCPaR.2009.21"},{"key":"65_CR19","doi-asserted-by":"crossref","unstructured":"Kulkarni, A.J., Durugkar, I.P., Kumar, M.: Cohort intelligence: a self supervised learning behavior. In: 2013 IEEE International Conference on Systems, Man, and Cybernetics, pp. 1396\u20131400. IEEE (2013)","DOI":"10.1109\/SMC.2013.241"},{"key":"65_CR20","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-981-13-6569-0_12","volume-title":"Socio-cultural Inspired Metaheuristics","author":"M Kumar","year":"2019","unstructured":"Kumar, M., Kulkarni, A.J.: Socio-inspired optimization metaheuristics: a review. In: Kulkarni, A.J., Singh, P.K., Satapathy, S.C., Husseinzadeh Kashan, A., Tai, K. (eds.) Socio-cultural Inspired Metaheuristics. SCI, vol. 828, pp. 241\u2013265. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-13-6569-0_12"},{"key":"65_CR21","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.future.2017.10.052","volume":"81","author":"M Kumar","year":"2018","unstructured":"Kumar, M., Kulkarni, A.J., Satapathy, S.C.: Socio evolution & learning optimization algorithm: a socio-inspired optimization methodology. Future Gen. Comput. Syst. 81, 252\u2013272 (2018)","journal-title":"Future Gen. Comput. Syst."},{"issue":"4","key":"65_CR22","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/S1665-6423(13)71558-X","volume":"11","author":"H Kuo","year":"2013","unstructured":"Kuo, H., Lin, C.: Cultural evolution algorithm for global optimizations and its applications. J. Appl. Res. Technol. 11(4), 510\u2013522 (2013)","journal-title":"J. Appl. Res. Technol."},{"key":"65_CR23","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ins.2015.08.004","volume":"326","author":"Z-Z Liu","year":"2016","unstructured":"Liu, Z.-Z., Chu, D.-H., Song, C., Xue, X., Lu, B.-Y.: Social learning optimization (SLO) algorithm paradigm and its application in QoS-aware cloud service composition. Inf. Sci. 326, 315\u2013333 (2016)","journal-title":"Inf. Sci."},{"key":"65_CR24","unstructured":"Luque, A.G., Dorado, S.R., de F\u00e1tima Vieira Severiano, M., Burillo, F.J.: Fundamentos sociales del comportamiento humano. Editorial UOC (2013)"},{"issue":"1","key":"65_CR25","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1016\/j.procs.2010.04.153","volume":"1","author":"W Lv","year":"2010","unstructured":"Lv, W., He, C., Li, D., Cheng, S., Luo, S., Zhang, X.: Election campaign optimization algorithm. Procedia Comput. Sci. 1(1), 1377\u20131386 (2010)","journal-title":"Procedia Comput. Sci."},{"key":"65_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-642-13498-2_76","volume-title":"Advances in Swarm Intelligence","author":"W Lv","year":"2010","unstructured":"Lv, W., et al.: Verifying election campaign optimization algorithm by several benchmarking functions. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010. LNCS, vol. 6146, pp. 582\u2013587. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13498-2_76"},{"key":"65_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-319-46675-0_38","volume-title":"Neural Information Processing","author":"Z Lv","year":"2016","unstructured":"Lv, Z., Shen, F., Zhao, J., Zhu, T.: A swarm intelligence algorithm inspired by Twitter. In: Hirose, A., Ozawa, S., Doya, K., Ikeda, K., Lee, M., Liu, D. (eds.) ICONIP 2016. LNCS, vol. 9949, pp. 344\u2013351. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46675-0_38"},{"issue":"01","key":"65_CR28","doi-asserted-by":"publisher","first-page":"7","DOI":"10.4236\/ijis.2014.41002","volume":"4","author":"N Moosavian","year":"2013","unstructured":"Moosavian, N., Roodsari, B.K., et al.: Soccer league competition algorithm, a new method for solving systems of nonlinear equations. Int. J. Intell. Sci. 4(01), 7 (2013)","journal-title":"Int. J. Intell. Sci."},{"issue":"3","key":"65_CR29","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao, R.V., Savsani, V.J., Vakharia, D.: Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput.-Aided Des. 43(3), 303\u2013315 (2011)","journal-title":"Comput.-Aided Des."},{"issue":"4","key":"65_CR30","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/TEVC.2003.814902","volume":"7","author":"T Ray","year":"2003","unstructured":"Ray, T., Liew, K.-M.: Society and civilization: an optimization algorithm based on the simulation of social behavior. IEEE Trans. Evol. Comput. 7(4), 386\u2013396 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"65_CR31","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s40747-016-0022-8","volume":"2","author":"S Satapathy","year":"2016","unstructured":"Satapathy, S., Naik, A.: Social group optimization (SGO): a new population evolutionary optimization technique. Complex Intell. Syst. 2(3), 173\u2013203 (2016)","journal-title":"Complex Intell. Syst."},{"key":"65_CR32","doi-asserted-by":"publisher","first-page":"132228","DOI":"10.1109\/ACCESS.2019.2940012","volume":"7","author":"R Soto","year":"2019","unstructured":"Soto, R., Crawford, B., Gonz\u00e1lez, F., Vega, E., Castro, C., Paredes, F.: Solving the manufacturing cell design problem using human behavior-based algorithm supported by autonomous search. IEEE Access 7, 132228\u2013132239 (2019)","journal-title":"IEEE Access"},{"key":"65_CR33","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-18476-0_10","volume-title":"Artificial Intelligence Perspectives and Applications","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Mu\u00f1oz, A., Johnson, F., Paredes, F.: Pre-processing, repairing and transfer functions can help binary electromagnetism-like algorithms. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Artificial Intelligence Perspectives and Applications. AISC, vol. 347, pp. 89\u201397. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18476-0_10"},{"issue":"1","key":"65_CR34","first-page":"83","volume":"22","author":"A Sotoudeh-Anvari","year":"2018","unstructured":"Sotoudeh-Anvari, A., Hafezalkotob, A.: A bibliography of metaheuristics-review from 2009 to 2015. Int. J. Knowl.-Based Intell. Eng. Syst. 22(1), 83\u201395 (2018)","journal-title":"Int. J. Knowl.-Based Intell. Eng. Syst."},{"key":"65_CR35","doi-asserted-by":"crossref","unstructured":"Talbi, E.-G.: Metaheuristics: from Design to Implementation, Chapter 1.3, vol. 74. Wiley, Hoboken (2009)","DOI":"10.1002\/9780470496916"},{"key":"65_CR36","doi-asserted-by":"crossref","unstructured":"Tzanetos, A., Fister Jr., I., Dounias, G.: A comprehensive database of nature-inspired algorithms. In: Data in Brief, p. 105792 (2020)","DOI":"10.1016\/j.dib.2020.105792"},{"key":"65_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-030-24308-1_42","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2019","author":"S Valdivia","year":"2019","unstructured":"Valdivia, S., et al.: Bridges reinforcement through conversion of tied-arch using crow search algorithm. In: Misra, S., et al. (eds.) ICCSA 2019. LNCS, vol. 11623, pp. 525\u2013535. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24308-1_42"},{"key":"65_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-030-24308-1_10","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2019","author":"C V\u00e1squez","year":"2019","unstructured":"V\u00e1squez, C., et al.: Galactic swarm optimization applied to reinforcement of bridges by conversion in cable-stayed arch. In: Misra, S., et al. (eds.) ICCSA 2019. LNCS, vol. 11623, pp. 108\u2013119. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24308-1_10"},{"key":"65_CR39","doi-asserted-by":"crossref","unstructured":"Xu, J., Zhang, J.: Exploration-exploitation tradeoffs in metaheuristics: survey and analysis. In: Proceedings of the 33rd Chinese Control Conference, pp. 8633\u20138638. IEEE (2014)","DOI":"10.1109\/ChiCC.2014.6896450"},{"key":"65_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-20662-7_2","volume-title":"Experimental Algorithms","author":"X-S Yang","year":"2011","unstructured":"Yang, X.-S.: Metaheuristic optimization: algorithm analysis and open problems. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 21\u201332. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_2"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58817-5_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T15:01:52Z","timestamp":1619190112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58817-5_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030588168","9783030588175"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58817-5_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cagliari","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Cyber chair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1450","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":"466","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":"32","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":"32% - 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.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":"6","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)"}},{"value":"Conference was held virtually due to COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}