{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:31:18Z","timestamp":1742945478048,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030880804"},{"type":"electronic","value":"9783030880811"}],"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-88081-1_23","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:07:08Z","timestamp":1632913628000},"page":"304-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["New Extensions of Reproduction Operators In solving LABS Problem Using EMAS Meta-Heuristic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8947-6272","authenticated-orcid":false,"given":"Sylwia","family":"Bie\u0142aszek","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7062-261X","authenticated-orcid":false,"given":"Kamil","family":"Pi\u0119tak","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8459-1877","authenticated-orcid":false,"given":"Marek","family":"Kisiel-Dorohinicki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Bartholomew-Biggs, M.: The Steepest Descent Method, pp. 1\u20138. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-78723-7_7","DOI":"10.1007\/978-0-387-78723-7_7"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1051\/jphys:01987004804055900","volume":"48","author":"J Bernasconi","year":"1987","unstructured":"Bernasconi, J.: Low autocorrelation binary sequences: statistical mechanics and configuration space analysis. J. de Physique 48, 559\u2013567 (1987)","journal-title":"J. de Physique"},{"key":"23_CR3","unstructured":"Bo\u0161kovi\u0107, B., Brglez, F., Brest, J.: Low-autocorrelation binary sequences: on improved merit factors and runtime predictions to achieve them. arXiv e-prints arXiv:1406.5301 (2014)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"4127","DOI":"10.1109\/ACCESS.2018.2789916","volume":"6","author":"J Brest","year":"2018","unstructured":"Brest, J., Bo\u0161kovi\u0107, B.: A heuristic algorithm for a low autocorrelation binary sequence problem with odd length and high merit factor. IEEE Access 6, 4127\u20134134 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2789916","journal-title":"IEEE Access"},{"key":"23_CR5","unstructured":"Brest, J., Bo\u0161kovi\u0107, B.: In searching of long skew-symmetric binary sequences with high merit factors (2020)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-3-642-01973-9_96","volume-title":"Computational Science \u2013 ICCS 2009","author":"A Byrski","year":"2009","unstructured":"Byrski, A., Kisiel-Dorohinicki, M.: Agent-based model and computing environment facilitating the development of distributed computational intelligence systems. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009. LNCS, vol. 5545, pp. 865\u2013874. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01973-9_96"},{"key":"23_CR7","unstructured":"Cetnarowicz, K., Kisiel-Dorohinicki, M., Nawarecki, E.: The application of evolution process in multi-agent world (MAW) to the prediction system. In: Proceedings of 2nd International Conference on Multi-Agent Systems (ICMAS 1996). AAAI Press (1996)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Gallardo, J.E., Cotta, C., Fernandez, A.J.: A memetic algorithm for the low autocorrelation binary sequence problem. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007 pp. 1226\u20131233. ACM, New York (2007)","DOI":"10.1145\/1276958.1277195"},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1016\/j.asoc.2009.03.005","volume":"9","author":"JE Gallardo","year":"2009","unstructured":"Gallardo, J.E., Cotta, C., Fern\u00e1ndez, A.J.: Finding low autocorrelation binary sequences with memetic algorithms. Appl. Soft Comput. 9(4), 1252\u20131262 (2009)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TIT.1977.1055653","volume":"23","author":"M Golay","year":"1977","unstructured":"Golay, M.: Sieves for low autocorrelation binary sequences. IEEE Trans. Inf. Theory 23(1), 43\u201351 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TIT.1982.1056505","volume":"28","author":"M Golay","year":"1982","unstructured":"Golay, M.: The merit factor of long low autocorrelation binary sequences (corresp.). IEEE Trans. Inf. Theory 28(3), 543\u2013549 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, C., Schmidt, K.U.: Merit factors of polynomials derived from difference sets (2016)","DOI":"10.1016\/j.jcta.2016.08.006"},{"issue":"4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.jcta.2013.01.010","volume":"120","author":"J Jedwab","year":"2013","unstructured":"Jedwab, J., Katz, D.J., Schmidt, K.U.: Advances in the merit factor problem for binary sequences. J. Comb. Theory Ser. A 120(4), 882\u2013906 (2013)","journal-title":"J. Comb. Theory Ser. A"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Kolybacz, M., Kowol, M., Lesniak, L., Byrski, A., Kisiel-Dorohinicki, M.: Efficiency of memetic and evolutionary computing in combinatorial optimisation. In: Rekdalsbakken, W., Bye, R.T., Zhang, H. (eds.) ECMS, pp. 525\u2013531. European Council for Modeling and Simulation (2013)","DOI":"10.7148\/2013-0525"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1016\/j.procs.2017.05.173","volume":"108","author":"M Kowol","year":"2017","unstructured":"Kowol, M., et al.: Agent-based evolutionary and memetic black-box discrete optimization. Procedia Comput. Sci. 108, 907\u2013916 (2017)","journal-title":"Procedia Comput. Sci."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1016\/j.procs.2014.05.093","volume":"29","author":"M Kowol","year":"2014","unstructured":"Kowol, M., Byrski, A., Kisiel-Dorohinicki, M.: Agent-based evolutionary computing for difficult discrete problems. Procedia Comput. Sci. 29, 1039\u20131047 (2014)","journal-title":"Procedia Comput. Sci."},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"01200","DOI":"10.1088\/1742-6596\/613\/1\/012006","volume":"613","author":"AN Leukhin","year":"2015","unstructured":"Leukhin, A.N., Potekhin, E.N.: A bernasconi model for constructing ground-state spin systems and optimal binary sequences. J. Phys. Conf. Ser. 613, 01200 (2015)","journal-title":"J. Phys. Conf. Ser."},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/4235.728212","volume":"2","author":"B Militzer","year":"1998","unstructured":"Militzer, B., Zamparelli, M., Beule, D.: Evolutionary search for low autocorrelated binary sequences. IEEE Trans. Evol. Comput 2(1), 34\u201339 (1998)","journal-title":"IEEE Trans. Evol. Comput"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jocs.2019.01.007","volume":"31","author":"K Pietak","year":"2019","unstructured":"Pietak, K., Zurek, D., Pietron, M., Dymara, A., Kisiel-Dorohinicki, M.: Striving for performance of discrete optimisation via memetic agent-based systems in a hybrid cpu\/gpu environment. J. Comput. Sci. 31, 151\u2013162 (2019)","journal-title":"J. Comput. Sci."},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-38496-7_3","volume-title":"Transactions on Computational Collective Intelligence X","author":"K Pi\u0119tak","year":"2013","unstructured":"Pi\u0119tak, K., Kisiel-Dorohinicki, M.: Agent-based framework facilitating component-based implementation of distributed computational intelligence systems. In: Nguyen, N.-T., Ko\u0142odziej, J., Burczy\u0144ski, T., Biba, M. (eds.) Transactions on Computational Collective Intelligence X. LNCS, vol. 7776, pp. 31\u201344. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38496-7_3"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-03668-2_8","volume-title":"Holonic and Multi-Agent Systems for Manufacturing","author":"K Pi\u0119tak","year":"2009","unstructured":"Pi\u0119tak, K., Wo\u015b, A., Byrski, A., Kisiel-Dorohinicki, M.: Functional integrity of multi-agent computational system supported by component-based implementation. In: Ma\u0159\u00edk, V., Strasser, T., Zoitl, A. (eds.) HoloMAS 2009. LNCS (LNAI), vol. 5696, pp. 82\u201391. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03668-2_8"},{"key":"23_CR22","unstructured":"Walsh, T.: CSPLib problem 005: Low autocorrelation binary sequences. http:\/\/www.csplib.org\/Problems\/prob005, Accessed 31 Jan 2017"},{"issue":"6","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/LCOMM.2020.2977897","volume":"24","author":"F Zeng","year":"2020","unstructured":"Zeng, F., He, X., Zhang, Z., Xuan, G., Peng, Y., Yan, L.: Optimal and z-optimal type-ii odd-length binary z-complementary pairs. IEEE Commun. Lett. 24(6), 1163\u20131167 (2020)","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/TSP.2016.2620113","volume":"65","author":"L Zhao","year":"2017","unstructured":"Zhao, L., Song, J., Babu, P., Palomar, D.P.: A unified framework for low autocorrelation sequence design via majorization\u2013minimization. IEEE Trans. Signal Process. 65(2), 438\u2013453 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.procs.2017.05.201","volume":"108","author":"D \u017burek","year":"2017","unstructured":"\u017burek, D., Pi\u0119ctak, K., Pietro\u0144, M., Kisiel-Dorohinicki, M.: Toward hybrid platform for evolutionary computations of hard discrete problems. Procedia Comput. Sci. 108, 877\u2013886 (2017)","journal-title":"Procedia Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88081-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:15:33Z","timestamp":1632914133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88081-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030880804","9783030880811"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88081-1_23","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":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","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":"iccci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2021\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"231","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":"58","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":"25% - 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)"}}]}}