[{"status":"public","conference":{"start_date":"2019-04-08","name":"25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","location":"Prague, Czech Republic","end_date":"2019-04-11"},"has_accepted_license":"1","page":"393-410","_id":"7626","ddc":["000"],"user_id":"60543","volume":"II","file_date_updated":"2019-02-12T07:18:17Z","citation":{"bibtex":"@inproceedings{Schubert_Hermann_Bodden_2019, title={PhASAR: An Inter-Procedural Static Analysis Framework for C/C++}, volume={II}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">10.1007/978-3-030-17465-1_22</a>}, booktitle={Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)}, author={Schubert, Philipp and Hermann, Ben and Bodden, Eric}, year={2019}, pages={393–410} }","short":"P. Schubert, B. Hermann, E. Bodden, in: Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019), 2019, pp. 393–410.","ama":"Schubert P, Hermann B, Bodden E. PhASAR: An Inter-Procedural Static Analysis Framework for C/C++. In: <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>. Vol II. ; 2019:393-410. doi:<a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">10.1007/978-3-030-17465-1_22</a>","chicago":"Schubert, Philipp, Ben Hermann, and Eric Bodden. “PhASAR: An Inter-Procedural Static Analysis Framework for C/C++.” In <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>, II:393–410, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">https://doi.org/10.1007/978-3-030-17465-1_22</a>.","ieee":"P. Schubert, B. Hermann, and E. Bodden, “PhASAR: An Inter-Procedural Static Analysis Framework for C/C++,” in <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>, Prague, Czech Republic, 2019, vol. II, pp. 393–410, doi: <a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">10.1007/978-3-030-17465-1_22</a>.","mla":"Schubert, Philipp, et al. “PhASAR: An Inter-Procedural Static Analysis Framework for C/C++.” <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>, vol. II, 2019, pp. 393–410, doi:<a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">10.1007/978-3-030-17465-1_22</a>.","apa":"Schubert, P., Hermann, B., &#38; Bodden, E. (2019). PhASAR: An Inter-Procedural Static Analysis Framework for C/C++. <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>, <i>II</i>, 393–410. <a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">https://doi.org/10.1007/978-3-030-17465-1_22</a>"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"oa":"1","year":"2019","title":"PhASAR: An Inter-Procedural Static Analysis Framework for C/C++","author":[{"full_name":"Schubert, Philipp","first_name":"Philipp","last_name":"Schubert","orcid":"0000-0002-8674-1859","id":"60543"},{"id":"66173","full_name":"Hermann, Ben","last_name":"Hermann","first_name":"Ben","orcid":"0000-0001-9848-2017"},{"id":"59256","full_name":"Bodden, Eric","first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647"}],"date_updated":"2022-03-25T07:48:36Z","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://link.springer.com/chapter/10.1007/978-3-030-17465-1_22"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-17465-1_22","publication":"Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)","file":[{"relation":"main_file","date_updated":"2019-02-12T07:18:17Z","file_name":"main.pdf","file_size":504897,"access_level":"closed","file_id":"7627","content_type":"application/pdf","success":1,"creator":"pdschbrt","date_created":"2019-02-12T07:18:17Z"}],"date_created":"2019-02-12T07:20:07Z","type":"conference","department":[{"_id":"76"}]},{"department":[{"_id":"78"}],"type":"conference","date_created":"2022-05-05T07:42:26Z","citation":{"ama":"Guettatfi Z, Platzner M, Kermia O, Khouas A. An Approach for Mapping Periodic Real-Time Tasks to Reconfigurable Hardware. In: <i>2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ipdpsw.2019.00027\">10.1109/ipdpsw.2019.00027</a>","bibtex":"@inproceedings{Guettatfi_Platzner_Kermia_Khouas_2019, title={An Approach for Mapping Periodic Real-Time Tasks to Reconfigurable Hardware}, DOI={<a href=\"https://doi.org/10.1109/ipdpsw.2019.00027\">10.1109/ipdpsw.2019.00027</a>}, booktitle={2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}, publisher={IEEE}, author={Guettatfi, Zakarya and Platzner, Marco and Kermia, Omar and Khouas, Abdelhakim}, year={2019} }","mla":"Guettatfi, Zakarya, et al. “An Approach for Mapping Periodic Real-Time Tasks to Reconfigurable Hardware.” <i>2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ipdpsw.2019.00027\">10.1109/ipdpsw.2019.00027</a>.","short":"Z. Guettatfi, M. Platzner, O. Kermia, A. Khouas, in: 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), IEEE, 2019.","chicago":"Guettatfi, Zakarya, Marco Platzner, Omar Kermia, and Abdelhakim Khouas. “An Approach for Mapping Periodic Real-Time Tasks to Reconfigurable Hardware.” In <i>2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ipdpsw.2019.00027\">https://doi.org/10.1109/ipdpsw.2019.00027</a>.","apa":"Guettatfi, Z., Platzner, M., Kermia, O., &#38; Khouas, A. (2019). An Approach for Mapping Periodic Real-Time Tasks to Reconfigurable Hardware. <i>2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>. <a href=\"https://doi.org/10.1109/ipdpsw.2019.00027\">https://doi.org/10.1109/ipdpsw.2019.00027</a>","ieee":"Z. Guettatfi, M. Platzner, O. Kermia, and A. Khouas, “An Approach for Mapping Periodic Real-Time Tasks to Reconfigurable Hardware,” 2019, doi: <a href=\"https://doi.org/10.1109/ipdpsw.2019.00027\">10.1109/ipdpsw.2019.00027</a>."},"publication":"2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","doi":"10.1109/ipdpsw.2019.00027","user_id":"398","language":[{"iso":"eng"}],"_id":"31067","publisher":"IEEE","date_updated":"2022-05-05T07:43:29Z","publication_status":"published","author":[{"last_name":"Guettatfi","first_name":"Zakarya","full_name":"Guettatfi, Zakarya"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"last_name":"Kermia","first_name":"Omar","full_name":"Kermia, Omar"},{"last_name":"Khouas","first_name":"Abdelhakim","full_name":"Khouas, Abdelhakim"}],"status":"public","year":"2019","title":"An Approach for Mapping Periodic Real-Time Tasks to Reconfigurable Hardware"},{"publication":"ISSEP 2019 - 12th International conference on informatics in schools: Situation, evaluation and perspectives, Local Proceedings","abstract":[{"lang":"eng","text":"Artificial intelligence (AI) has the potential for far-reaching – in our opinion – irreversible changes.\r\nThey range from effects on the individual and society to new societal and social issues. The question arises\r\nas to how students can learn the basic functioning of AI systems, what areas of life and society are affected\r\nby these and – most important – how their own lives are affected by these changes. Therefore, we are developing and evaluating school materials for the German ”Science Year AI”. It can be used for students of all\r\nschool types from the seventh grade upwards and will be distributed to about 2000 schools in autumn with\r\nthe support of the Federal Ministry of Education and Research. The material deals with the following aspects\r\nof AI: Discussing everyday experiences with AI, how does machine learning work, historical development\r\nof AI concepts, difference between man and machine, future distribution of roles between man and machine,\r\nin which AI world do we want to live and how much AI would we like to have in our lives. Through an\r\naccompanying evaluation, high quality of the technical content and didactic preparation is achieved in order\r\nto guarantee the long-term applicability in the teaching context in the different age groups and school types.\r\nIn this paper, we describe the current state of the material development, the challenges arising, and the results\r\nof tests with different classes to date. We also present first ideas for evaluating the results."}],"date_created":"2019-12-16T17:50:08Z","type":"conference","keyword":["Artificial Intelligence","Machine Learning","Teaching Material","Societal Aspects","Ethics. Social Aspects","Science Year","Simulation Game"],"department":[{"_id":"67"}],"year":"2019","title":"Understanding Artificial Intelligence – A Project for the Development of Comprehensive Teaching Material","publication_identifier":{"isbn":["978-9925-553-27-3"]},"author":[{"id":"32312","full_name":"Schlichtig, Michael","first_name":"Michael","last_name":"Schlichtig","orcid":"0000-0001-6600-6171"},{"id":"72932","full_name":"Opel, Simone Anna","first_name":"Simone Anna","last_name":"Opel"},{"first_name":"Lea","last_name":"Budde","full_name":"Budde, Lea","id":"32443"},{"id":"60311","full_name":"Schulte, Carsten","first_name":"Carsten","last_name":"Schulte"}],"publication_status":"published","date_updated":"2022-07-26T11:41:41Z","intvolume":"        12","main_file_link":[{"url":"http://cyprusconferences.org/issep2019/wp-content/uploads/2019/10/LocalISSEP-v5.pdf"}],"language":[{"iso":"eng"}],"citation":{"chicago":"Schlichtig, Michael, Simone Anna Opel, Lea Budde, and Carsten Schulte. “Understanding Artificial Intelligence – A Project for the Development of Comprehensive Teaching Material.” In <i>ISSEP 2019 - 12th International Conference on Informatics in Schools: Situation, Evaluation and Perspectives, Local Proceedings</i>, edited by Eglė Jasutė and Sergei Pozdniakov, 12:65–73, 2019.","short":"M. Schlichtig, S.A. Opel, L. Budde, C. Schulte, in: E. Jasutė, S. Pozdniakov (Eds.), ISSEP 2019 - 12th International Conference on Informatics in Schools: Situation, Evaluation and Perspectives, Local Proceedings, 2019, pp. 65–73.","ieee":"M. Schlichtig, S. A. Opel, L. Budde, and C. Schulte, “Understanding Artificial Intelligence – A Project for the Development of Comprehensive Teaching Material,” in <i>ISSEP 2019 - 12th International conference on informatics in schools: Situation, evaluation and perspectives, Local Proceedings</i>, Lanarca, 2019, vol. 12, pp. 65–73.","apa":"Schlichtig, M., Opel, S. A., Budde, L., &#38; Schulte, C. (2019). Understanding Artificial Intelligence – A Project for the Development of Comprehensive Teaching Material. In E. Jasutė &#38; S. Pozdniakov (Eds.), <i>ISSEP 2019 - 12th International conference on informatics in schools: Situation, evaluation and perspectives, Local Proceedings</i> (Vol. 12, pp. 65–73).","bibtex":"@inproceedings{Schlichtig_Opel_Budde_Schulte_2019, title={Understanding Artificial Intelligence – A Project for the Development of Comprehensive Teaching Material}, volume={12}, booktitle={ISSEP 2019 - 12th International conference on informatics in schools: Situation, evaluation and perspectives, Local Proceedings}, author={Schlichtig, Michael and Opel, Simone Anna and Budde, Lea and Schulte, Carsten}, editor={Jasutė, Eglė and Pozdniakov, Sergei}, year={2019}, pages={65–73} }","ama":"Schlichtig M, Opel SA, Budde L, Schulte C. Understanding Artificial Intelligence – A Project for the Development of Comprehensive Teaching Material. In: Jasutė E, Pozdniakov S, eds. <i>ISSEP 2019 - 12th International Conference on Informatics in Schools: Situation, Evaluation and Perspectives, Local Proceedings</i>. Vol 12. ; 2019:65-73.","mla":"Schlichtig, Michael, et al. “Understanding Artificial Intelligence – A Project for the Development of Comprehensive Teaching Material.” <i>ISSEP 2019 - 12th International Conference on Informatics in Schools: Situation, Evaluation and Perspectives, Local Proceedings</i>, edited by Eglė Jasutė and Sergei Pozdniakov, vol. 12, 2019, pp. 65–73."},"quality_controlled":"1","status":"public","conference":{"location":"Lanarca","start_date":"2019-11-18","name":"ISSEP 2019 - 12th International conference on informatics in schools: Situation, evaluation and perspectives","end_date":"2019-11-20"},"page":"65 - 73","_id":"15332","user_id":"32312","volume":12,"editor":[{"full_name":"Jasutė, Eglė","first_name":"Eglė","last_name":"Jasutė"},{"full_name":"Pozdniakov, Sergei","last_name":"Pozdniakov","first_name":"Sergei"}]},{"title":"Developing Teaching Materials on Artificial Intelligence by Using a Simulation Game (Work in Progress)","year":"2019","status":"public","author":[{"id":"72932","last_name":"Opel","first_name":"Simone Anna","full_name":"Opel, Simone Anna"},{"id":"32312","orcid":"0000-0001-6600-6171","first_name":"Michael","last_name":"Schlichtig","full_name":"Schlichtig, Michael"},{"id":"60311","first_name":"Carsten","last_name":"Schulte","full_name":"Schulte, Carsten"}],"date_updated":"2022-07-26T11:41:51Z","page":"11:1-11:2","_id":"15643","language":[{"iso":"eng"}],"publisher":"ACM","user_id":"32312","publication":"WiPSCE","citation":{"mla":"Opel, Simone Anna, et al. “Developing Teaching Materials on Artificial Intelligence by Using a Simulation Game (Work in Progress).” <i>WiPSCE</i>, ACM, 2019, p. 11:1-11:2.","apa":"Opel, S. A., Schlichtig, M., &#38; Schulte, C. (2019). Developing Teaching Materials on Artificial Intelligence by Using a Simulation Game (Work in Progress). <i>WiPSCE</i>, 11:1-11:2.","ieee":"S. A. Opel, M. Schlichtig, and C. Schulte, “Developing Teaching Materials on Artificial Intelligence by Using a Simulation Game (Work in Progress),” in <i>WiPSCE</i>, 2019, p. 11:1-11:2.","ama":"Opel SA, Schlichtig M, Schulte C. Developing Teaching Materials on Artificial Intelligence by Using a Simulation Game (Work in Progress). In: <i>WiPSCE</i>. ACM; 2019:11:1-11:2.","short":"S.A. Opel, M. Schlichtig, C. Schulte, in: WiPSCE, ACM, 2019, p. 11:1-11:2.","chicago":"Opel, Simone Anna, Michael Schlichtig, and Carsten Schulte. “Developing Teaching Materials on Artificial Intelligence by Using a Simulation Game (Work in Progress).” In <i>WiPSCE</i>, 11:1-11:2. ACM, 2019.","bibtex":"@inproceedings{Opel_Schlichtig_Schulte_2019, title={Developing Teaching Materials on Artificial Intelligence by Using a Simulation Game (Work in Progress)}, booktitle={WiPSCE}, publisher={ACM}, author={Opel, Simone Anna and Schlichtig, Michael and Schulte, Carsten}, year={2019}, pages={11:1-11:2} }"},"quality_controlled":"1","date_created":"2020-01-28T10:28:37Z","type":"conference","department":[{"_id":"67"}]},{"date_created":"2019-09-17T14:42:43Z","type":"conference","department":[{"_id":"600"},{"_id":"568"}],"publication":"Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom","citation":{"short":"W.-F. Chen, K. Al-Khatib, M. Hagen, H. Wachsmuth, B. Stein, in: Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom, 2019, pp. 76–82.","chicago":"Chen, Wei-Fan, Khalid Al-Khatib, Matthias Hagen, Henning Wachsmuth, and Benno Stein. “Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition.” In <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>, 76–82, 2019.","apa":"Chen, W.-F., Al-Khatib, K., Hagen, M., Wachsmuth, H., &#38; Stein, B. (2019). Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition. <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>, 76–82.","ieee":"W.-F. Chen, K. Al-Khatib, M. Hagen, H. Wachsmuth, and B. Stein, “Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition,” in <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>, 2019, pp. 76–82.","ama":"Chen W-F, Al-Khatib K, Hagen M, Wachsmuth H, Stein B. Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition. In: <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>. ; 2019:76-82.","bibtex":"@inproceedings{Chen_Al-Khatib_Hagen_Wachsmuth_Stein_2019, title={Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition}, booktitle={Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom}, author={Chen, Wei-Fan and Al-Khatib, Khalid and Hagen, Matthias and Wachsmuth, Henning and Stein, Benno}, year={2019}, pages={76–82} }","mla":"Chen, Wei-Fan, et al. “Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition.” <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>, 2019, pp. 76–82."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"page":"76-82","main_file_link":[{"url":"https://www.aclweb.org/anthology/D19-5009.pdf"}],"_id":"13259","language":[{"iso":"eng"}],"user_id":"82920","title":"Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition","year":"2019","status":"public","author":[{"last_name":"Chen","first_name":"Wei-Fan","full_name":"Chen, Wei-Fan","id":"82920"},{"full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib","first_name":"Khalid"},{"last_name":"Hagen","first_name":"Matthias","full_name":"Hagen, Matthias"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"},{"full_name":"Stein, Benno","first_name":"Benno","last_name":"Stein"}],"date_updated":"2022-05-09T15:04:18Z"},{"_id":"13904","user_id":"25078","ddc":["006"],"conference":{"location":"London","start_date":"2019-11-11","name":"26th ACM Conference on Computer and Communications Security","end_date":"2019-11-15"},"status":"public","has_accepted_license":"1","oa":"1","citation":{"chicago":"Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens. “Updatable Anonymous Credentials and Applications to Incentive Systems.” In <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>.","short":"J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.","apa":"Blömer, J., Bobolz, J., Diemert, D. P., &#38; Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. 26th ACM Conference on Computer and Communications Security, London. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>","ieee":"J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,” presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi: <a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>.","ama":"Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>","bibtex":"@inproceedings{Blömer_Bobolz_Diemert_Eidens_2019, series={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, title={Updatable Anonymous Credentials and Applications to Incentive Systems}, DOI={<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>}, booktitle={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, author={Blömer, Johannes and Bobolz, Jan and Diemert, Denis Pascal and Eidens, Fabian}, year={2019}, collection={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19} }","mla":"Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.” <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>, 2019, doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>."},"file_date_updated":"2019-10-18T08:07:49Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"language":[{"iso":"eng"}],"series_title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/169.pdf"}],"doi":"10.1145/3319535.3354223","author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"full_name":"Bobolz, Jan","first_name":"Jan","last_name":"Bobolz","id":"27207"},{"first_name":"Denis Pascal","last_name":"Diemert","full_name":"Diemert, Denis Pascal","id":"44071"},{"id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian","last_name":"Eidens"}],"title":"Updatable Anonymous Credentials and Applications to Incentive Systems","year":"2019","date_updated":"2023-01-10T10:25:27Z","date_created":"2019-10-18T08:09:44Z","file":[{"creator":"jbobolz","date_created":"2019-10-18T08:07:49Z","relation":"main_file","date_updated":"2019-10-18T08:07:49Z","file_name":"full_eprinted_v2.pdf","file_size":838949,"access_level":"closed","file_id":"13907","content_type":"application/pdf"}],"department":[{"_id":"7"},{"_id":"64"}],"type":"conference","publication":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","abstract":[{"text":"In this paper, we introduce updatable anonymous credential systems (UACS) and use them to construct a new privacy-preserving incentive system. In a UACS, a user holding a credential certifying some attributes can interact with the corresponding issuer to update his attributes. During this, the issuer knows which update function is run, but does not learn the user's previous attributes. Hence the update process preserves anonymity of the user. One example for a class of update functions are additive updates of integer attributes, where the issuer increments an unknown integer attribute value v by some known value k. This kind of update is motivated by an application of UACS to incentive systems. Users in an incentive system can anonymously accumulate points, e.g. in a shop at checkout, and spend them later, e.g. for a discount.","lang":"eng"}]},{"abstract":[{"lang":"eng","text":"This paper addresses multimodality of multi-objective (MO) optimization landscapes. Contrary to common perception of local optima, according to which they are hindering the progress of optimization algorithms, it will be shown that local efficient sets in a multi-objective setting can assist optimizers in finding global efficient sets. We use sophisticated visualization techniques, which rely on gradient field heatmaps, to highlight those insights into landscape characteristics. Finally, the MO local optimizer MOGSA is introduced, which exploits those observations by sliding down the multi-objective gradient hill and moving along the local efficient sets."}],"publication":"Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO)","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","date_created":"2023-08-04T07:49:08Z","intvolume":"     11411","date_updated":"2023-10-16T13:31:03Z","author":[{"full_name":"Grimme, Christian","first_name":"Christian","last_name":"Grimme"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740"}],"title":"Multimodality in Multi-Objective Optimization — More Boon than Bane?","year":"2019","doi":"10.1007/978-3-030-12598-1_11","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"citation":{"short":"C. Grimme, P. Kerschke, H. Trautmann, in: K. Deb, E. Goodman, C.C.A. Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed (Eds.), Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO), Springer, East Lansing, MI, USA, 2019, pp. 126–138.","chicago":"Grimme, Christian, Pascal Kerschke, and Heike Trautmann. “Multimodality in Multi-Objective Optimization — More Boon than Bane?” In <i>Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb, Erik Goodman, Coello Carlos A. Coello, Kathrin Klamroth, Kaisa Miettinen, Sanaz Mostaghim, and Patrick Reed, 11411:126–138. Lecture Notes in Computer Science. East Lansing, MI, USA: Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_11\">https://doi.org/10.1007/978-3-030-12598-1_11</a>.","apa":"Grimme, C., Kerschke, P., &#38; Trautmann, H. (2019). Multimodality in Multi-Objective Optimization — More Boon than Bane? In K. Deb, E. Goodman, C. C. A. Coello, K. Klamroth, K. Miettinen, S. Mostaghim, &#38; P. Reed (Eds.), <i>Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO)</i> (Vol. 11411, pp. 126–138). Springer. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_11\">https://doi.org/10.1007/978-3-030-12598-1_11</a>","ieee":"C. Grimme, P. Kerschke, and H. Trautmann, “Multimodality in Multi-Objective Optimization — More Boon than Bane?,” in <i>Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO)</i>, 2019, vol. 11411, pp. 126–138, doi: <a href=\"https://doi.org/10.1007/978-3-030-12598-1_11\">10.1007/978-3-030-12598-1_11</a>.","ama":"Grimme C, Kerschke P, Trautmann H. Multimodality in Multi-Objective Optimization — More Boon than Bane? In: Deb K, Goodman E, Coello CCA, et al., eds. <i>Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO)</i>. Vol 11411. Lecture Notes in Computer Science. Springer; 2019:126–138. doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_11\">10.1007/978-3-030-12598-1_11</a>","bibtex":"@inproceedings{Grimme_Kerschke_Trautmann_2019, place={East Lansing, MI, USA}, series={Lecture Notes in Computer Science}, title={Multimodality in Multi-Objective Optimization — More Boon than Bane?}, volume={11411}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-12598-1_11\">10.1007/978-3-030-12598-1_11</a>}, booktitle={Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer}, author={Grimme, Christian and Kerschke, Pascal and Trautmann, Heike}, editor={Deb, Kalyanmoy and Goodman, Erik and Coello, Coello Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={126–138}, collection={Lecture Notes in Computer Science} }","mla":"Grimme, Christian, et al. “Multimodality in Multi-Objective Optimization — More Boon than Bane?” <i>Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb et al., vol. 11411, Springer, 2019, pp. 126–138, doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_11\">10.1007/978-3-030-12598-1_11</a>."},"place":"East Lansing, MI, USA","status":"public","volume":11411,"editor":[{"full_name":"Deb, Kalyanmoy","first_name":"Kalyanmoy","last_name":"Deb"},{"first_name":"Erik","last_name":"Goodman","full_name":"Goodman, Erik"},{"last_name":"Coello","first_name":"Coello Carlos A.","full_name":"Coello, Coello Carlos A."},{"first_name":"Kathrin","last_name":"Klamroth","full_name":"Klamroth, Kathrin"},{"full_name":"Miettinen, Kaisa","last_name":"Miettinen","first_name":"Kaisa"},{"full_name":"Mostaghim, Sanaz","first_name":"Sanaz","last_name":"Mostaghim"},{"full_name":"Reed, Patrick","last_name":"Reed","first_name":"Patrick"}],"user_id":"15504","_id":"46343","publisher":"Springer","page":"126–138"},{"abstract":[{"text":"It has long been observed that for practically any computational problem that has been intensely studied, different instances are best solved using different algorithms. This is particularly pronounced for computationally hard problems, where in most cases, no single algorithm defines the state of the art; instead, there is a set of algorithms with complementary strengths. This performance complementarity can be exploited in various ways, one of which is based on the idea of selecting, from a set of given algorithms, for each problem instance to be solved the one expected to perform best. The task of automatically selecting an algorithm from a given set is known as the per-instance algorithm selection problem and has been intensely studied over the past 15 years, leading to major improvements in the state of the art in solving a growing number of discrete combinatorial problems, including propositional satisfiability and AI planning. Per-instance algorithm selection also shows much promise for boosting performance in solving continuous and mixed discrete/continuous optimisation problems. This survey provides an overview of research in automated algorithm selection, ranging from early and seminal works to recent and promising application areas. Different from earlier work, it covers applications to discrete and continuous problems, and discusses algorithm selection in context with conceptually related approaches, such as algorithm configuration, scheduling, or portfolio selection. Since informative and cheaply computable problem instance features provide the basis for effective per-instance algorithm selection systems, we also provide an overview of such features for discrete and continuous problems. Finally, we provide perspectives on future work in the area and discuss a number of open research challenges.","lang":"eng"}],"publication":"Evolutionary Computation (ECJ)","issue":"1","citation":{"mla":"Kerschke, Pascal, et al. “Automated Algorithm Selection: Survey and Perspectives.” <i>Evolutionary Computation (ECJ)</i>, vol. 27, no. 1, 2019, pp. 3–45, doi:<a href=\"https://doi.org/10.1162/evco_a_00242\">10.1162/evco_a_00242</a>.","ama":"Kerschke P, Hoos HH, Neumann F, Trautmann H. Automated Algorithm Selection: Survey and Perspectives. <i>Evolutionary Computation (ECJ)</i>. 2019;27(1):3–45. doi:<a href=\"https://doi.org/10.1162/evco_a_00242\">10.1162/evco_a_00242</a>","bibtex":"@article{Kerschke_Hoos_Neumann_Trautmann_2019, title={Automated Algorithm Selection: Survey and Perspectives}, volume={27}, DOI={<a href=\"https://doi.org/10.1162/evco_a_00242\">10.1162/evco_a_00242</a>}, number={1}, journal={Evolutionary Computation (ECJ)}, author={Kerschke, Pascal and Hoos, Holger H and Neumann, Frank and Trautmann, Heike}, year={2019}, pages={3–45} }","apa":"Kerschke, P., Hoos, H. H., Neumann, F., &#38; Trautmann, H. (2019). Automated Algorithm Selection: Survey and Perspectives. <i>Evolutionary Computation (ECJ)</i>, <i>27</i>(1), 3–45. <a href=\"https://doi.org/10.1162/evco_a_00242\">https://doi.org/10.1162/evco_a_00242</a>","ieee":"P. Kerschke, H. H. Hoos, F. Neumann, and H. Trautmann, “Automated Algorithm Selection: Survey and Perspectives,” <i>Evolutionary Computation (ECJ)</i>, vol. 27, no. 1, pp. 3–45, 2019, doi: <a href=\"https://doi.org/10.1162/evco_a_00242\">10.1162/evco_a_00242</a>.","chicago":"Kerschke, Pascal, Holger H Hoos, Frank Neumann, and Heike Trautmann. “Automated Algorithm Selection: Survey and Perspectives.” <i>Evolutionary Computation (ECJ)</i> 27, no. 1 (2019): 3–45. <a href=\"https://doi.org/10.1162/evco_a_00242\">https://doi.org/10.1162/evco_a_00242</a>.","short":"P. Kerschke, H.H. Hoos, F. Neumann, H. Trautmann, Evolutionary Computation (ECJ) 27 (2019) 3–45."},"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T07:50:33Z","date_updated":"2023-10-16T13:31:40Z","intvolume":"        27","year":"2019","status":"public","title":"Automated Algorithm Selection: Survey and Perspectives","author":[{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"full_name":"Hoos, Holger H","first_name":"Holger H","last_name":"Hoos"},{"last_name":"Neumann","first_name":"Frank","full_name":"Neumann, Frank"},{"id":"100740","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"doi":"10.1162/evco_a_00242","user_id":"15504","volume":27,"page":"3–45","_id":"46345","language":[{"iso":"eng"}]},{"date_created":"2023-08-04T07:49:47Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","citation":{"chicago":"Carnein, Matthias, and Heike Trautmann. “Optimizing Data Stream Representation: An Extensive Survey on Stream Clustering Algorithms.” <i>Business and Information Systems Engineering (BISE)</i> 61, no. 3 (2019): 277–297.","short":"M. Carnein, H. Trautmann, Business and Information Systems Engineering (BISE) 61 (2019) 277–297.","ama":"Carnein M, Trautmann H. Optimizing Data Stream Representation: An Extensive Survey on Stream Clustering Algorithms. <i>Business and Information Systems Engineering (BISE)</i>. 2019;61(3):277–297.","bibtex":"@article{Carnein_Trautmann_2019, title={Optimizing Data Stream Representation: An Extensive Survey on Stream Clustering Algorithms}, volume={61}, number={3}, journal={Business and Information Systems Engineering (BISE)}, author={Carnein, Matthias and Trautmann, Heike}, year={2019}, pages={277–297} }","apa":"Carnein, M., &#38; Trautmann, H. (2019). Optimizing Data Stream Representation: An Extensive Survey on Stream Clustering Algorithms. <i>Business and Information Systems Engineering (BISE)</i>, <i>61</i>(3), 277–297.","mla":"Carnein, Matthias, and Heike Trautmann. “Optimizing Data Stream Representation: An Extensive Survey on Stream Clustering Algorithms.” <i>Business and Information Systems Engineering (BISE)</i>, vol. 61, no. 3, 2019, pp. 277–297.","ieee":"M. Carnein and H. Trautmann, “Optimizing Data Stream Representation: An Extensive Survey on Stream Clustering Algorithms,” <i>Business and Information Systems Engineering (BISE)</i>, vol. 61, no. 3, pp. 277–297, 2019."},"publication":"Business and Information Systems Engineering (BISE)","issue":"3","abstract":[{"text":"Analyzing data streams has received considerable attention over the past decades due to the widespread usage of sensors, social media and other streaming data sources. A core research area in this field is stream clustering which aims to recognize patterns in an unordered, infinite and evolving stream of observations. Clustering can be a crucial support in decision making, since it aims for an optimized aggregated representation of a continuous data stream over time and allows to identify patterns in large and high-dimensional data. A multitude of algorithms and approaches has been developed that are able to find and maintain clusters over time in the challenging streaming scenario. This survey explores, summarizes and categorizes a total of 51 stream clustering algorithms and identifies core research threads over the past decades. In particular, it identifies categories of algorithms based on distance thresholds, density grids and statistical models as well as algorithms for high dimensional data. Furthermore, it discusses applications scenarios, available software and how to configure stream clustering algorithms. This survey is considerably more extensive than comparable studies, more up-to-date and highlights how concepts are interrelated and have been developed over time.","lang":"eng"}],"_id":"46344","language":[{"iso":"eng"}],"page":"277–297","volume":61,"user_id":"15504","author":[{"full_name":"Carnein, Matthias","last_name":"Carnein","first_name":"Matthias"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}],"title":"Optimizing Data Stream Representation: An Extensive Survey on Stream Clustering Algorithms","year":"2019","status":"public","intvolume":"        61","date_updated":"2023-10-16T13:31:21Z"},{"page":"65–74","_id":"46340","language":[{"iso":"eng"}],"user_id":"15504","title":"A Recommender System Based on Omni-Channel Customer Data","year":"2019","status":"public","author":[{"first_name":"Matthias","last_name":"Carnein","full_name":"Carnein, Matthias"},{"first_name":"Leschek","last_name":"Homann","full_name":"Homann, Leschek"},{"id":"100740","full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"},{"full_name":"Vossen, Gottfried","last_name":"Vossen","first_name":"Gottfried"}],"date_updated":"2023-10-16T13:29:53Z","place":"Moscow, Russia","date_created":"2023-08-04T07:46:20Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"publication":"Proceedings of the 21$^st$ IEEE Conference on Business Informatics (CBI’ 19)","citation":{"mla":"Carnein, Matthias, et al. “A Recommender System Based on Omni-Channel Customer Data.” <i>Proceedings of the 21$^st$ IEEE Conference on Business Informatics (CBI’ 19)</i>, 2019, pp. 65–74.","ama":"Carnein M, Homann L, Trautmann H, Vossen G. A Recommender System Based on Omni-Channel Customer Data. In: <i>Proceedings of the 21$^st$ IEEE Conference on Business Informatics (CBI’ 19)</i>. ; 2019:65–74.","bibtex":"@inproceedings{Carnein_Homann_Trautmann_Vossen_2019, place={Moscow, Russia}, title={A Recommender System Based on Omni-Channel Customer Data}, booktitle={Proceedings of the 21$^st$ IEEE Conference on Business Informatics (CBI’ 19)}, author={Carnein, Matthias and Homann, Leschek and Trautmann, Heike and Vossen, Gottfried}, year={2019}, pages={65–74} }","apa":"Carnein, M., Homann, L., Trautmann, H., &#38; Vossen, G. (2019). A Recommender System Based on Omni-Channel Customer Data. <i>Proceedings of the 21$^st$ IEEE Conference on Business Informatics (CBI’ 19)</i>, 65–74.","ieee":"M. Carnein, L. Homann, H. Trautmann, and G. Vossen, “A Recommender System Based on Omni-Channel Customer Data,” in <i>Proceedings of the 21$^st$ IEEE Conference on Business Informatics (CBI’ 19)</i>, 2019, pp. 65–74.","short":"M. Carnein, L. Homann, H. Trautmann, G. Vossen, in: Proceedings of the 21$^st$ IEEE Conference on Business Informatics (CBI’ 19), Moscow, Russia, 2019, pp. 65–74.","chicago":"Carnein, Matthias, Leschek Homann, Heike Trautmann, and Gottfried Vossen. “A Recommender System Based on Omni-Channel Customer Data.” In <i>Proceedings of the 21$^st$ IEEE Conference on Business Informatics (CBI’ 19)</i>, 65–74. Moscow, Russia, 2019."},"abstract":[{"text":"Recommender systems aim to provide personalized suggestions to customers which products to buy or services to consume. They can help to increase sales by helping customers discover new and relevant products. Traditionally, recommender systems use the purchase history of a customer, e.g., the purchased quantity or properties of the items. While this allows to build personalized recommendations, it is a very limited view of the problem. Nowadays, extensive information about customers and their personal preferences is available which goes far beyond their purchase behaviour. For example, customers reveal their preferences in social media, by their browsing habits and online search behaviour or their interest in specific newsletters. In this paper, we investigate how information from different sources and channels can be collected and incorporated into the recommendation process. We demonstrate this, based on a real-life case study of a retailer with several million transactions. We discuss how to employ a recommender system in this scenario, evaluate various recommendation strategies and describe how to incorporate information from different sources and channels, both internal and external. Our results show that the recommendations can be better tailored to the personal preferences of customers.","lang":"eng"}]},{"abstract":[{"text":"Customer Segmentation aims to identify groups of customers that share similar interest or behaviour. It is an essential tool in marketing and can be used to target customer segments with tailored marketing strategies. Customer segmentation is often based on clustering techniques. This analysis is typically performed as a snapshot analysis where segments are identified at a specific point in time. However, this ignores the fact that customer segments are highly volatile and segments change over time. Once segments change, the entire analysis needs to be repeated and strategies adapted. In this paper we explore stream clustering as a tool to alleviate this problem. We propose a new stream clustering algorithm which allows to identify and track customer segments over time. The biggest challenge is that customer segmentation often relies on the transaction history of a customer. Since this data changes over time, it is necessary to update customers which have already been incorporated into the clustering. We show how to perform this step incrementally, without the need for periodic re-computations. As a result, customer segmentation can be performed continuously, faster and is more scalable. We demonstrate the performance of our algorithm using a large real-life case study.","lang":"eng"}],"citation":{"short":"M. Carnein, H. Trautmann, in: Proceedings of the 23$^rd$ Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD ’19), Macau, China, 2019, pp. 280–292.","chicago":"Carnein, Matthias, and Heike Trautmann. “Customer Segmentation Based on Transactional Data Using Stream Clustering.” In <i>Proceedings of the 23$^rd$ Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD ’19)</i>, 280–292. Macau, China, 2019.","apa":"Carnein, M., &#38; Trautmann, H. (2019). Customer Segmentation Based on Transactional Data Using Stream Clustering. <i>Proceedings of the 23$^rd$ Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD ’19)</i>, 280–292.","ieee":"M. Carnein and H. Trautmann, “Customer Segmentation Based on Transactional Data Using Stream Clustering,” in <i>Proceedings of the 23$^rd$ Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD ’19)</i>, 2019, pp. 280–292.","ama":"Carnein M, Trautmann H. Customer Segmentation Based on Transactional Data Using Stream Clustering. In: <i>Proceedings of the 23$^rd$ Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD ’19)</i>. ; 2019:280–292.","bibtex":"@inproceedings{Carnein_Trautmann_2019, place={Macau, China}, title={Customer Segmentation Based on Transactional Data Using Stream Clustering}, booktitle={Proceedings of the 23$^rd$ Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD ’19)}, author={Carnein, Matthias and Trautmann, Heike}, year={2019}, pages={280–292} }","mla":"Carnein, Matthias, and Heike Trautmann. “Customer Segmentation Based on Transactional Data Using Stream Clustering.” <i>Proceedings of the 23$^rd$ Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD ’19)</i>, 2019, pp. 280–292."},"publication":"Proceedings of the 23$^rd$ Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD ’19)","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","date_created":"2023-08-04T07:47:20Z","place":"Macau, China","date_updated":"2023-10-16T13:30:10Z","author":[{"last_name":"Carnein","first_name":"Matthias","full_name":"Carnein, Matthias"},{"id":"100740","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"title":"Customer Segmentation Based on Transactional Data Using Stream Clustering","status":"public","year":"2019","user_id":"15504","language":[{"iso":"eng"}],"_id":"46341","page":"280–292"},{"user_id":"15504","doi":"10.1063/1.5090019","page":"020052-1-020052-4","_id":"46342","publisher":"AIP Publishing","language":[{"iso":"eng"}],"date_updated":"2023-10-16T13:30:43Z","year":"2019","status":"public","title":"Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization","author":[{"last_name":"Grimme","first_name":"Christian","full_name":"Grimme, Christian"},{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"},{"full_name":"Emmerich, Michael T M","last_name":"Emmerich","first_name":"Michael T M"},{"full_name":"Preuss, Mike","first_name":"Mike","last_name":"Preuss"},{"full_name":"Deutz, André H","last_name":"Deutz","first_name":"André H"},{"full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","id":"100740"}],"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T07:48:15Z","place":"Leiden, The Netherlands","abstract":[{"text":"There is a range of phenomena in continuous, global multi-objective optimization, that cannot occur in single-objective optimization. For instance, in some multi-objective optimization problems it is possible to follow continuous paths of gradients of straightforward weighted scalarization functions, starting from locally efficient solutions, in order to reach globally Pareto optimal solutions. This paper seeks to better characterize multimodal multi-objective landscapes and to better understand the transitions from local optima to global optima in simple, path-oriented search procedures.","lang":"eng"}],"publication":"AIP Conference Proceedings","citation":{"mla":"Grimme, Christian, et al. “Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization.” <i>AIP Conference Proceedings</i>, AIP Publishing, 2019, pp. 020052-1-020052–54, doi:<a href=\"https://doi.org/10.1063/1.5090019\">10.1063/1.5090019</a>.","ama":"Grimme C, Kerschke P, Emmerich MTM, Preuss M, Deutz AH, Trautmann H. Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization. In: <i>AIP Conference Proceedings</i>. AIP Publishing; 2019:020052-1-020052-020054. doi:<a href=\"https://doi.org/10.1063/1.5090019\">10.1063/1.5090019</a>","bibtex":"@inproceedings{Grimme_Kerschke_Emmerich_Preuss_Deutz_Trautmann_2019, place={Leiden, The Netherlands}, title={Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization}, DOI={<a href=\"https://doi.org/10.1063/1.5090019\">10.1063/1.5090019</a>}, booktitle={AIP Conference Proceedings}, publisher={AIP Publishing}, author={Grimme, Christian and Kerschke, Pascal and Emmerich, Michael T M and Preuss, Mike and Deutz, André H and Trautmann, Heike}, year={2019}, pages={020052-1-020052–4} }","apa":"Grimme, C., Kerschke, P., Emmerich, M. T. M., Preuss, M., Deutz, A. H., &#38; Trautmann, H. (2019). Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization. <i>AIP Conference Proceedings</i>, 020052-1-020052–020054. <a href=\"https://doi.org/10.1063/1.5090019\">https://doi.org/10.1063/1.5090019</a>","ieee":"C. Grimme, P. Kerschke, M. T. M. Emmerich, M. Preuss, A. H. Deutz, and H. Trautmann, “Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization,” in <i>AIP Conference Proceedings</i>, 2019, pp. 020052-1-020052–4, doi: <a href=\"https://doi.org/10.1063/1.5090019\">10.1063/1.5090019</a>.","chicago":"Grimme, Christian, Pascal Kerschke, Michael T M Emmerich, Mike Preuss, André H Deutz, and Heike Trautmann. “Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization.” In <i>AIP Conference Proceedings</i>, 020052-1-020052–54. Leiden, The Netherlands: AIP Publishing, 2019. <a href=\"https://doi.org/10.1063/1.5090019\">https://doi.org/10.1063/1.5090019</a>.","short":"C. Grimme, P. Kerschke, M.T.M. Emmerich, M. Preuss, A.H. Deutz, H. Trautmann, in: AIP Conference Proceedings, AIP Publishing, Leiden, The Netherlands, 2019, pp. 020052-1-020052–4."}},{"page":"93–123","language":[{"iso":"eng"}],"_id":"46336","publisher":"Springer","user_id":"15504","doi":"10.1007/978-3-030-25147-5_7","editor":[{"full_name":"Bauer, Nadja","first_name":"Nadja","last_name":"Bauer"},{"last_name":"Ickstadt","first_name":"Katja","full_name":"Ickstadt, Katja"},{"first_name":"Karsten","last_name":"Lübke","full_name":"Lübke, Karsten"},{"full_name":"Szepannek, Gero","last_name":"Szepannek","first_name":"Gero"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"},{"full_name":"Vichi, Maurizio","first_name":"Maurizio","last_name":"Vichi"}],"title":"Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco","status":"public","year":"2019","author":[{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}],"date_updated":"2023-10-16T13:08:22Z","date_created":"2023-08-04T07:43:30Z","type":"book_chapter","department":[{"_id":"34"},{"_id":"819"}],"publication":"Applications in Statistical Computing","citation":{"ieee":"P. Kerschke and H. Trautmann, “Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco,” in <i>Applications in Statistical Computing</i>, N. Bauer, K. Ickstadt, K. Lübke, G. Szepannek, H. Trautmann, and M. Vichi, Eds. Springer, 2019, pp. 93–123.","apa":"Kerschke, P., &#38; Trautmann, H. (2019). Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco. In N. Bauer, K. Ickstadt, K. Lübke, G. Szepannek, H. Trautmann, &#38; M. Vichi (Eds.), <i>Applications in Statistical Computing</i> (pp. 93–123). Springer. <a href=\"https://doi.org/10.1007/978-3-030-25147-5_7\">https://doi.org/10.1007/978-3-030-25147-5_7</a>","short":"P. Kerschke, H. Trautmann, in: N. Bauer, K. Ickstadt, K. Lübke, G. Szepannek, H. Trautmann, M. Vichi (Eds.), Applications in Statistical Computing, Springer, 2019, pp. 93–123.","chicago":"Kerschke, Pascal, and Heike Trautmann. “Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-Package Flacco.” In <i>Applications in Statistical Computing</i>, edited by Nadja Bauer, Katja Ickstadt, Karsten Lübke, Gero Szepannek, Heike Trautmann, and Maurizio Vichi, 93–123. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-25147-5_7\">https://doi.org/10.1007/978-3-030-25147-5_7</a>.","mla":"Kerschke, Pascal, and Heike Trautmann. “Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-Package Flacco.” <i>Applications in Statistical Computing</i>, edited by Nadja Bauer et al., Springer, 2019, pp. 93–123, doi:<a href=\"https://doi.org/10.1007/978-3-030-25147-5_7\">10.1007/978-3-030-25147-5_7</a>.","bibtex":"@inbook{Kerschke_Trautmann_2019, title={Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-25147-5_7\">10.1007/978-3-030-25147-5_7</a>}, booktitle={Applications in Statistical Computing}, publisher={Springer}, author={Kerschke, Pascal and Trautmann, Heike}, editor={Bauer, Nadja and Ickstadt, Katja and Lübke, Karsten and Szepannek, Gero and Trautmann, Heike and Vichi, Maurizio}, year={2019}, pages={93–123} }","ama":"Kerschke P, Trautmann H. Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco. In: Bauer N, Ickstadt K, Lübke K, Szepannek G, Trautmann H, Vichi M, eds. <i>Applications in Statistical Computing</i>. Springer; 2019:93–123. doi:<a href=\"https://doi.org/10.1007/978-3-030-25147-5_7\">10.1007/978-3-030-25147-5_7</a>"},"abstract":[{"lang":"eng","text":"Choosing the best-performing optimizer(s) out of a portfolio of optimization algorithms is usually a difficult and complex task. It gets even worse, if the underlying functions are unknown, i.e., so-called black-box problems, and function evaluations are considered to be expensive. In case of continuous single-objective optimization problems, exploratory landscape analysis (ELA), a sophisticated and effective approach for characterizing the landscapes of such problems by means of numerical values before actually performing the optimization task itself, is advantageous. Unfortunately, until now it has been quite complicated to compute multiple ELA features simultaneously, as the corresponding code has been—if at all—spread across multiple platforms or at least across several packages within these platforms. This article presents a broad summary of existing ELA approaches and introduces flacco, an R-package for feature-based landscape analysis of continuous and constrained optimization problems. Although its functions neither solve the optimization problem itself nor the related algorithm selection problem (ASP), it offers easy access to an essential ingredient of the ASP by providing a wide collection of ELA features on a single platform—even within a single package. In addition, flacco provides multiple visualization techniques, which enhance the understanding of some of these numerical features, and thereby make certain landscape properties more comprehensible. On top of that, we will introduce the package’s built-in, as well as web-hosted and hence platform-independent, graphical user interface (GUI). It facilitates the usage of the package—especially for people who are not familiar with R—and thus makes flacco a very convenient toolbox when working towards algorithm selection of continuous single-objective optimization problems."}]},{"user_id":"15504","_id":"46335","series_title":"Studies in Classification, Data Analysis, and Knowledge Organization","language":[{"iso":"eng"}],"publisher":"Springer International Publishing","date_updated":"2023-10-16T13:07:21Z","author":[{"full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","id":"100740"}],"publication_identifier":{"isbn":["978-3-030-25147-5"]},"status":"public","year":"2019","title":"Applications in Statistical Computing — From Music Data Analysis to Industrial Quality Improvement","department":[{"_id":"34"},{"_id":"819"}],"type":"book","date_created":"2023-08-04T07:43:09Z","citation":{"bibtex":"@book{Trautmann_2019, series={Studies in Classification, Data Analysis, and Knowledge Organization}, title={Applications in Statistical Computing — From Music Data Analysis to Industrial Quality Improvement}, publisher={Springer International Publishing}, author={Trautmann, Heike}, year={2019}, collection={Studies in Classification, Data Analysis, and Knowledge Organization} }","chicago":"Trautmann, Heike. <i>Applications in Statistical Computing — From Music Data Analysis to Industrial Quality Improvement</i>. Studies in Classification, Data Analysis, and Knowledge Organization. Springer International Publishing, 2019.","short":"H. Trautmann, Applications in Statistical Computing — From Music Data Analysis to Industrial Quality Improvement, Springer International Publishing, 2019.","ama":"Trautmann H. <i>Applications in Statistical Computing — From Music Data Analysis to Industrial Quality Improvement</i>. Springer International Publishing; 2019.","ieee":"H. Trautmann, <i>Applications in Statistical Computing — From Music Data Analysis to Industrial Quality Improvement</i>. Springer International Publishing, 2019.","apa":"Trautmann, H. (2019). <i>Applications in Statistical Computing — From Music Data Analysis to Industrial Quality Improvement</i>. Springer International Publishing.","mla":"Trautmann, Heike. <i>Applications in Statistical Computing — From Music Data Analysis to Industrial Quality Improvement</i>. Springer International Publishing, 2019."}},{"department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","date_created":"2023-08-04T07:51:18Z","abstract":[{"text":"In this article, we build upon previous work on designing informative and efficient Exploratory Landscape Analysis features for characterizing problems' landscapes and show their effectiveness in automatically constructing algorithm selection models in continuous black-box optimization problems. Focusing on algorithm performance results of the COCO platform of several years, we construct a representative set of high-performing complementary solvers and present an algorithm selection model that, compared to the portfolio's single best solver, on average requires less than half of the resources for solving a given problem. Therefore, there is a huge gain in efficiency compared to classical ensemble methods combined with an increased insight into problem characteristics and algorithm properties by using informative features. The model acts on the assumption that the function set of the Black-Box Optimization Benchmark is representative enough for practical applications. The model allows for selecting the best suited optimization algorithm within the considered set for unseen problems prior to the optimization itself based on a small sample of function evaluations. Note that such a sample can even be reused for the initial population of an evolutionary (optimization) algorithm so that even the feature costs become negligible.","lang":"eng"}],"citation":{"chicago":"Kerschke, Pascal, and Heike Trautmann. “Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning.” <i>Evolutionary Computation (ECJ)</i> 27, no. 1 (2019): 99–127. <a href=\"https://doi.org/10.1162/evco_a_00236\">https://doi.org/10.1162/evco_a_00236</a>.","short":"P. Kerschke, H. Trautmann, Evolutionary Computation (ECJ) 27 (2019) 99–127.","apa":"Kerschke, P., &#38; Trautmann, H. (2019). Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning. <i>Evolutionary Computation (ECJ)</i>, <i>27</i>(1), 99–127. <a href=\"https://doi.org/10.1162/evco_a_00236\">https://doi.org/10.1162/evco_a_00236</a>","ieee":"P. Kerschke and H. Trautmann, “Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning,” <i>Evolutionary Computation (ECJ)</i>, vol. 27, no. 1, pp. 99–127, 2019, doi: <a href=\"https://doi.org/10.1162/evco_a_00236\">10.1162/evco_a_00236</a>.","ama":"Kerschke P, Trautmann H. Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning. <i>Evolutionary Computation (ECJ)</i>. 2019;27(1):99–127. doi:<a href=\"https://doi.org/10.1162/evco_a_00236\">10.1162/evco_a_00236</a>","bibtex":"@article{Kerschke_Trautmann_2019, title={Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning}, volume={27}, DOI={<a href=\"https://doi.org/10.1162/evco_a_00236\">10.1162/evco_a_00236</a>}, number={1}, journal={Evolutionary Computation (ECJ)}, author={Kerschke, Pascal and Trautmann, Heike}, year={2019}, pages={99–127} }","mla":"Kerschke, Pascal, and Heike Trautmann. “Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning.” <i>Evolutionary Computation (ECJ)</i>, vol. 27, no. 1, 2019, pp. 99–127, doi:<a href=\"https://doi.org/10.1162/evco_a_00236\">10.1162/evco_a_00236</a>."},"issue":"1","publication":"Evolutionary Computation (ECJ)","volume":27,"user_id":"15504","doi":"10.1162/evco_a_00236","language":[{"iso":"eng"}],"_id":"46346","page":"99–127","intvolume":"        27","date_updated":"2023-10-16T13:31:57Z","author":[{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"},{"id":"100740","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"title":"Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning","year":"2019","status":"public"},{"author":[{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"last_name":"Wang","first_name":"Hao","full_name":"Wang, Hao"},{"last_name":"Preuss","first_name":"Mike","full_name":"Preuss, Mike"},{"full_name":"Grimme, Christian","first_name":"Christian","last_name":"Grimme"},{"full_name":"Deutz, André","first_name":"André","last_name":"Deutz"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"},{"full_name":"Emmerich, Michael","last_name":"Emmerich","first_name":"Michael"}],"title":"Search Dynamics on Multimodal Multi-Objective Problems","status":"public","year":"2019","intvolume":"        27","date_updated":"2023-10-16T13:32:18Z","_id":"46347","language":[{"iso":"eng"}],"page":"577–609","volume":27,"doi":"10.1162/evco_a_00234","user_id":"15504","citation":{"short":"P. Kerschke, H. Wang, M. Preuss, C. Grimme, A. Deutz, H. Trautmann, M. Emmerich, Evolutionary Computation (ECJ) 27 (2019) 577–609.","chicago":"Kerschke, Pascal, Hao Wang, Mike Preuss, Christian Grimme, André Deutz, Heike Trautmann, and Michael Emmerich. “Search Dynamics on Multimodal Multi-Objective Problems.” <i>Evolutionary Computation (ECJ)</i> 27, no. 4 (2019): 577–609. <a href=\"https://doi.org/10.1162/evco_a_00234\">https://doi.org/10.1162/evco_a_00234</a>.","ieee":"P. Kerschke <i>et al.</i>, “Search Dynamics on Multimodal Multi-Objective Problems,” <i>Evolutionary Computation (ECJ)</i>, vol. 27, no. 4, pp. 577–609, 2019, doi: <a href=\"https://doi.org/10.1162/evco_a_00234\">10.1162/evco_a_00234</a>.","apa":"Kerschke, P., Wang, H., Preuss, M., Grimme, C., Deutz, A., Trautmann, H., &#38; Emmerich, M. (2019). Search Dynamics on Multimodal Multi-Objective Problems. <i>Evolutionary Computation (ECJ)</i>, <i>27</i>(4), 577–609. <a href=\"https://doi.org/10.1162/evco_a_00234\">https://doi.org/10.1162/evco_a_00234</a>","bibtex":"@article{Kerschke_Wang_Preuss_Grimme_Deutz_Trautmann_Emmerich_2019, title={Search Dynamics on Multimodal Multi-Objective Problems}, volume={27}, DOI={<a href=\"https://doi.org/10.1162/evco_a_00234\">10.1162/evco_a_00234</a>}, number={4}, journal={Evolutionary Computation (ECJ)}, author={Kerschke, Pascal and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann, Heike and Emmerich, Michael}, year={2019}, pages={577–609} }","ama":"Kerschke P, Wang H, Preuss M, et al. Search Dynamics on Multimodal Multi-Objective Problems. <i>Evolutionary Computation (ECJ)</i>. 2019;27(4):577–609. doi:<a href=\"https://doi.org/10.1162/evco_a_00234\">10.1162/evco_a_00234</a>","mla":"Kerschke, Pascal, et al. “Search Dynamics on Multimodal Multi-Objective Problems.” <i>Evolutionary Computation (ECJ)</i>, vol. 27, no. 4, 2019, pp. 577–609, doi:<a href=\"https://doi.org/10.1162/evco_a_00234\">10.1162/evco_a_00234</a>."},"publication":"Evolutionary Computation (ECJ)","issue":"4","abstract":[{"text":"We continue recent work on the definition of multimodality in multiobjective optimization (MO) and the introduction of a test bed for multimodal MO problems. This goes beyond well-known diversity maintenance approaches but instead focuses on the landscape topology induced by the objective functions. More general multimodal MO problems are considered by allowing ellipsoid contours for single-objective subproblems. An experimental analysis compares two MO algorithms, one that explicitly relies on hypervolume gradient approximation, and one that is based on local search, both on a selection of generated example problems. We do not focus on performance but on the interaction induced by the problems and algorithms, which can be described by means of specific characteristics explicitly designed for the multimodal MO setting. Furthermore, we widen the scope of our analysis by additionally applying visualization techniques in the decision space. This strengthens and extends the foundations for Exploratory Landscape Analysis (ELA) in MO.","lang":"eng"}],"date_created":"2023-08-04T07:52:06Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article"},{"status":"public","page":"516–528","_id":"48841","publisher":"Springer International Publishing","user_id":"102979","editor":[{"full_name":"Deb, Kalyanmoy","last_name":"Deb","first_name":"Kalyanmoy"},{"last_name":"Goodman","first_name":"Erik","full_name":"Goodman, Erik"},{"full_name":"Coello Coello, Carlos A.","last_name":"Coello Coello","first_name":"Carlos A."},{"full_name":"Klamroth, Kathrin","first_name":"Kathrin","last_name":"Klamroth"},{"full_name":"Miettinen, Kaisa","last_name":"Miettinen","first_name":"Kaisa"},{"full_name":"Mostaghim, Sanaz","last_name":"Mostaghim","first_name":"Sanaz"},{"first_name":"Patrick","last_name":"Reed","full_name":"Reed, Patrick"}],"citation":{"mla":"Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb et al., Springer International Publishing, 2019, pp. 516–528, doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>.","ama":"Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. In: Deb K, Goodman E, Coello Coello CA, et al., eds. <i>Evolutionary Multi-Criterion Optimization (EMO)</i>. Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528. doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>","bibtex":"@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>}, booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture Notes in Computer Science} }","apa":"Bossek, J., Grimme, C., Meisel, S., Rudolph, G., &#38; Trautmann, H. (2019). Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. In K. Deb, E. Goodman, C. A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, &#38; P. Reed (Eds.), <i>Evolutionary Multi-Criterion Optimization (EMO)</i> (pp. 516–528). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">https://doi.org/10.1007/978-3-030-12598-1_41</a>","ieee":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,” in <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, 2019, pp. 516–528, doi: <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>.","chicago":"Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” In <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa Miettinen, Sanaz Mostaghim, and Patrick Reed, 516–528. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">https://doi.org/10.1007/978-3-030-12598-1_41</a>.","short":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E. Goodman, C.A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO), Springer International Publishing, Cham, 2019, pp. 516–528."},"place":"Cham","title":"Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm","year":"2019","author":[{"id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob"},{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"},{"first_name":"Stephan","last_name":"Meisel","full_name":"Meisel, Stephan"},{"first_name":"Günter","last_name":"Rudolph","full_name":"Rudolph, Günter"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"}],"publication_identifier":{"isbn":["978-3-030-12598-1"]},"publication_status":"published","date_updated":"2023-12-13T10:43:07Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-12598-1_41","publication":"Evolutionary Multi-Criterion Optimization (EMO)","extern":"1","abstract":[{"text":"We tackle a bi-objective dynamic orienteering problem where customer requests arise as time passes by. The goal is to minimize the tour length traveled by a single delivery vehicle while simultaneously keeping the number of dismissed dynamic customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm which is grounded on insights gained from a previous series of work on an a-posteriori version of the problem, where all request times are known in advance. In our experiments, we simulate different decision maker strategies and evaluate the development of the Pareto-front approximations on exemplary problem instances. It turns out, that despite severely reduced computational budget and no oracle-knowledge of request times the dynamic EMOA is capable of producing approximations which partially dominate the results of the a-posteriori EMOA and dynamic integer linear programming strategies.","lang":"eng"}],"date_created":"2023-11-14T15:58:52Z","keyword":["Combinatorial optimization","Dynamic optimization","Metaheuristics","Multi-objective optimization","Vehicle routing"],"type":"conference","department":[{"_id":"819"}]},{"publication":"Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","extern":"1","abstract":[{"text":"Evolutionary algorithms have successfully been applied to evolve problem instances that exhibit a significant difference in performance for a given algorithm or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP). Creating a large variety of instances is crucial for successful applications in the blooming field of algorithm selection. In this paper, we introduce new and creative mutation operators for evolving instances of the TSP. We show that adopting those operators in an evolutionary algorithm allows for the generation of benchmark sets with highly desirable properties: (1) novelty by clear visual distinction to established benchmark sets in the field, (2) visual and quantitative diversity in the space of TSP problem characteristics, and (3) significant performance differences with respect to the restart versions of heuristic state-of-the-art TSP solvers EAX and LKH. The important aspect of diversity is addressed and achieved solely by the proposed mutation operators and not enforced by explicit diversity preservation.","lang":"eng"}],"date_created":"2023-11-14T15:58:52Z","department":[{"_id":"819"}],"type":"conference","keyword":["benchmarking","instance features","optimization","problem generation","traveling salesperson problem"],"author":[{"id":"102979","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"last_name":"Neumann","first_name":"Aneta","full_name":"Neumann, Aneta"},{"first_name":"Markus","last_name":"Wagner","full_name":"Wagner, Markus"},{"full_name":"Neumann, Frank","first_name":"Frank","last_name":"Neumann"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"publication_identifier":{"isbn":["978-1-4503-6254-2"]},"title":"Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators","year":"2019","publication_status":"published","date_updated":"2023-12-13T10:42:57Z","series_title":"FOGA ’19","language":[{"iso":"eng"}],"doi":"10.1145/3299904.3340307","citation":{"short":"J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann, in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2019, pp. 58–71.","chicago":"Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” In <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 58–71. FOGA ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3299904.3340307\">https://doi.org/10.1145/3299904.3340307</a>.","ieee":"J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann, “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,” in <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 2019, pp. 58–71, doi: <a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>.","apa":"Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., &#38; Trautmann, H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 58–71. <a href=\"https://doi.org/10.1145/3299904.3340307\">https://doi.org/10.1145/3299904.3340307</a>","bibtex":"@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={New York, NY, USA}, series={FOGA ’19}, title={Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators}, DOI={<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>}, booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann, Frank and Trautmann, Heike}, year={2019}, pages={58–71}, collection={FOGA ’19} }","ama":"Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. FOGA ’19. Association for Computing Machinery; 2019:58–71. doi:<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>","mla":"Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2019, pp. 58–71, doi:<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>."},"place":"New York, NY, USA","status":"public","publisher":"Association for Computing Machinery","_id":"48842","page":"58–71","user_id":"102979"},{"citation":{"chicago":"Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1443–1451. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3321707.3321792\">https://doi.org/10.1145/3321707.3321792</a>.","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 1443–1451.","ieee":"J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2019, pp. 1443–1451, doi: <a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>.","apa":"Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2019). Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1443–1451. <a href=\"https://doi.org/10.1145/3321707.3321792\">https://doi.org/10.1145/3321707.3321792</a>","bibtex":"@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA}, series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring}, DOI={<a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2019}, pages={1443–1451}, collection={GECCO ’19} }","ama":"Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’19. Association for Computing Machinery; 2019:1443–1451. doi:<a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>","mla":"Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2019, pp. 1443–1451, doi:<a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>."},"place":"New York, NY, USA","status":"public","_id":"48843","publisher":"Association for Computing Machinery","page":"1443–1451","user_id":"102979","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","extern":"1","abstract":[{"text":"We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. This includes the (1+1) EA and RLS in a setting where the number of colors is bounded and we are minimizing the number of conflicts as well as iterated local search algorithms that use an unbounded color palette and aim to use the smallest colors and - as a consequence - the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i. e. starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. Furthermore, we show how to speed up computations by using problem specific operators concentrating on parts of the graph where changes have occurred.","lang":"eng"}],"date_created":"2023-11-14T15:58:52Z","department":[{"_id":"819"}],"keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"type":"conference","publication_identifier":{"isbn":["978-1-4503-6111-8"]},"author":[{"full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","first_name":"Jakob","last_name":"Bossek","id":"102979"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"},{"last_name":"Sudholt","first_name":"Dirk","full_name":"Sudholt, Dirk"}],"year":"2019","title":"Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring","publication_status":"published","date_updated":"2023-12-13T10:42:37Z","series_title":"GECCO ’19","language":[{"iso":"eng"}],"doi":"10.1145/3321707.3321792"},{"user_id":"102979","page":"516–523","publisher":"Association for Computing Machinery","_id":"48840","status":"public","place":"New York, NY, USA","citation":{"chicago":"Bossek, Jakob, Christian Grimme, and Frank Neumann. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 516–523. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3321707.3321818\">https://doi.org/10.1145/3321707.3321818</a>.","short":"J. Bossek, C. Grimme, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 516–523.","ieee":"J. Bossek, C. Grimme, and F. Neumann, “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2019, pp. 516–523, doi: <a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>.","apa":"Bossek, J., Grimme, C., &#38; Neumann, F. (2019). On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 516–523. <a href=\"https://doi.org/10.1145/3321707.3321818\">https://doi.org/10.1145/3321707.3321818</a>","bibtex":"@inproceedings{Bossek_Grimme_Neumann_2019, place={New York, NY, USA}, series={GECCO ’19}, title={On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem}, DOI={<a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Neumann, Frank}, year={2019}, pages={516–523}, collection={GECCO ’19} }","ama":"Bossek J, Grimme C, Neumann F. On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’19. Association for Computing Machinery; 2019:516–523. doi:<a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>","mla":"Bossek, Jakob, et al. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2019, pp. 516–523, doi:<a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>."},"doi":"10.1145/3321707.3321818","language":[{"iso":"eng"}],"series_title":"GECCO ’19","date_updated":"2023-12-13T10:42:24Z","publication_status":"published","year":"2019","title":"On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem","publication_identifier":{"isbn":["978-1-4503-6111-8"]},"author":[{"full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","id":"102979"},{"last_name":"Grimme","first_name":"Christian","full_name":"Grimme, Christian"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"type":"conference","keyword":["biased mutation","combinatorial optimization","minimum spanning tree","multi-objective optimization"],"department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:52Z","abstract":[{"lang":"eng","text":"Research has shown that for many single-objective graph problems where optimum solutions are composed of low weight sub-graphs, such as the minimum spanning tree problem (MST), mutation operators favoring low weight edges show superior performance. Intuitively, similar observations should hold for multi-criteria variants of such problems. In this work, we focus on the multi-criteria MST problem. A thorough experimental study is conducted where we estimate the probability of edges being part of non-dominated spanning trees as a function of the edges’ non-domination level or domination count, respectively. Building on gained insights, we propose several biased one-edge-exchange mutation operators that differ in the used edge-selection probability distribution (biased towards edges of low rank). Our empirical analysis shows that among different graph types (dense and sparse) and edge weight types (both uniformly random and combinations of Euclidean and uniformly random) biased edge-selection strategies perform superior in contrast to the baseline uniform edge-selection. Our findings are in particular strong for dense graphs."}],"extern":"1","publication":"Proceedings of the Genetic and Evolutionary Computation Conference"}]