[{"publication_identifier":{"isbn":["978-989-758-400-8"]},"citation":{"ama":"Jovanovikj I, Yigitbas E, Sauer S, Engels G. Concept-based Co-Migration of Test Cases. In: <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>. ; 2020. doi:<a href=\"https://doi.org/10.5220/0009171404490456\">10.5220/0009171404490456</a>","chicago":"Jovanovikj, Ivan, Enes Yigitbas, Stefan Sauer, and Gregor Engels. “Concept-Based Co-Migration of Test Cases.” In <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>, 2020. <a href=\"https://doi.org/10.5220/0009171404490456\">https://doi.org/10.5220/0009171404490456</a>.","ieee":"I. Jovanovikj, E. Yigitbas, S. Sauer, and G. Engels, “Concept-based Co-Migration of Test Cases,” in <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>, Valletta, 2020.","mla":"Jovanovikj, Ivan, et al. “Concept-Based Co-Migration of Test Cases.” <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>, 2020, doi:<a href=\"https://doi.org/10.5220/0009171404490456\">10.5220/0009171404490456</a>.","bibtex":"@inproceedings{Jovanovikj_Yigitbas_Sauer_Engels_2020, title={Concept-based Co-Migration of Test Cases}, DOI={<a href=\"https://doi.org/10.5220/0009171404490456\">10.5220/0009171404490456</a>}, booktitle={Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD}, author={Jovanovikj, Ivan and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}, year={2020} }","short":"I. Jovanovikj, E. Yigitbas, S. Sauer, G. Engels, in: Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD, 2020.","apa":"Jovanovikj, I., Yigitbas, E., Sauer, S., &#38; Engels, G. (2020). Concept-based Co-Migration of Test Cases. In <i>Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD</i>. Valletta. <a href=\"https://doi.org/10.5220/0009171404490456\">https://doi.org/10.5220/0009171404490456</a>"},"year":"2020","author":[{"first_name":"Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","last_name":"Jovanovikj","id":"39187","full_name":"Jovanovikj, Ivan"},{"full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes"},{"first_name":"Stefan","last_name":"Sauer","id":"447","full_name":"Sauer, Stefan"},{"full_name":"Engels, Gregor","id":"107","last_name":"Engels","first_name":"Gregor"}],"date_created":"2020-01-20T09:59:56Z","date_updated":"2022-01-06T06:52:30Z","doi":"10.5220/0009171404490456","conference":{"location":"Valletta","name":"8th International Conference on Model-Driven Engineering and Software Development  (MODELSWARD'20)"},"title":"Concept-based Co-Migration of Test Cases","publication":"Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD","type":"conference","status":"public","department":[{"_id":"66"},{"_id":"534"}],"user_id":"57458","_id":"15604","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:52:30Z","author":[{"orcid":"https://orcid.org/0000-0002-1838-794X","last_name":"Jovanovikj","full_name":"Jovanovikj, Ivan","id":"39187","first_name":"Ivan"},{"full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes"},{"last_name":"Sauer","full_name":"Sauer, Stefan","id":"447","first_name":"Stefan"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"}],"date_created":"2020-01-20T10:30:20Z","title":"Test Case Co-Migration Method Patterns","conference":{"name":"7th Collaborative Workshop on Evolution and Maintenance of Long-Living Software Systems (EMLS'20)","location":"Innscbruck"},"publication_status":"published","publication_identifier":{"issn":["1613-0073"]},"year":"2020","citation":{"ama":"Jovanovikj I, Yigitbas E, Sauer S, Engels G. Test Case Co-Migration Method Patterns. <i>Software Engineering 2020 Workshopband</i>. 2020.","ieee":"I. Jovanovikj, E. Yigitbas, S. Sauer, and G. Engels, “Test Case Co-Migration Method Patterns,” <i>Software Engineering 2020 Workshopband</i>, 2020.","chicago":"Jovanovikj, Ivan, Enes Yigitbas, Stefan Sauer, and Gregor Engels. “Test Case Co-Migration Method Patterns.” <i>Software Engineering 2020 Workshopband</i>, 2020.","apa":"Jovanovikj, I., Yigitbas, E., Sauer, S., &#38; Engels, G. (2020). Test Case Co-Migration Method Patterns. <i>Software Engineering 2020 Workshopband</i>.","mla":"Jovanovikj, Ivan, et al. “Test Case Co-Migration Method Patterns.” <i>Software Engineering 2020 Workshopband</i>, 2020.","bibtex":"@article{Jovanovikj_Yigitbas_Sauer_Engels_2020, title={Test Case Co-Migration Method Patterns}, journal={Software Engineering 2020 Workshopband}, author={Jovanovikj, Ivan and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}, year={2020} }","short":"I. Jovanovikj, E. Yigitbas, S. Sauer, G. Engels, Software Engineering 2020 Workshopband (2020)."},"_id":"15605","user_id":"57458","department":[{"_id":"66"},{"_id":"534"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Software Engineering 2020 Workshopband","status":"public"},{"language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"user_id":"5786","_id":"15629","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","abstract":[{"lang":"eng","text":"In multi-label classification (MLC), each instance is associated with a set of class labels, in contrast to standard classification where an instance is assigned a single label. Binary relevance (BR) learning, which reduces a multi-label to a set of binary classification problems, one per label, is arguably the most straight-forward approach to MLC. In spite of its simplicity, BR proved to be competitive to more sophisticated MLC methods, and still achieves state-of-the-art performance for many loss functions. Somewhat surprisingly, the optimal choice of the base learner for tackling the binary classification problems has received very little attention so far. Taking advantage of the label independence assumption inherent to BR, we propose a label-wise base learner selection method optimizing label-wise macro averaged performance measures. In an extensive experimental evaluation, we find that or approach, called LiBRe, can significantly improve generalization performance."}],"type":"conference","conference":{"end_date":"2020-04-27","location":"Konstanz, Germany","name":"Symposium on Intelligent Data Analysis","start_date":"2020-04-24"},"title":"LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification","author":[{"full_name":"Wever, Marcel Dominik","id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","first_name":"Marcel Dominik"},{"last_name":"Tornede","full_name":"Tornede, Alexander","id":"38209","first_name":"Alexander"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"}],"date_created":"2020-01-23T08:44:08Z","date_updated":"2022-01-06T06:52:30Z","publisher":"Springer","citation":{"ama":"Wever MD, Tornede A, Mohr F, Hüllermeier E. LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification. In: Springer.","ieee":"M. D. Wever, A. Tornede, F. Mohr, and E. Hüllermeier, “LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification,” presented at the Symposium on Intelligent Data Analysis, Konstanz, Germany.","chicago":"Wever, Marcel Dominik, Alexander Tornede, Felix Mohr, and Eyke Hüllermeier. “LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification.” Springer, n.d.","apa":"Wever, M. D., Tornede, A., Mohr, F., &#38; Hüllermeier, E. (n.d.). <i>LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification</i>. Symposium on Intelligent Data Analysis, Konstanz, Germany.","mla":"Wever, Marcel Dominik, et al. <i>LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification</i>. Springer.","bibtex":"@inproceedings{Wever_Tornede_Mohr_Hüllermeier, title={LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification}, publisher={Springer}, author={Wever, Marcel Dominik and Tornede, Alexander and Mohr, Felix and Hüllermeier, Eyke} }","short":"M.D. Wever, A. Tornede, F. Mohr, E. Hüllermeier, in: Springer, n.d."},"year":"2020","publication_status":"accepted"},{"has_accepted_license":"1","year":"2020","place":"Universität Paderborn","citation":{"chicago":"Feldkord, Björn. <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-869\">https://doi.org/10.17619/UNIPB/1-869</a>.","ieee":"B. Feldkord, <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020.","ama":"Feldkord B. <i>Mobile Resource Allocation</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>","apa":"Feldkord, B. (2020). <i>Mobile Resource Allocation</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-869\">https://doi.org/10.17619/UNIPB/1-869</a>","short":"B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.","bibtex":"@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource Allocation}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>}, author={Feldkord, Björn}, year={2020} }","mla":"Feldkord, Björn. <i>Mobile Resource Allocation</i>. 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>."},"date_updated":"2022-01-06T06:52:31Z","author":[{"id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord","first_name":"Björn"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-01-23T14:20:25Z","title":"Mobile Resource Allocation","doi":"10.17619/UNIPB/1-869","type":"dissertation","status":"public","file":[{"file_id":"15634","file_name":"DissertationFeldkord.pdf","access_level":"closed","file_size":633652,"creator":"florida","date_created":"2020-01-24T08:19:38Z","date_updated":"2020-01-24T08:19:38Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"_id":"15631","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"}],"user_id":"15415","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-01-24T08:19:38Z"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"15770","user_id":"477","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:32Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2020-02-04T13:47:02Z","author":[{"last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"}],"title":"On the complexity of local transformations in SDN overlays","year":"2020","citation":{"ama":"Warner D. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn; 2020.","chicago":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020.","ieee":"D. Warner, <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn, 2020.","apa":"Warner, D. (2020). <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn.","short":"D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität Paderborn, 2020.","mla":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020.","bibtex":"@book{Warner_2020, title={On the complexity of local transformations in SDN overlays}, publisher={Universität Paderborn}, author={Warner, Daniel}, year={2020} }"}},{"department":[{"_id":"600"},{"_id":"568"}],"user_id":"82920","_id":"15820","language":[{"iso":"eng"}],"publication":"Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)","type":"conference","status":"public","author":[{"first_name":"Khalid","full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib"},{"full_name":"Hou, Yufang","last_name":"Hou","first_name":"Yufang"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth"},{"last_name":"Jochim","full_name":"Jochim, Charles","first_name":"Charles"},{"full_name":"Bonin, Francesca","last_name":"Bonin","first_name":"Francesca"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"}],"date_created":"2020-02-06T10:41:22Z","date_updated":"2022-01-06T06:52:37Z","main_file_link":[{"url":"https://aaai.org/ojs/index.php/AAAI/article/view/6231"}],"title":"End-to-End Argumentation Knowledge Graph Construction","page":"7367 - 7374","citation":{"mla":"Al-Khatib, Khalid, et al. “End-to-End Argumentation Knowledge Graph Construction.” <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i>, 2020, pp. 7367–74.","bibtex":"@inproceedings{Al-Khatib_Hou_Wachsmuth_Jochim_Bonin_Stein_2020, title={End-to-End Argumentation Knowledge Graph Construction}, booktitle={Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)}, author={Al-Khatib, Khalid and Hou, Yufang and Wachsmuth, Henning and Jochim, Charles and Bonin, Francesca and Stein, Benno}, year={2020}, pages={7367–7374} }","short":"K. Al-Khatib, Y. Hou, H. Wachsmuth, C. Jochim, F. Bonin, B. Stein, in: Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020), 2020, pp. 7367–7374.","apa":"Al-Khatib, K., Hou, Y., Wachsmuth, H., Jochim, C., Bonin, F., &#38; Stein, B. (2020). End-to-End Argumentation Knowledge Graph Construction. In <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i> (pp. 7367–7374).","ieee":"K. Al-Khatib, Y. Hou, H. Wachsmuth, C. Jochim, F. Bonin, and B. Stein, “End-to-End Argumentation Knowledge Graph Construction,” in <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i>, 2020, pp. 7367–7374.","chicago":"Al-Khatib, Khalid, Yufang Hou, Henning Wachsmuth, Charles Jochim, Francesca Bonin, and Benno Stein. “End-to-End Argumentation Knowledge Graph Construction.” In <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i>, 7367–74, 2020.","ama":"Al-Khatib K, Hou Y, Wachsmuth H, Jochim C, Bonin F, Stein B. End-to-End Argumentation Knowledge Graph Construction. In: <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i>. ; 2020:7367-7374."},"year":"2020"},{"title":"Touché: First Shared Task on Argument Retrieval","main_file_link":[{"url":"https://webis.de/downloads/publications/papers/stein_2020c.pdf"}],"date_updated":"2022-01-06T06:52:37Z","author":[{"first_name":"Alexander","last_name":"Bondarenko","full_name":"Bondarenko, Alexander"},{"first_name":"Matthias","full_name":"Hagen, Matthias","last_name":"Hagen"},{"first_name":"Martin","last_name":"Potthast","full_name":"Potthast, Martin"},{"first_name":"Henning","id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"last_name":"Beloucif","full_name":"Beloucif, Meriem","first_name":"Meriem"},{"first_name":"Chris","last_name":"Biemann","full_name":"Biemann, Chris"},{"full_name":"Panchenko, Alexander","last_name":"Panchenko","first_name":"Alexander"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"}],"date_created":"2020-02-06T10:42:19Z","year":"2020","page":"517-523","citation":{"apa":"Bondarenko, A., Hagen, M., Potthast, M., Wachsmuth, H., Beloucif, M., Biemann, C., … Stein, B. (2020). Touché: First Shared Task on Argument Retrieval. In <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i> (pp. 517–523).","short":"A. Bondarenko, M. Hagen, M. Potthast, H. Wachsmuth, M. Beloucif, C. Biemann, A. Panchenko, B. Stein, in: Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020), 2020, pp. 517–523.","bibtex":"@inproceedings{Bondarenko_Hagen_Potthast_Wachsmuth_Beloucif_Biemann_Panchenko_Stein_2020, title={Touché: First Shared Task on Argument Retrieval}, booktitle={Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)}, author={Bondarenko, Alexander and Hagen, Matthias and Potthast, Martin and Wachsmuth, Henning and Beloucif, Meriem and Biemann, Chris and Panchenko, Alexander and Stein, Benno}, year={2020}, pages={517–523} }","mla":"Bondarenko, Alexander, et al. “Touché: First Shared Task on Argument Retrieval.” <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i>, 2020, pp. 517–23.","ieee":"A. Bondarenko <i>et al.</i>, “Touché: First Shared Task on Argument Retrieval,” in <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i>, 2020, pp. 517–523.","chicago":"Bondarenko, Alexander, Matthias Hagen, Martin Potthast, Henning Wachsmuth, Meriem Beloucif, Chris Biemann, Alexander Panchenko, and Benno Stein. “Touché: First Shared Task on Argument Retrieval.” In <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i>, 517–23, 2020.","ama":"Bondarenko A, Hagen M, Potthast M, et al. Touché: First Shared Task on Argument Retrieval. In: <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i>. ; 2020:517-523."},"language":[{"iso":"eng"}],"_id":"15821","department":[{"_id":"600"},{"_id":"568"}],"user_id":"82920","status":"public","publication":"Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)","type":"conference"},{"page":"53-62","citation":{"ama":"Kiesel J, Lang K, Wachsmuth H, Hornecker E, Stein B. Investigating Expectations for Voice-based and Conversational Argument Search on the Web. In: <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i>. ; 2020:53-62.","ieee":"J. Kiesel, K. Lang, H. Wachsmuth, E. Hornecker, and B. Stein, “Investigating Expectations for Voice-based and Conversational Argument Search on the Web,” in <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i>, 2020, pp. 53–62.","chicago":"Kiesel, Johannes, Kevin Lang, Henning Wachsmuth, Eva Hornecker, and Benno Stein. “Investigating Expectations for Voice-Based and Conversational Argument Search on the Web.” In <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i>, 53–62, 2020.","apa":"Kiesel, J., Lang, K., Wachsmuth, H., Hornecker, E., &#38; Stein, B. (2020). Investigating Expectations for Voice-based and Conversational Argument Search on the Web. In <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i> (pp. 53–62).","short":"J. Kiesel, K. Lang, H. Wachsmuth, E. Hornecker, B. Stein, in: Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020), 2020, pp. 53–62.","mla":"Kiesel, Johannes, et al. “Investigating Expectations for Voice-Based and Conversational Argument Search on the Web.” <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i>, 2020, pp. 53–62.","bibtex":"@inproceedings{Kiesel_Lang_Wachsmuth_Hornecker_Stein_2020, title={Investigating Expectations for Voice-based and Conversational Argument Search on the Web}, booktitle={Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)}, author={Kiesel, Johannes and Lang, Kevin and Wachsmuth, Henning and Hornecker, Eva and Stein, Benno}, year={2020}, pages={53–62} }"},"year":"2020","author":[{"first_name":"Johannes","last_name":"Kiesel","full_name":"Kiesel, Johannes"},{"first_name":"Kevin","full_name":"Lang, Kevin","last_name":"Lang"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth"},{"first_name":"Eva","full_name":"Hornecker, Eva","last_name":"Hornecker"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"}],"date_created":"2020-02-06T10:49:08Z","date_updated":"2022-01-06T06:52:37Z","main_file_link":[{"url":"https://webis.de/downloads/publications/papers/stein_2020b.pdf"}],"title":"Investigating Expectations for Voice-based and Conversational Argument Search on the Web","publication":"Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction & Retrieval (CHIIR 2020)","type":"conference","status":"public","department":[{"_id":"600"},{"_id":"568"}],"user_id":"82920","_id":"15825","language":[{"iso":"eng"}]},{"date_created":"2020-02-06T15:05:45Z","author":[{"first_name":"K.","full_name":"Bellman, K.","last_name":"Bellman"},{"first_name":"N.","last_name":"Dutt","full_name":"Dutt, N."},{"first_name":"L.","full_name":"Esterle, L.","last_name":"Esterle"},{"full_name":"Herkersdorf, A.","last_name":"Herkersdorf","first_name":"A."},{"last_name":"Jantsch","full_name":"Jantsch, A.","first_name":"A."},{"full_name":"Landauer, C.","last_name":"Landauer","first_name":"C."},{"full_name":"R. Lewis, P.","last_name":"R. Lewis","first_name":"P."},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"first_name":"N.","full_name":"TaheriNejad, N.","last_name":"TaheriNejad"},{"first_name":"K.","full_name":"Tammemäe, K.","last_name":"Tammemäe"}],"volume":"Accepted for Publication","date_updated":"2022-01-06T06:52:37Z","title":"Self-aware Cyber-Physical Systems","citation":{"ama":"Bellman K, Dutt N, Esterle L, et al. Self-aware Cyber-Physical Systems. <i>ACM Transactions on Cyber-Physical Systems</i>. 2020;Accepted for Publication:1-24.","ieee":"K. Bellman <i>et al.</i>, “Self-aware Cyber-Physical Systems,” <i>ACM Transactions on Cyber-Physical Systems</i>, vol. Accepted for Publication, pp. 1–24, 2020.","chicago":"Bellman, K., N. Dutt, L. Esterle, A. Herkersdorf, A. Jantsch, C. Landauer, P. R. Lewis, Marco Platzner, N. TaheriNejad, and K. Tammemäe. “Self-Aware Cyber-Physical Systems.” <i>ACM Transactions on Cyber-Physical Systems</i> Accepted for Publication (2020): 1–24.","apa":"Bellman, K., Dutt, N., Esterle, L., Herkersdorf, A., Jantsch, A., Landauer, C., … Tammemäe, K. (2020). Self-aware Cyber-Physical Systems. <i>ACM Transactions on Cyber-Physical Systems</i>, <i>Accepted for Publication</i>, 1–24.","bibtex":"@article{Bellman_Dutt_Esterle_Herkersdorf_Jantsch_Landauer_R. Lewis_Platzner_TaheriNejad_Tammemäe_2020, title={Self-aware Cyber-Physical Systems}, volume={Accepted for Publication}, journal={ACM Transactions on Cyber-Physical Systems}, author={Bellman, K. and Dutt, N. and Esterle, L. and Herkersdorf, A. and Jantsch, A. and Landauer, C. and R. Lewis, P. and Platzner, Marco and TaheriNejad, N. and Tammemäe, K.}, year={2020}, pages={1–24} }","mla":"Bellman, K., et al. “Self-Aware Cyber-Physical Systems.” <i>ACM Transactions on Cyber-Physical Systems</i>, vol. Accepted for Publication, 2020, pp. 1–24.","short":"K. Bellman, N. Dutt, L. Esterle, A. Herkersdorf, A. Jantsch, C. Landauer, P. R. Lewis, M. Platzner, N. TaheriNejad, K. Tammemäe, ACM Transactions on Cyber-Physical Systems Accepted for Publication (2020) 1–24."},"page":"1-24","year":"2020","user_id":"398","department":[{"_id":"78"}],"_id":"15836","language":[{"iso":"eng"}],"type":"journal_article","publication":"ACM Transactions on Cyber-Physical Systems","status":"public"},{"publisher":"MIT Press Journals","date_updated":"2022-01-06T06:52:15Z","author":[{"last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","id":"33176","first_name":"Marcel Dominik"},{"first_name":"Lorijn","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn","id":"58843"},{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"}],"date_created":"2019-11-18T14:19:19Z","volume":28,"title":"Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets","doi":"10.1162/evco_a_00266","publication_status":"published","issue":"2","related_material":{"link":[{"relation":"confirmation","url":"https://www.mitpressjournals.org/doi/pdf/10.1162/evco_a_00266"}]},"year":"2020","citation":{"short":"M.D. Wever, L. van Rooijen, H. Hamann, Evolutionary Computation 28 (2020) 165–193.","bibtex":"@article{Wever_van Rooijen_Hamann_2020, title={Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets}, volume={28}, DOI={<a href=\"https://doi.org/10.1162/evco_a_00266\">10.1162/evco_a_00266</a>}, number={2}, journal={Evolutionary Computation}, publisher={MIT Press Journals}, author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}, year={2020}, pages={165–193} }","mla":"Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” <i>Evolutionary Computation</i>, vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:<a href=\"https://doi.org/10.1162/evco_a_00266\">10.1162/evco_a_00266</a>.","apa":"Wever, M. D., van Rooijen, L., &#38; Hamann, H. (2020). Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. <i>Evolutionary Computation</i>, <i>28</i>(2), 165–193. <a href=\"https://doi.org/10.1162/evco_a_00266\">https://doi.org/10.1162/evco_a_00266</a>","chicago":"Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” <i>Evolutionary Computation</i> 28, no. 2 (2020): 165–193. <a href=\"https://doi.org/10.1162/evco_a_00266\">https://doi.org/10.1162/evco_a_00266</a>.","ieee":"M. D. Wever, L. van Rooijen, and H. Hamann, “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets,” <i>Evolutionary Computation</i>, vol. 28, no. 2, pp. 165–193, 2020, doi: <a href=\"https://doi.org/10.1162/evco_a_00266\">10.1162/evco_a_00266</a>.","ama":"Wever MD, van Rooijen L, Hamann H. Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. <i>Evolutionary Computation</i>. 2020;28(2):165–193. doi:<a href=\"https://doi.org/10.1162/evco_a_00266\">10.1162/evco_a_00266</a>"},"page":"165–193","intvolume":"        28","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"15025","user_id":"15415","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"},{"_id":"63"},{"_id":"238"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Evolutionary Computation","abstract":[{"text":"In software engineering, the imprecise requirements of a user are transformed to a formal requirements specification during the requirements elicitation process. This process is usually guided by requirements engineers interviewing the user. We want to partially automate this first step of the software engineering process in order to enable users to specify a desired software system on their own. With our approach, users are only asked to provide exemplary behavioral descriptions. The problem of synthesizing a requirements specification from examples can partially be reduced to the problem of grammatical inference, to which we apply an active coevolutionary learning approach. However, this approach would usually require many feedback queries to be sent to the user. In this work, we extend and generalize our active learning approach to receive knowledge from multiple oracles, also known as proactive learning. The ‘user oracle’ represents input received from the user and the ‘knowledge oracle’ represents available, formalized domain knowledge. We call our two-oracle approach the ‘first apply knowledge then query’ (FAKT/Q) algorithm. We compare FAKT/Q to the active learning approach and provide an extensive benchmark evaluation. As result we find that the number of required user queries is reduced and the inference process is sped up significantly. Finally, with so-called On-The-Fly Markets, we present a motivation and an application of our approach where such knowledge is available.","lang":"eng"}],"status":"public"},{"publication":"Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)","type":"conference","status":"public","_id":"15169","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"publication_status":"accepted","year":"2020","citation":{"apa":"Castenow, J., Kolb, C., &#38; Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. Kolkata, Indien: ACM.","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian} }","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>, ACM.","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. ACM.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. ACM, n.d.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>, Kolkata, Indien."},"date_updated":"2022-01-06T06:52:16Z","publisher":"ACM","author":[{"first_name":"Jannik","last_name":"Castenow","id":"38705","full_name":"Castenow, Jannik"},{"last_name":"Kolb","id":"43647","full_name":"Kolb, Christina","first_name":"Christina"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2019-11-25T12:18:41Z","title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","conference":{"start_date":"04.01.2020","name":"21st International Conference on Distributed Computing and Networking ","location":"Kolkata, Indien","end_date":"07.01.2020"}},{"citation":{"ieee":"E. Yigitbas, I. Jovanovikj, S. Sauer, and G. Engels, “On the Development of Context-aware Augmented Reality Applications ,” in <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>, Springer, LNCS, 2020.","chicago":"Yigitbas, Enes, Ivan Jovanovikj, Stefan Sauer, and Gregor Engels. “On the Development of Context-Aware Augmented Reality Applications .” In <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>. Springer, LNCS, 2020.","ama":"Yigitbas E, Jovanovikj I, Sauer S, Engels G. On the Development of Context-aware Augmented Reality Applications . In: <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>. Springer, LNCS; 2020.","apa":"Yigitbas, E., Jovanovikj, I., Sauer, S., &#38; Engels, G. (2020). On the Development of Context-aware Augmented Reality Applications . In <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>. Springer, LNCS.","bibtex":"@inbook{Yigitbas_Jovanovikj_Sauer_Engels_2020, title={On the Development of Context-aware Augmented Reality Applications }, booktitle={Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5}, publisher={Springer, LNCS}, author={Yigitbas, Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor}, year={2020} }","short":"E. Yigitbas, I. Jovanovikj, S. Sauer, G. Engels, in: Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5, Springer, LNCS, 2020.","mla":"Yigitbas, Enes, et al. “On the Development of Context-Aware Augmented Reality Applications .” <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>, Springer, LNCS, 2020."},"year":"2020","author":[{"first_name":"Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","id":"8447","full_name":"Yigitbas, Enes"},{"first_name":"Ivan","id":"39187","full_name":"Jovanovikj, Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X"},{"first_name":"Stefan","full_name":"Sauer, Stefan","id":"447","last_name":"Sauer"},{"full_name":"Engels, Gregor","id":"107","last_name":"Engels","first_name":"Gregor"}],"date_created":"2019-12-10T12:10:04Z","date_updated":"2022-01-06T06:52:20Z","publisher":"Springer, LNCS","title":"On the Development of Context-aware Augmented Reality Applications ","publication":"Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5","type":"book_chapter","status":"public","department":[{"_id":"66"},{"_id":"534"}],"user_id":"8447","_id":"15267","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"16213","user_id":"64665","department":[{"_id":"78"}],"abstract":[{"text":"Automated synthesis of approximate circuits via functional approximations is of prominent importance to provide efficiency in energy, runtime, and chip area required to execute an application. Approximate circuits are usually obtained either through analytical approximation methods leveraging approximate transformations such as bit-width scaling or via iterative search-based optimization methods when a library of approximate components, e.g., approximate adders and multipliers, is available. For the latter, exploring the extremely large design space is challenging in terms of both computations and quality of results. While the combination of both methods can create more room for further approximations, the \\textit{Design Space Exploration}~(DSE) becomes a crucial issue. In this paper, we present such a hybrid synthesis methodology that applies a low-cost analytical method followed by parallel stochastic search-based optimization. We address the DSE challenge through efficient pruning of the design space and skipping unnecessary expensive testing and/or verification steps. The experimental results reveal up to 10.57x area savings in comparison with both purely analytical or search-based approaches. ","lang":"eng"}],"status":"public","type":"conference","publication":"Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020","title":"A Hybrid Synthesis Methodology for Approximate Circuits","conference":{"location":"Beijing, China","name":"ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020"},"doi":"10.1145/3386263.3406952","publisher":"ACM","date_updated":"2022-01-06T06:52:45Z","date_created":"2020-03-02T15:49:38Z","author":[{"id":"64665","full_name":"Awais, Muhammad","orcid":"https://orcid.org/0000-0003-4148-2969","last_name":"Awais","first_name":"Muhammad"},{"id":"61186","full_name":"Ghasemzadeh Mohammadi, Hassan","last_name":"Ghasemzadeh Mohammadi","first_name":"Hassan"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"year":"2020","citation":{"apa":"Awais, M., Ghasemzadeh Mohammadi, H., &#38; Platzner, M. (2020). A Hybrid Synthesis Methodology for Approximate Circuits. In <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i> (pp. 421–426). Beijing, China: ACM. <a href=\"https://doi.org/10.1145/3386263.3406952\">https://doi.org/10.1145/3386263.3406952</a>","mla":"Awais, Muhammad, et al. “A Hybrid Synthesis Methodology for Approximate Circuits.” <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i>, ACM, 2020, pp. 421–26, doi:<a href=\"https://doi.org/10.1145/3386263.3406952\">10.1145/3386263.3406952</a>.","bibtex":"@inproceedings{Awais_Ghasemzadeh Mohammadi_Platzner_2020, title={A Hybrid Synthesis Methodology for Approximate Circuits}, DOI={<a href=\"https://doi.org/10.1145/3386263.3406952\">10.1145/3386263.3406952</a>}, booktitle={Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020}, publisher={ACM}, author={Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and Platzner, Marco}, year={2020}, pages={421–426} }","short":"M. Awais, H. Ghasemzadeh Mohammadi, M. Platzner, in: Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020, ACM, 2020, pp. 421–426.","ama":"Awais M, Ghasemzadeh Mohammadi H, Platzner M. A Hybrid Synthesis Methodology for Approximate Circuits. In: <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i>. ACM; 2020:421-426. doi:<a href=\"https://doi.org/10.1145/3386263.3406952\">10.1145/3386263.3406952</a>","ieee":"M. Awais, H. Ghasemzadeh Mohammadi, and M. Platzner, “A Hybrid Synthesis Methodology for Approximate Circuits,” in <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i>, Beijing, China, 2020, pp. 421–426.","chicago":"Awais, Muhammad, Hassan Ghasemzadeh Mohammadi, and Marco Platzner. “A Hybrid Synthesis Methodology for Approximate Circuits.” In <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i>, 421–26. ACM, 2020. <a href=\"https://doi.org/10.1145/3386263.3406952\">https://doi.org/10.1145/3386263.3406952</a>."},"page":"421-426","publication_status":"published"},{"file_date_updated":"2020-03-03T11:42:16Z","user_id":"35343","department":[{"_id":"75"}],"project":[{"_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps","grant_number":"761493"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"16219","status":"public","type":"conference","conference":{"name":"IEEE Conference on Network Softwarization (NetSoft)","location":"Ghent, Belgium"},"author":[{"first_name":"Stefan Balthasar","id":"35343","full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider"},{"first_name":"Narayanan Puthenpurayil","last_name":"Satheeschandran","full_name":"Satheeschandran, Narayanan Puthenpurayil"},{"full_name":"Peuster, Manuel","id":"13271","last_name":"Peuster","first_name":"Manuel"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"oa":"1","date_updated":"2022-01-06T06:52:46Z","citation":{"ama":"Schneider SB, Satheeschandran NP, Peuster M, Karl H. Machine Learning for Dynamic Resource Allocation in Network Function Virtualization. In: <i>IEEE Conference on Network Softwarization (NetSoft)</i>. IEEE; 2020.","chicago":"Schneider, Stefan Balthasar, Narayanan Puthenpurayil Satheeschandran, Manuel Peuster, and Holger Karl. “Machine Learning for Dynamic Resource Allocation in Network Function Virtualization.” In <i>IEEE Conference on Network Softwarization (NetSoft)</i>. IEEE, 2020.","ieee":"S. B. Schneider, N. P. Satheeschandran, M. Peuster, and H. Karl, “Machine Learning for Dynamic Resource Allocation in Network Function Virtualization,” in <i>IEEE Conference on Network Softwarization (NetSoft)</i>, Ghent, Belgium, 2020.","mla":"Schneider, Stefan Balthasar, et al. “Machine Learning for Dynamic Resource Allocation in Network Function Virtualization.” <i>IEEE Conference on Network Softwarization (NetSoft)</i>, IEEE, 2020.","short":"S.B. Schneider, N.P. Satheeschandran, M. Peuster, H. Karl, in: IEEE Conference on Network Softwarization (NetSoft), IEEE, 2020.","bibtex":"@inproceedings{Schneider_Satheeschandran_Peuster_Karl_2020, title={Machine Learning for Dynamic Resource Allocation in Network Function Virtualization}, booktitle={IEEE Conference on Network Softwarization (NetSoft)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Satheeschandran, Narayanan Puthenpurayil and Peuster, Manuel and Karl, Holger}, year={2020} }","apa":"Schneider, S. B., Satheeschandran, N. P., Peuster, M., &#38; Karl, H. (2020). Machine Learning for Dynamic Resource Allocation in Network Function Virtualization. In <i>IEEE Conference on Network Softwarization (NetSoft)</i>. Ghent, Belgium: IEEE."},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"access_level":"open_access","file_name":"ris_preprint.pdf","file_id":"16220","file_size":476590,"creator":"stschn","date_created":"2020-03-03T11:42:16Z","date_updated":"2020-03-03T11:42:16Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Network function virtualization (NFV) proposes\r\nto replace physical middleboxes with more flexible virtual\r\nnetwork functions (VNFs). To dynamically adjust to everchanging\r\ntraffic demands, VNFs have to be instantiated and\r\ntheir allocated resources have to be adjusted on demand.\r\nDeciding the amount of allocated resources is non-trivial.\r\nExisting optimization approaches often assume fixed resource\r\nrequirements for each VNF instance. However, this can easily\r\nlead to either waste of resources or bad service quality if too\r\nmany or too few resources are allocated.\r\n\r\nTo solve this problem, we train machine learning models\r\non real VNF data, containing measurements of performance\r\nand resource requirements. For each VNF, the trained models\r\ncan then accurately predict the required resources to handle\r\na certain traffic load. We integrate these machine learning\r\nmodels into an algorithm for joint VNF scaling and placement\r\nand evaluate their impact on resulting VNF placements. Our\r\nevaluation based on real-world data shows that using suitable\r\nmachine learning models effectively avoids over- and underallocation\r\nof resources, leading to up to 12 times lower resource\r\nconsumption and better service quality with up to 4.5 times\r\nlower total delay than using standard fixed resource allocation."}],"publication":"IEEE Conference on Network Softwarization (NetSoft)","title":"Machine Learning for Dynamic Resource Allocation in Network Function Virtualization","date_created":"2020-03-03T11:42:22Z","publisher":"IEEE","year":"2020"},{"citation":{"ieee":"A. Zafeiropoulos <i>et al.</i>, “Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case,” in <i>IEEE Conference on Network Softwarization (NetSoft)</i>, 2020.","chicago":"Zafeiropoulos, A., E. Fotopoulou, Manuel Peuster, Stefan Balthasar Schneider, P. Gouvas, D. Behnke, M. Müller, et al. “Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case.” In <i>IEEE Conference on Network Softwarization (NetSoft)</i>, 2020.","ama":"Zafeiropoulos A, Fotopoulou E, Peuster M, et al. Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case. In: <i>IEEE Conference on Network Softwarization (NetSoft)</i>. ; 2020.","apa":"Zafeiropoulos, A., Fotopoulou, E., Peuster, M., Schneider, S. B., Gouvas, P., Behnke, D., … Karl, H. (2020). Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case. In <i>IEEE Conference on Network Softwarization (NetSoft)</i>.","bibtex":"@inproceedings{Zafeiropoulos_Fotopoulou_Peuster_Schneider_Gouvas_Behnke_Müller_Bök_Trakadas_Karkazis_et al._2020, title={Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case}, booktitle={IEEE Conference on Network Softwarization (NetSoft)}, author={Zafeiropoulos, A. and Fotopoulou, E. and Peuster, Manuel and Schneider, Stefan Balthasar and Gouvas, P. and Behnke, D. and Müller, M. and Bök, P. and Trakadas, P. and Karkazis, P. and et al.}, year={2020} }","mla":"Zafeiropoulos, A., et al. “Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case.” <i>IEEE Conference on Network Softwarization (NetSoft)</i>, 2020.","short":"A. Zafeiropoulos, E. Fotopoulou, M. Peuster, S.B. Schneider, P. Gouvas, D. Behnke, M. Müller, P. Bök, P. Trakadas, P. Karkazis, H. Karl, in: IEEE Conference on Network Softwarization (NetSoft), 2020."},"year":"2020","title":"Benchmarking and Profiling 5G Verticals' Applications: An Industrial IoT Use Case","author":[{"first_name":"A.","full_name":"Zafeiropoulos, A.","last_name":"Zafeiropoulos"},{"last_name":"Fotopoulou","full_name":"Fotopoulou, E.","first_name":"E."},{"full_name":"Peuster, Manuel","id":"13271","last_name":"Peuster","first_name":"Manuel"},{"first_name":"Stefan Balthasar","id":"35343","full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider"},{"first_name":"P.","full_name":"Gouvas, P.","last_name":"Gouvas"},{"first_name":"D.","full_name":"Behnke, D.","last_name":"Behnke"},{"full_name":"Müller, M.","last_name":"Müller","first_name":"M."},{"first_name":"P.","full_name":"Bök, P.","last_name":"Bök"},{"first_name":"P.","last_name":"Trakadas","full_name":"Trakadas, P."},{"first_name":"P.","last_name":"Karkazis","full_name":"Karkazis, P."},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2020-03-03T11:51:22Z","date_updated":"2022-01-06T06:52:46Z","status":"public","type":"conference","publication":"IEEE Conference on Network Softwarization (NetSoft)","language":[{"iso":"eng"}],"user_id":"35343","department":[{"_id":"75"}],"project":[{"grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28"}],"_id":"16222"},{"year":"2020","citation":{"ieee":"I. Jovanovikj, A. Nagaraj, E. Yigitbas, A. Anjorin, S. Sauer, and G. Engels, “Validating Test Case Migration via Mutation Analysis ,” in <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i>, Seoul, 2020, pp. 31–40.","chicago":"Jovanovikj, Ivan, Achyuth Nagaraj, Enes Yigitbas, Anthony Anjorin, Stefan Sauer, and Gregor Engels. “Validating Test Case Migration via Mutation Analysis .” In <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i>, 31–40. ACM, 2020.","ama":"Jovanovikj I, Nagaraj A, Yigitbas E, Anjorin A, Sauer S, Engels G. Validating Test Case Migration via Mutation Analysis . In: <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i>. ACM; 2020:31-40.","apa":"Jovanovikj, I., Nagaraj, A., Yigitbas, E., Anjorin, A., Sauer, S., &#38; Engels, G. (2020). Validating Test Case Migration via Mutation Analysis . In <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i> (pp. 31–40). Seoul: ACM.","bibtex":"@inproceedings{Jovanovikj_Nagaraj_Yigitbas_Anjorin_Sauer_Engels_2020, title={Validating Test Case Migration via Mutation Analysis }, booktitle={Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST}, publisher={ACM}, author={Jovanovikj, Ivan and Nagaraj, Achyuth and Yigitbas, Enes and Anjorin, Anthony and Sauer, Stefan and Engels, Gregor}, year={2020}, pages={31–40} }","short":"I. Jovanovikj, A. Nagaraj, E. Yigitbas, A. Anjorin, S. Sauer, G. Engels, in: Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST, ACM, 2020, pp. 31–40.","mla":"Jovanovikj, Ivan, et al. “Validating Test Case Migration via Mutation Analysis .” <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i>, ACM, 2020, pp. 31–40."},"page":"31-40","title":"Validating Test Case Migration via Mutation Analysis ","conference":{"location":"Seoul","name":"1st IEEE/ACM International Conference on Automation of Software Test (AST 2020)"},"publisher":"ACM","date_updated":"2022-01-06T06:52:47Z","date_created":"2020-03-09T13:11:25Z","author":[{"first_name":"Ivan","full_name":"Jovanovikj, Ivan","id":"39187","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X"},{"first_name":"Achyuth","full_name":"Nagaraj, Achyuth","last_name":"Nagaraj"},{"first_name":"Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","full_name":"Yigitbas, Enes","id":"8447"},{"first_name":"Anthony","last_name":"Anjorin","full_name":"Anjorin, Anthony"},{"last_name":"Sauer","id":"447","full_name":"Sauer, Stefan","first_name":"Stefan"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"status":"public","type":"conference","publication":"Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST","language":[{"iso":"eng"}],"_id":"16274","user_id":"8447","department":[{"_id":"66"},{"_id":"534"}]},{"publication_identifier":{"issn":["2214-2096"]},"publication_status":"published","citation":{"ieee":"N. Nomikos <i>et al.</i>, “A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices,” <i>Vehicular Communications</i>, 2020.","chicago":"Nomikos, Nikolaos, Emmanouel T. Michailidis, Panagiotis Trakadas, Demosthenes Vouyioukas, Holger Karl, Josep Martrat, Theodore Zahariadis, Konstantinos Papadopoulos, and Stamatis Voliotis. “A UAV-Based Moving 5G RAN for Massive Connectivity of Mobile Users and IoT Devices.” <i>Vehicular Communications</i>, 2020. <a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">https://doi.org/10.1016/j.vehcom.2020.100250</a>.","ama":"Nomikos N, Michailidis ET, Trakadas P, et al. A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices. <i>Vehicular Communications</i>. 2020. doi:<a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">10.1016/j.vehcom.2020.100250</a>","mla":"Nomikos, Nikolaos, et al. “A UAV-Based Moving 5G RAN for Massive Connectivity of Mobile Users and IoT Devices.” <i>Vehicular Communications</i>, 100250, 2020, doi:<a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">10.1016/j.vehcom.2020.100250</a>.","short":"N. Nomikos, E.T. Michailidis, P. Trakadas, D. Vouyioukas, H. Karl, J. Martrat, T. Zahariadis, K. Papadopoulos, S. Voliotis, Vehicular Communications (2020).","bibtex":"@article{Nomikos_Michailidis_Trakadas_Vouyioukas_Karl_Martrat_Zahariadis_Papadopoulos_Voliotis_2020, title={A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices}, DOI={<a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">10.1016/j.vehcom.2020.100250</a>}, number={100250}, journal={Vehicular Communications}, author={Nomikos, Nikolaos and Michailidis, Emmanouel T. and Trakadas, Panagiotis and Vouyioukas, Demosthenes and Karl, Holger and Martrat, Josep and Zahariadis, Theodore and Papadopoulos, Konstantinos and Voliotis, Stamatis}, year={2020} }","apa":"Nomikos, N., Michailidis, E. T., Trakadas, P., Vouyioukas, D., Karl, H., Martrat, J., … Voliotis, S. (2020). A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices. <i>Vehicular Communications</i>. <a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">https://doi.org/10.1016/j.vehcom.2020.100250</a>"},"year":"2020","date_created":"2020-03-10T15:59:56Z","author":[{"first_name":"Nikolaos","last_name":"Nomikos","full_name":"Nomikos, Nikolaos"},{"full_name":"Michailidis, Emmanouel T.","last_name":"Michailidis","first_name":"Emmanouel T."},{"first_name":"Panagiotis","full_name":"Trakadas, Panagiotis","last_name":"Trakadas"},{"full_name":"Vouyioukas, Demosthenes","last_name":"Vouyioukas","first_name":"Demosthenes"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"},{"full_name":"Martrat, Josep","last_name":"Martrat","first_name":"Josep"},{"first_name":"Theodore","last_name":"Zahariadis","full_name":"Zahariadis, Theodore"},{"first_name":"Konstantinos","last_name":"Papadopoulos","full_name":"Papadopoulos, Konstantinos"},{"first_name":"Stamatis","full_name":"Voliotis, Stamatis","last_name":"Voliotis"}],"date_updated":"2022-01-06T06:52:48Z","doi":"10.1016/j.vehcom.2020.100250","title":"A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices","publication":"Vehicular Communications","type":"journal_article","status":"public","abstract":[{"text":"Currently, the coexistence of multiple users and devices challenges the network's ability to reliably connect them. This article proposes a novel communication architecture that satisfies the requirements of fifth-generation (5G) mobile network applications. In particular, this architecture extends and combines ultra-dense networking (UDN), multi-access edge computing (MEC), and virtual infrastructure manager (VIM) concepts to provide a flexible network of moving radio access (RA) nodes, flying or moving to areas where users and devices struggle for connectivity and data rate. Furthermore, advances in radio communications and non-orthogonal multiple access (NOMA), virtualization technologies and energy-awareness mechanisms are integrated towards a mobile UDN that not only allows RA nodes to follow the user but also enables the virtualized network functions (VNFs) to adapt to user mobility by migrating from one node to another. Performance evaluation shows that the underlying network improves connectivity of users and devices through the flexible deployment of moving RA nodes and the use of NOMA.","lang":"eng"}],"department":[{"_id":"75"}],"user_id":"126","_id":"16278","language":[{"iso":"eng"}],"article_number":"100250"},{"publication_status":"published","publication_identifier":{"issn":["1536-1284","1558-0687"]},"citation":{"ama":"Li F, Yu D, Yang H, Yu J, Karl H, Cheng X. Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey. <i>IEEE Wireless Communications</i>. 2020:24-30. doi:<a href=\"https://doi.org/10.1109/mwc.001.1900280\">10.1109/mwc.001.1900280</a>","chicago":"Li, Feng, Dongxiao Yu, Huan Yang, Jiguo Yu, Holger Karl, and Xiuzhen Cheng. “Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey.” <i>IEEE Wireless Communications</i>, 2020, 24–30. <a href=\"https://doi.org/10.1109/mwc.001.1900280\">https://doi.org/10.1109/mwc.001.1900280</a>.","ieee":"F. Li, D. Yu, H. Yang, J. Yu, H. Karl, and X. Cheng, “Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey,” <i>IEEE Wireless Communications</i>, pp. 24–30, 2020.","apa":"Li, F., Yu, D., Yang, H., Yu, J., Karl, H., &#38; Cheng, X. (2020). Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey. <i>IEEE Wireless Communications</i>, 24–30. <a href=\"https://doi.org/10.1109/mwc.001.1900280\">https://doi.org/10.1109/mwc.001.1900280</a>","bibtex":"@article{Li_Yu_Yang_Yu_Karl_Cheng_2020, title={Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey}, DOI={<a href=\"https://doi.org/10.1109/mwc.001.1900280\">10.1109/mwc.001.1900280</a>}, journal={IEEE Wireless Communications}, author={Li, Feng and Yu, Dongxiao and Yang, Huan and Yu, Jiguo and Karl, Holger and Cheng, Xiuzhen}, year={2020}, pages={24–30} }","mla":"Li, Feng, et al. “Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey.” <i>IEEE Wireless Communications</i>, 2020, pp. 24–30, doi:<a href=\"https://doi.org/10.1109/mwc.001.1900280\">10.1109/mwc.001.1900280</a>.","short":"F. Li, D. Yu, H. Yang, J. Yu, H. Karl, X. Cheng, IEEE Wireless Communications (2020) 24–30."},"page":"24-30","year":"2020","author":[{"first_name":"Feng","last_name":"Li","full_name":"Li, Feng"},{"first_name":"Dongxiao","full_name":"Yu, Dongxiao","last_name":"Yu"},{"full_name":"Yang, Huan","last_name":"Yang","first_name":"Huan"},{"first_name":"Jiguo","last_name":"Yu","full_name":"Yu, Jiguo"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"},{"first_name":"Xiuzhen","last_name":"Cheng","full_name":"Cheng, Xiuzhen"}],"date_created":"2020-03-10T16:02:30Z","date_updated":"2022-01-06T06:52:48Z","doi":"10.1109/mwc.001.1900280","title":"Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey","type":"journal_article","publication":"IEEE Wireless Communications","status":"public","abstract":[{"text":"Assigning bands of the wireless spectrum as resources to users is a common problem in wireless networks. Typically, frequency bands were assumed to be available in a stable manner. Nevertheless, in recent scenarios where wireless networks may be deployed in unknown environments, spectrum competition is considered, making it uncertain whether a frequency band is available at all or at what quality. To fully exploit such resources with uncertain availability, the multi-armed bandit (MAB) method, a representative online learning technique, has been applied to design spectrum scheduling algorithms. This article surveys such proposals. We describe the following three aspects: how to model spectrum scheduling problems within the MAB framework, what the main thread is following which prevalent algorithms are designed, and how to evaluate algorithm performance and complexity. We also give some promising directions for future research in related fields.","lang":"eng"}],"user_id":"126","department":[{"_id":"75"}],"_id":"16280","language":[{"iso":"eng"}]},{"user_id":"38705","department":[{"_id":"63"}],"_id":"16299","language":[{"iso":"eng"}],"type":"journal_article","publication":"Theoretical Computer Science","status":"public","author":[{"first_name":"Jannik","full_name":"Castenow, Jannik","id":"38705","last_name":"Castenow"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Harbig","full_name":"Harbig, Jonas","first_name":"Jonas"},{"full_name":"Jung, Daniel","id":"37827","last_name":"Jung","first_name":"Daniel"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-03-13T12:55:53Z","volume":815,"date_updated":"2022-01-06T06:52:48Z","doi":"10.1016/j.tcs.2020.02.018","title":"Gathering Anonymous, Oblivious Robots on a Grid","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"citation":{"mla":"Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>Theoretical Computer Science</i>, vol. 815, 2020, pp. 289–309, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">10.1016/j.tcs.2020.02.018</a>.","bibtex":"@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">10.1016/j.tcs.2020.02.018</a>}, journal={Theoretical Computer Science}, author={Castenow, Jannik and Fischer, Matthias and Harbig, Jonas and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2020}, pages={289–309} }","short":"J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.","apa":"Castenow, J., Fischer, M., Harbig, J., Jung, D., &#38; Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. <i>Theoretical Computer Science</i>, <i>815</i>, 289–309. <a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">https://doi.org/10.1016/j.tcs.2020.02.018</a>","ama":"Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. <i>Theoretical Computer Science</i>. 2020;815:289-309. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">10.1016/j.tcs.2020.02.018</a>","ieee":"J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” <i>Theoretical Computer Science</i>, vol. 815, pp. 289–309, 2020.","chicago":"Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>Theoretical Computer Science</i> 815 (2020): 289–309. <a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">https://doi.org/10.1016/j.tcs.2020.02.018</a>."},"intvolume":"       815","page":"289-309","year":"2020"},{"user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"_id":"16363","language":[{"iso":"eng"}],"type":"conference","publication":"GECCO '20: Proceedings of the Genetic and Evolutionary Computation Conference Companion","status":"public","author":[{"id":"49992","full_name":"Hansmeier, Tim","last_name":"Hansmeier","orcid":"0000-0003-1377-3339","first_name":"Tim"},{"first_name":"Paul","full_name":"Kaufmann, Paul","last_name":"Kaufmann"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_created":"2020-04-02T10:07:10Z","date_updated":"2022-01-06T06:52:49Z","publisher":"Association for Computing Machinery (ACM)","doi":"10.1145/3377929.3389968","conference":{"end_date":"2020-07-12","location":"Cancún, Mexico","name":"The Genetic and Evolutionary Computation Conference (GECCO 2020)","start_date":"2020-07-08"},"title":"Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-7127-8"]},"citation":{"mla":"Hansmeier, Tim, et al. “Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold.” <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery (ACM), 2020, pp. 125–26, doi:<a href=\"https://doi.org/10.1145/3377929.3389968\">10.1145/3377929.3389968</a>.","bibtex":"@inproceedings{Hansmeier_Kaufmann_Platzner_2020, place={New York, NY, United States}, title={Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold}, DOI={<a href=\"https://doi.org/10.1145/3377929.3389968\">10.1145/3377929.3389968</a>}, booktitle={GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim and Kaufmann, Paul and Platzner, Marco}, year={2020}, pages={125–126} }","short":"T. Hansmeier, P. Kaufmann, M. Platzner, in: GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), New York, NY, United States, 2020, pp. 125–126.","apa":"Hansmeier, T., Kaufmann, P., &#38; Platzner, M. (2020). Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold. In <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i> (pp. 125–126). New York, NY, United States: Association for Computing Machinery (ACM). <a href=\"https://doi.org/10.1145/3377929.3389968\">https://doi.org/10.1145/3377929.3389968</a>","ama":"Hansmeier T, Kaufmann P, Platzner M. Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold. In: <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. New York, NY, United States: Association for Computing Machinery (ACM); 2020:125-126. doi:<a href=\"https://doi.org/10.1145/3377929.3389968\">10.1145/3377929.3389968</a>","chicago":"Hansmeier, Tim, Paul Kaufmann, and Marco Platzner. “Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold.” In <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 125–26. New York, NY, United States: Association for Computing Machinery (ACM), 2020. <a href=\"https://doi.org/10.1145/3377929.3389968\">https://doi.org/10.1145/3377929.3389968</a>.","ieee":"T. Hansmeier, P. Kaufmann, and M. Platzner, “Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold,” in <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Cancún, Mexico, 2020, pp. 125–126."},"page":"125-126","year":"2020","place":"New York, NY, United States"}]