{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:48:50Z","timestamp":1743083330267,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030866525"},{"type":"electronic","value":"9783030866532"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86653-2_43","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T21:45:47Z","timestamp":1631223947000},"page":"592-608","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Composite Function for Understanding Bin-Packing Problem and Tabu Search: Towards Self-adaptive Algorithms"],"prefix":"10.1007","author":[{"given":"V.","family":"Landero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"R\u00edos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O. Joaqu\u00edn","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos Andr\u00e9s","family":"Collazos-Morales","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S1571-0653(04)00332-4","volume":"9","author":"M Lagoudakis","year":"2001","unstructured":"Lagoudakis, M., Littman, M.: Learning to select branching rules in the DPLL procedure for satisfiability. Electron. Notes Discrete Math. 9, 344\u2013359 (2001)","journal-title":"Electron. Notes Discrete Math."},{"key":"43_CR2","unstructured":"Chr, P., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity (1982)"},{"key":"43_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"43_CR4","first-page":"267","volume":"5","author":"L Rendell","year":"1990","unstructured":"Rendell, L., Cho, H.: Empirical learning as a function of concept character. Mach. Learn. 5, 267\u2013298 (1990)","journal-title":"Mach. Learn."},{"key":"43_CR5","volume-title":"Empirical Methods for Artificial Intelligence","author":"P Cohen","year":"1995","unstructured":"Cohen, P.: Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge (1995)"},{"issue":"1","key":"43_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R Barr","year":"1995","unstructured":"Barr, R., Golden, B., Kelly, J., Resende, M.: Designing and reporting on computational experiments with heuristic methods. J. Heuristics 1(1), 9\u201332 (1995)","journal-title":"J. Heuristics"},{"issue":"1","key":"43_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1996","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimizations. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1996)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"43_CR8","unstructured":"Frost, D., Dechter, R.: In search of the best constraint satisfaction search. In: Proceedings of the National Conference on Artificial Intelligence, Seattle, vol. 94, pp. 301\u2013306 (1994)"},{"key":"43_CR9","unstructured":"Tsang, E., Borrett, J., Kwan, A. An attempt to map the performance of a range of algorithm and heuristic combinations. In: Hallam, J., et al. (eds.) Hybrid Problems, Hybrid Solutions. Proceedings of AISB-95, vol. 27, pp. 203\u2013216. IOS Press, Amsterdam (1995)"},{"key":"43_CR10","unstructured":"Frost, D., Rish, I., Vila, L.: Summarizing CSP hardness with continuous probability distributions. In: Proceedings of the 14th National Conference on AI, American Association for Artificial Intelligence, pp. 327\u2013333 (1997)"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00170-012-4571-8","volume":"67","author":"R Vanchipura","year":"2013","unstructured":"Vanchipura, R., Sridharan, R.: Development and analysis of constructive heuristic algorithms for flow shop scheduling problems with sequence-dependent setup times. Int. J. Adv. Manufact. Technol. 67, 1337\u20131353 (2013)","journal-title":"Int. J. Adv. Manufact. Technol."},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J Rice","year":"1976","unstructured":"Rice, J.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"issue":"1","key":"43_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1456650.1456656","volume":"41","author":"K Smith-Miles","year":"2009","unstructured":"Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 1\u201325 (2009)","journal-title":"ACM Comput. Surv."},{"key":"43_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-46135-3_37","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"K Leyton-Brown","year":"2002","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: the case of combinatorial auctions. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 556\u2013572. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_37"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Silverthorn, B., Miikkulainen, R.: Latent class models for algorithm portfolio methods. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, Georgia, USA (2010)","DOI":"10.1609\/aaai.v24i1.7546"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Yuen, S., Zhang, X.: Multiobjective evolutionary algorithm portfolio: choosing suitable algorithm for multiobjective optimization problem. In: 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, China, pp. 1967\u20131973 (2014)","DOI":"10.1109\/CEC.2014.6900470"},{"key":"43_CR17","unstructured":"Guerri, A., Milano, M.: Learning techniques for automatic algorithm portfolio selection. In: Proceedings of the 16th Biennial European Conference on Artificial Intelligence, Valencia, Spain, pp. 475\u2013479. IOS Press, Burke (2004)"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: Proceedings of the 25th National Conference on Artificial Intelligence (AAAI 2010), pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"5224","DOI":"10.1016\/j.eswa.2009.12.087","volume":"37","author":"R Pav\u00f3n","year":"2010","unstructured":"Pav\u00f3n, R., D\u00edaz, F., Laza, R., Luz\u00f3n, M.: Experimental evaluation of an automatic parameter setting system. Expert Syst. Appl. 37, 5224\u20135238 (2010)","journal-title":"Expert Syst. Appl."},{"key":"43_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.asoc.2014.01.032","volume":"18","author":"E Yeguas","year":"2014","unstructured":"Yeguas, E., Luz\u00f3n, M., Pav\u00f3n, R., Laza, R., Arroyo, G., D\u00edaz, F.: Automatic parameter tuning for evolutionary algorithms using a Bayesian case-based reasoning system. Appl. Soft Comput. 18, 185\u2013195 (2014)","journal-title":"Appl. Soft Comput."},{"key":"43_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24838-5_31","volume-title":"Experimental and Efficient Algorithms","author":"J P\u00e9rez","year":"2004","unstructured":"P\u00e9rez, J., Pazos, R.A., Frausto, J., Rodr\u00edguez, G., Romero, D., Cruz, L.: A statistical approach for algorithm selection. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 417\u2013431. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24838-5_31"},{"issue":"5","key":"43_CR22","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1057\/jors.2014.46","volume":"66","author":"J Ries","year":"2015","unstructured":"Ries, J., Beullens, P.: A semi-automated design of instance-based fuzzy parameter tuning for metaheuristics based on decision tree induction. J. Oper. Res. Soc. 66(5), 782\u2013793 (2015)","journal-title":"J. Oper. Res. Soc."},{"key":"43_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-13800-3_29","volume-title":"Learning and Intelligent Optimization","author":"K Smith-Miles","year":"2010","unstructured":"Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP difficulty by learning from evolved instances. In: Blum, C., Battiti, R. (eds.) LION 2010. LNCS, vol. 6073, pp. 266\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13800-3_29"},{"key":"43_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"issue":"5","key":"43_CR25","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/2594413.2594424","volume":"57","author":"K Leyton-Brown","year":"2014","unstructured":"Leyton-Brown, K., Hoos, H., Hutter, F., Xu, L.: Understanding the empirical hardness of NP-complete problems. Mag. Commun. ACM 57(5), 98\u2013107 (2014)","journal-title":"Mag. Commun. ACM"},{"issue":"1","key":"43_CR26","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TEVC.2014.2302006","volume":"19","author":"M Munoz","year":"2015","unstructured":"Munoz, M., Kirley, M., Halgamuge, S.: Exploratory landscape analysis of continuous space optimization problems using information content. IEEE Trans. Evol. Comput. 19(1), 74\u201387 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"43_CR27","doi-asserted-by":"publisher","first-page":"257","DOI":"10.3233\/AIC-2012-0533","volume":"25","author":"L Kottho","year":"2012","unstructured":"Kottho, L., Gent, I.P., Miguel, I.: An evaluation of machine learning in algorithm selection for search problems. AI Commun. 25(3), 257\u2013270 (2012)","journal-title":"AI Commun."},{"key":"43_CR28","doi-asserted-by":"crossref","unstructured":"Lopez, T.T., Schaeer, E., Domiguez-Diaz, D., Dominguez-Carrillo, G.: Structural effects in algorithm performance: a framework and a case study on graph coloring. In: Computing Conference, 2017, pp. 101\u2013112. IEEE (2017)","DOI":"10.1109\/SAI.2017.8252088"},{"issue":"2","key":"43_CR29","first-page":"220","volume":"26","author":"H Fu","year":"2020","unstructured":"Fu, H., Xu, Y., Chen, S., Liu, J.: Improving WalkSAT for random 3-SAT problems. J. Univ. Comput. Sci. 26(2), 220\u2013243 (2020)","journal-title":"J. Univ. Comput. Sci."},{"issue":"3","key":"43_CR30","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TSMCB.2008.915539","volume":"38","author":"J Tavares","year":"2008","unstructured":"Tavares, J.: Multidimensional knapsack problem: a fitness landscape analysis. IEEE Trans. Syst. Man Cybern. Part B: Cynern. 38(3), 604\u2013616 (2008)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B: Cynern."},{"key":"43_CR31","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1613\/jair.1576","volume":"24","author":"J Watson","year":"2005","unstructured":"Watson, J., Darrell, W., Adele, E.: Linking search space structure, run-time dynamics, and problem difficulty: a step toward demystifying tabu search. J. Artif. Intell. Res. 24, 221\u2013261 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"43_CR32","doi-asserted-by":"publisher","unstructured":"Watson, J.: An introduction to fitness landscape analysis and cost models for local search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 599\u2013623. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_20","DOI":"10.1007\/978-1-4419-1665-5_20"},{"key":"43_CR33","unstructured":"Chevalier, R.: Balancing the effects of parameter settings on a genetic algorithm for multiple fault diagnosis. Artificial Intelligence, University of Georgia (2006)"},{"key":"43_CR34","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ins.2013.05.015","volume":"246","author":"A Cayci","year":"2013","unstructured":"Cayci, A., Menasalvas, E., Saygin, Y., Eibe, S.: Self-configuring data mining for ubiquitous computing. Inf. Sci. 246, 83\u201399 (2013)","journal-title":"Inf. Sci."},{"key":"43_CR35","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s12293-009-0016-9","volume":"1","author":"M Le","year":"2009","unstructured":"Le, M., Ong, Y., Jin, Y.: Lamarckian memetic algorithms: local optimum and connectivity structure analysis. Memetic Comput. 1, 175\u2013190 (2009)","journal-title":"Memetic Comput."},{"key":"43_CR36","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ins.2010.09.016","volume":"181","author":"E Montero","year":"2011","unstructured":"Montero, E., Riff, M.: On-the-fly calibrating strategies for evolutionary algorithms. Inf. Sci. 181, 552\u2013566 (2011)","journal-title":"Inf. Sci."},{"issue":"5B","key":"43_CR37","first-page":"72","volume":"16","author":"J P\u00e9rez","year":"2007","unstructured":"P\u00e9rez, J., Cruz, L., Landero, V.: Explaining performance of the threshold accepting algorithm for the bin packing problem: a causal approach. Pol. J. Environ. Stud. 16(5B), 72\u201376 (2007)","journal-title":"Pol. J. Environ. Stud."},{"key":"43_CR38","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1007\/978-3-540-69731-2_102","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2008","author":"J P\u00e9rez","year":"2008","unstructured":"P\u00e9rez, J., et al.: An application of causality for representing and providing formal explanations about the behavior of the threshold accepting algorithm. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2008. LNCS (LNAI), vol. 5097, pp. 1087\u20131098. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69731-2_102"},{"key":"43_CR39","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2014.10.010","volume":"55","author":"M Quiroz-Castellanos","year":"2015","unstructured":"Quiroz-Castellanos, M., Cruz-Reyes, L., Torres-Jimenez, J., G\u00f3mez, C., Huacuja, H.J.F., Alvim, A.C.: A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. Oper. Res. 55, 52\u201364 (2015)","journal-title":"Comput. Oper. Res."},{"key":"43_CR40","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.simpat.2011.12.006","volume":"22","author":"T Taghavi","year":"2012","unstructured":"Taghavi, T., Pimentel, A., Sabeghi, M.: VMODEX: a novel visualization tool for rapid analysis of heuristic-based multi-objective design space exploration of heterogeneous MPSoC architectures. Simul. Model. Pract. Theory 22, 166\u2013196 (2012)","journal-title":"Simul. Model. Pract. Theory"},{"key":"43_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-24289-3_13","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2019","author":"V Landero","year":"2019","unstructured":"Landero, V., P\u00e9rez, J., Cruz, L., Turrubiates, T., R\u00edos, D.: Effects in the algorithm performance from problem structure, searching behavior and temperature: a causal study case for threshold accepting and bin-packing. In: Misra, S., et al. (eds.) ICCSA 2019. LNCS, vol. 11619, pp. 152\u2013166. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24289-3_13"},{"key":"43_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-58799-4_11","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2020","author":"V Landero","year":"2020","unstructured":"Landero, V., R\u00edos, D., P\u00e9rez, J., Cruz, L., Collazos-Morales, C.: Characterizing and analyzing the relation between bin-packing problem and tabu search algorithm. In: Gervasi, O., et al. (eds.) ICCSA 2020. LNCS, vol. 12249, pp. 149\u2013164. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58799-4_11"},{"key":"43_CR43","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1754.001.0001","volume-title":"Causation, Prediction, and Search","author":"P Spirtes","year":"2001","unstructured":"Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction, and Search, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"43_CR44","unstructured":"Beasley, J.E.: OR-Library. Brunel University (2006). http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/binpackinfo.html"},{"key":"43_CR45","unstructured":"Scholl, A., Klein, R. (2003). http:\/\/www.wiwi.uni-jena.de\/Entscheidung\/binpp\/"},{"issue":"3","key":"43_CR46","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search - Part I, first comprehensive description of tabu search. ORSA-J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA-J. Comput."},{"key":"43_CR47","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K Fleszar","year":"2002","unstructured":"Fleszar, K., Hindi, K.S.: New heuristics for one-dimensional bin packing. Comput. Oper. Res. 29, 821\u2013839 (2002)","journal-title":"Comput. Oper. Res."},{"key":"43_CR48","unstructured":"Fayyad, U.M., Irani, K.B.: Multi-interval discretization of continuous-valued attributes for classification learning. In: IJCAI, pp. 1022\u20131029 (1993)"},{"key":"43_CR49","unstructured":"Merz, P., Freisleben, B.: Fitness landscapes and memetic algorithm design. In: New Ideas in Optimization, pp. 245\u2013260. McGraw-Hill Ltd., UK (1999)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86653-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T22:51:53Z","timestamp":1673218313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86653-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866525","9783030866532"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86653-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/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":"Customed version of CyberChair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1588","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":"18","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":"29% - 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":"8","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}