[{"date_updated":"2023-01-10T13:49:50Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319317496","9783319317502"]},"author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"last_name":"Bujna","first_name":"Kathrin","full_name":"Bujna, Kathrin"}],"year":"2016","title":"Adaptive Seeding for Gaussian Mixture Models","status":"public","doi":"10.1007/978-3-319-31750-2_24","user_id":"25078","_id":"2978","publisher":"Springer International Publishing","page":"296-308","citation":{"short":"J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.","chicago":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In <i>Advances in Knowledge Discovery and Data Mining</i>, 296–308. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>.","apa":"Blömer, J., &#38; Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In <i>Advances in Knowledge Discovery and Data Mining</i> (pp. 296–308). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>","ieee":"J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in <i>Advances in Knowledge Discovery and Data Mining</i>, Cham: Springer International Publishing, 2016, pp. 296–308.","ama":"Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: <i>Advances in Knowledge Discovery and Data Mining</i>. Springer International Publishing; 2016:296-308. doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>","bibtex":"@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian Mixture Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>}, booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016}, pages={296–308} }","mla":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” <i>Advances in Knowledge Discovery and Data Mining</i>, Springer International Publishing, 2016, pp. 296–308, doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>."},"publication":"Advances in Knowledge Discovery and Data Mining","department":[{"_id":"64"}],"type":"book_chapter","place":"Cham","date_created":"2018-06-05T07:31:39Z"},{"status":"public","conference":{"location":"Karlsruhe"},"page":"225-235","publisher":"W. Bertelsmann Verlag GmbH & Co KG","_id":"47588","user_id":"77633","volume":43,"editor":[{"full_name":"Vollmer, T.","last_name":"Vollmer","first_name":"T."},{"first_name":"U.","last_name":"Schwenger","full_name":"Schwenger, U."}],"citation":{"chicago":"Jonas-Ahrend, Gabriela, and Dmitri Thikomirov. “Lehrerbildung im Mechatronik Studium an der Hochschule Hamm-Lippstadt.” In <i>Digitale Vernetzung der Facharbeit</i>, edited by T. Vollmer, U. Schwenger, and BAG Elektrometall e.V., 43:225–35. Berufsbildung, Arbeit und Innovation. Bielefeld: W. Bertelsmann Verlag GmbH &#38; Co KG, 2016.","ama":"Jonas-Ahrend G, Thikomirov D. Lehrerbildung im Mechatronik Studium an der Hochschule Hamm-Lippstadt. In: Vollmer T, Schwenger U, BAG Elektrometall e.V., eds. <i>Digitale Vernetzung der Facharbeit</i>. Vol 43. Berufsbildung, Arbeit und Innovation. W. Bertelsmann Verlag GmbH &#38; Co KG; 2016:225-235.","short":"G. Jonas-Ahrend, D. Thikomirov, in: T. Vollmer, U. Schwenger, BAG Elektrometall e.V. (Eds.), Digitale Vernetzung der Facharbeit, W. Bertelsmann Verlag GmbH &#38; Co KG, Bielefeld, 2016, pp. 225–235.","bibtex":"@inproceedings{Jonas-Ahrend_Thikomirov_2016, place={Bielefeld}, series={Berufsbildung, Arbeit und Innovation}, title={Lehrerbildung im Mechatronik Studium an der Hochschule Hamm-Lippstadt}, volume={43}, booktitle={Digitale Vernetzung der Facharbeit}, publisher={W. Bertelsmann Verlag GmbH &#38; Co KG}, author={Jonas-Ahrend, Gabriela and Thikomirov, Dmitri}, editor={Vollmer, T. and Schwenger, U. and BAG Elektrometall e.V.}, year={2016}, pages={225–235}, collection={Berufsbildung, Arbeit und Innovation} }","apa":"Jonas-Ahrend, G., &#38; Thikomirov, D. (2016). Lehrerbildung im Mechatronik Studium an der Hochschule Hamm-Lippstadt. In T. Vollmer, U. Schwenger, &#38; BAG Elektrometall e.V. (Eds.), <i>Digitale Vernetzung der Facharbeit</i> (Vol. 43, pp. 225–235). W. Bertelsmann Verlag GmbH &#38; Co KG.","mla":"Jonas-Ahrend, Gabriela, and Dmitri Thikomirov. “Lehrerbildung im Mechatronik Studium an der Hochschule Hamm-Lippstadt.” <i>Digitale Vernetzung der Facharbeit</i>, edited by T. Vollmer et al., vol. 43, W. Bertelsmann Verlag GmbH &#38; Co KG, 2016, pp. 225–35.","ieee":"G. Jonas-Ahrend and D. Thikomirov, “Lehrerbildung im Mechatronik Studium an der Hochschule Hamm-Lippstadt,” in <i>Digitale Vernetzung der Facharbeit</i>, Karlsruhe, 2016, vol. 43, pp. 225–235."},"place":"Bielefeld","year":"2016","title":"Lehrerbildung im Mechatronik Studium an der Hochschule Hamm-Lippstadt","corporate_editor":["BAG Elektrometall e.V."],"author":[{"first_name":"Gabriela","last_name":"Jonas-Ahrend","orcid":"0000-0003-3898-954X","full_name":"Jonas-Ahrend, Gabriela","id":"77633"},{"first_name":"Dmitri","last_name":"Thikomirov","full_name":"Thikomirov, Dmitri"}],"publication_status":"published","date_updated":"2023-10-04T14:44:41Z","intvolume":"        43","series_title":"Berufsbildung, Arbeit und Innovation","language":[{"iso":"ger"}],"publication":"Digitale Vernetzung der Facharbeit","extern":"1","date_created":"2023-10-04T14:43:50Z","type":"conference","department":[{"_id":"300"}]},{"has_accepted_license":"1","status":"public","ddc":["530"],"user_id":"14931","volume":13,"page":"292-296","_id":"3888","publisher":"Wiley","file_date_updated":"2018-08-13T09:20:05Z","citation":{"chicago":"Blumenthal, Sarah, Matthias Bürger, Andre Hildebrandt, Jens Förstner, Nils Weber, Cedrik Meier, Dirk Reuter, and Donat J. As. “Fabrication and Characterization of Two-Dimensional Cubic AlN Photonic Crystal Membranes Containing Zincblende GaN Quantum Dots.” <i>Physica Status Solidi (c)</i> 13, no. 5–6 (2016): 292–96. <a href=\"https://doi.org/10.1002/pssc.201600010\">https://doi.org/10.1002/pssc.201600010</a>.","ama":"Blumenthal S, Bürger M, Hildebrandt A, et al. Fabrication and characterization of two-dimensional cubic AlN photonic crystal membranes containing zincblende GaN quantum dots. <i>physica status solidi (c)</i>. 2016;13(5-6):292-296. doi:<a href=\"https://doi.org/10.1002/pssc.201600010\">10.1002/pssc.201600010</a>","short":"S. Blumenthal, M. Bürger, A. Hildebrandt, J. Förstner, N. Weber, C. Meier, D. Reuter, D.J. As, Physica Status Solidi (c) 13 (2016) 292–296.","bibtex":"@article{Blumenthal_Bürger_Hildebrandt_Förstner_Weber_Meier_Reuter_As_2016, title={Fabrication and characterization of two-dimensional cubic AlN photonic crystal membranes containing zincblende GaN quantum dots}, volume={13}, DOI={<a href=\"https://doi.org/10.1002/pssc.201600010\">10.1002/pssc.201600010</a>}, number={5–6}, journal={physica status solidi (c)}, publisher={Wiley}, author={Blumenthal, Sarah and Bürger, Matthias and Hildebrandt, Andre and Förstner, Jens and Weber, Nils and Meier, Cedrik and Reuter, Dirk and As, Donat J.}, year={2016}, pages={292–296} }","apa":"Blumenthal, S., Bürger, M., Hildebrandt, A., Förstner, J., Weber, N., Meier, C., Reuter, D., &#38; As, D. J. (2016). Fabrication and characterization of two-dimensional cubic AlN photonic crystal membranes containing zincblende GaN quantum dots. <i>Physica Status Solidi (c)</i>, <i>13</i>(5–6), 292–296. <a href=\"https://doi.org/10.1002/pssc.201600010\">https://doi.org/10.1002/pssc.201600010</a>","mla":"Blumenthal, Sarah, et al. “Fabrication and Characterization of Two-Dimensional Cubic AlN Photonic Crystal Membranes Containing Zincblende GaN Quantum Dots.” <i>Physica Status Solidi (c)</i>, vol. 13, no. 5–6, Wiley, 2016, pp. 292–96, doi:<a href=\"https://doi.org/10.1002/pssc.201600010\">10.1002/pssc.201600010</a>.","ieee":"S. Blumenthal <i>et al.</i>, “Fabrication and characterization of two-dimensional cubic AlN photonic crystal membranes containing zincblende GaN quantum dots,” <i>physica status solidi (c)</i>, vol. 13, no. 5–6, pp. 292–296, 2016, doi: <a href=\"https://doi.org/10.1002/pssc.201600010\">10.1002/pssc.201600010</a>."},"date_updated":"2023-10-09T09:06:08Z","publication_status":"published","intvolume":"        13","article_type":"original","title":"Fabrication and characterization of two-dimensional cubic AlN photonic crystal membranes containing zincblende GaN quantum dots","year":"2016","author":[{"last_name":"Blumenthal","first_name":"Sarah","full_name":"Blumenthal, Sarah"},{"full_name":"Bürger, Matthias","last_name":"Bürger","first_name":"Matthias"},{"full_name":"Hildebrandt, Andre","first_name":"Andre","last_name":"Hildebrandt"},{"id":"158","last_name":"Förstner","orcid":"0000-0001-7059-9862","first_name":"Jens","full_name":"Förstner, Jens"},{"full_name":"Weber, Nils","last_name":"Weber","first_name":"Nils"},{"full_name":"Meier, Cedrik","orcid":"https://orcid.org/0000-0002-3787-3572","last_name":"Meier","first_name":"Cedrik","id":"20798"},{"id":"37763","full_name":"Reuter, Dirk","last_name":"Reuter","first_name":"Dirk"},{"full_name":"As, Donat J.","first_name":"Donat J.","last_name":"As","orcid":"0000-0003-1121-3565","id":"14"}],"publication_identifier":{"issn":["1862-6351"]},"doi":"10.1002/pssc.201600010","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We successfully developed a process to fabricate freestanding cubic aluminium nitride (c-AlN) membranes containing cubic gallium nitride (c-GaN) quantum dots (QDs). The samples were grown by plasma assisted molecular beam epitaxy (MBE). To realize the photonic crystal (PhC) membrane we have chosen a triangular array of holes. The array was fabricated by electron beam lithography and several steps of reactive ion etching (RIE) with the help of a hard mask and an undercut of the active layer. The r/a- ratio of 0.35 was deter- mined by numerical simulations to obtain a preferably wide photonic band gap. Micro-photoluminescence (μ-PL) measurements of the photonic crystals, in particular of a H1 and a L3 cavity, and the emission of the QD ensemble were performed to characterize the samples. The PhCs show high quality factors of 4400 for the H1 cavity and about 5000/3000 for two different modes of the L3 cavity, respectively. The energy of the fundamental modes is in good agreement to the numerical simulations. "}],"publication":"physica status solidi (c)","issue":"5-6","type":"journal_article","keyword":["tet_topic_phc","tet_topic_qd"],"department":[{"_id":"61"},{"_id":"284"},{"_id":"290"},{"_id":"292"},{"_id":"287"},{"_id":"35"},{"_id":"230"}],"file":[{"creator":"hclaudia","date_created":"2018-08-13T09:20:05Z","access_level":"closed","file_size":1119165,"file_name":"2016-04 Blumenthal_et_al_Fabrication and characterization of two-dimensional cubic AlN photonic crystal membranes containing zincblende GaN quantum dots_physica_status_solidi_(c).pdf","date_updated":"2018-08-13T09:20:05Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"3889"}],"date_created":"2018-08-13T09:14:58Z"},{"date_updated":"2023-10-19T12:08:00Z","publication_status":"published","intvolume":"        43","year":"2016","title":"Argumentation Mining in User-Generated Web Discourse","publication_identifier":{"issn":["0891-2017","1530-9312"]},"author":[{"id":"101881","first_name":"Ivan","last_name":"Habernal","full_name":"Habernal, Ivan"},{"last_name":"Gurevych","first_name":"Iryna","full_name":"Gurevych, Iryna"}],"doi":"10.1162/coli_a_00276","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"<jats:p>The goal of argumentation mining, an evolving research field in computational linguistics, is to design methods capable of analyzing people's argumentation. In this article, we go beyond the state of the art in several ways. (i) We deal with actual Web data and take up the challenges given by the variety of registers, multiple domains, and unrestricted noisy user-generated Web discourse. (ii) We bridge the gap between normative argumentation theories and argumentation phenomena encountered in actual data by adapting an argumentation model tested in an extensive annotation study. (iii) We create a new gold standard corpus (90k tokens in 340 documents) and experiment with several machine learning methods to identify argument components. We offer the data, source codes, and annotation guidelines to the community under free licenses. Our findings show that argumentation mining in user-generated Web discourse is a feasible but challenging task.</jats:p>"}],"issue":"1","publication":"Computational Linguistics","keyword":["Artificial Intelligence","Computer Science Applications","Linguistics and Language","Language and Linguistics"],"type":"journal_article","department":[{"_id":"34"},{"_id":"820"}],"date_created":"2023-10-19T08:30:44Z","status":"public","user_id":"15504","volume":43,"page":"125-179","_id":"48306","publisher":"MIT Press","citation":{"ieee":"I. Habernal and I. Gurevych, “Argumentation Mining in User-Generated Web Discourse,” <i>Computational Linguistics</i>, vol. 43, no. 1, pp. 125–179, 2016, doi: <a href=\"https://doi.org/10.1162/coli_a_00276\">10.1162/coli_a_00276</a>.","mla":"Habernal, Ivan, and Iryna Gurevych. “Argumentation Mining in User-Generated Web Discourse.” <i>Computational Linguistics</i>, vol. 43, no. 1, MIT Press, 2016, pp. 125–79, doi:<a href=\"https://doi.org/10.1162/coli_a_00276\">10.1162/coli_a_00276</a>.","apa":"Habernal, I., &#38; Gurevych, I. (2016). Argumentation Mining in User-Generated Web Discourse. <i>Computational Linguistics</i>, <i>43</i>(1), 125–179. <a href=\"https://doi.org/10.1162/coli_a_00276\">https://doi.org/10.1162/coli_a_00276</a>","bibtex":"@article{Habernal_Gurevych_2016, title={Argumentation Mining in User-Generated Web Discourse}, volume={43}, DOI={<a href=\"https://doi.org/10.1162/coli_a_00276\">10.1162/coli_a_00276</a>}, number={1}, journal={Computational Linguistics}, publisher={MIT Press}, author={Habernal, Ivan and Gurevych, Iryna}, year={2016}, pages={125–179} }","chicago":"Habernal, Ivan, and Iryna Gurevych. “Argumentation Mining in User-Generated Web Discourse.” <i>Computational Linguistics</i> 43, no. 1 (2016): 125–79. <a href=\"https://doi.org/10.1162/coli_a_00276\">https://doi.org/10.1162/coli_a_00276</a>.","short":"I. Habernal, I. Gurevych, Computational Linguistics 43 (2016) 125–179.","ama":"Habernal I, Gurevych I. Argumentation Mining in User-Generated Web Discourse. <i>Computational Linguistics</i>. 2016;43(1):125-179. doi:<a href=\"https://doi.org/10.1162/coli_a_00276\">10.1162/coli_a_00276</a>"}},{"user_id":"15504","doi":"10.1145/2911451.2914682","alternative_title":["Focused Retrieval Over the Web"],"_id":"48308","language":[{"iso":"eng"}],"publisher":"ACM","publication_status":"published","date_updated":"2023-10-19T12:07:25Z","year":"2016","title":"New Collection Announcement","status":"public","author":[{"last_name":"Habernal","first_name":"Ivan","full_name":"Habernal, Ivan","id":"101881"},{"first_name":"Maria","last_name":"Sukhareva","full_name":"Sukhareva, Maria"},{"full_name":"Raiber, Fiana","last_name":"Raiber","first_name":"Fiana"},{"last_name":"Shtok","first_name":"Anna","full_name":"Shtok, Anna"},{"full_name":"Kurland, Oren","first_name":"Oren","last_name":"Kurland"},{"full_name":"Ronen, Hadar","first_name":"Hadar","last_name":"Ronen"},{"first_name":"Judit","last_name":"Bar-Ilan","full_name":"Bar-Ilan, Judit"},{"last_name":"Gurevych","first_name":"Iryna","full_name":"Gurevych, Iryna"}],"type":"conference","department":[{"_id":"34"},{"_id":"820"}],"date_created":"2023-10-19T08:31:35Z","publication":"Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval","citation":{"bibtex":"@inproceedings{Habernal_Sukhareva_Raiber_Shtok_Kurland_Ronen_Bar-Ilan_Gurevych_2016, title={New Collection Announcement}, DOI={<a href=\"https://doi.org/10.1145/2911451.2914682\">10.1145/2911451.2914682</a>}, booktitle={Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval}, publisher={ACM}, author={Habernal, Ivan and Sukhareva, Maria and Raiber, Fiana and Shtok, Anna and Kurland, Oren and Ronen, Hadar and Bar-Ilan, Judit and Gurevych, Iryna}, year={2016} }","chicago":"Habernal, Ivan, Maria Sukhareva, Fiana Raiber, Anna Shtok, Oren Kurland, Hadar Ronen, Judit Bar-Ilan, and Iryna Gurevych. “New Collection Announcement.” In <i>Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. ACM, 2016. <a href=\"https://doi.org/10.1145/2911451.2914682\">https://doi.org/10.1145/2911451.2914682</a>.","short":"I. Habernal, M. Sukhareva, F. Raiber, A. Shtok, O. Kurland, H. Ronen, J. Bar-Ilan, I. Gurevych, in: Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM, 2016.","ama":"Habernal I, Sukhareva M, Raiber F, et al. New Collection Announcement. In: <i>Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2911451.2914682\">10.1145/2911451.2914682</a>","ieee":"I. Habernal <i>et al.</i>, “New Collection Announcement,” 2016, doi: <a href=\"https://doi.org/10.1145/2911451.2914682\">10.1145/2911451.2914682</a>.","apa":"Habernal, I., Sukhareva, M., Raiber, F., Shtok, A., Kurland, O., Ronen, H., Bar-Ilan, J., &#38; Gurevych, I. (2016). New Collection Announcement. <i>Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. <a href=\"https://doi.org/10.1145/2911451.2914682\">https://doi.org/10.1145/2911451.2914682</a>","mla":"Habernal, Ivan, et al. “New Collection Announcement.” <i>Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2911451.2914682\">10.1145/2911451.2914682</a>."}},{"author":[{"id":"101881","last_name":"Habernal","first_name":"Ivan","full_name":"Habernal, Ivan"},{"full_name":"Gurevych, Iryna","last_name":"Gurevych","first_name":"Iryna"}],"title":"Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM","year":"2016","status":"public","publication_status":"published","date_updated":"2023-10-19T12:07:44Z","_id":"48307","language":[{"iso":"eng"}],"publisher":"Association for Computational Linguistics","user_id":"15504","doi":"10.18653/v1/p16-1150","citation":{"short":"I. Habernal, I. Gurevych, in: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Association for Computational Linguistics, 2016.","chicago":"Habernal, Ivan, and Iryna Gurevych. “Which Argument Is More Convincing? Analyzing and Predicting Convincingness of Web Arguments Using Bidirectional LSTM.” In <i>Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>. Association for Computational Linguistics, 2016. <a href=\"https://doi.org/10.18653/v1/p16-1150\">https://doi.org/10.18653/v1/p16-1150</a>.","ieee":"I. Habernal and I. Gurevych, “Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM,” 2016, doi: <a href=\"https://doi.org/10.18653/v1/p16-1150\">10.18653/v1/p16-1150</a>.","apa":"Habernal, I., &#38; Gurevych, I. (2016). Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM. <i>Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>. <a href=\"https://doi.org/10.18653/v1/p16-1150\">https://doi.org/10.18653/v1/p16-1150</a>","bibtex":"@inproceedings{Habernal_Gurevych_2016, title={Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM}, DOI={<a href=\"https://doi.org/10.18653/v1/p16-1150\">10.18653/v1/p16-1150</a>}, booktitle={Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)}, publisher={Association for Computational Linguistics}, author={Habernal, Ivan and Gurevych, Iryna}, year={2016} }","ama":"Habernal I, Gurevych I. Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM. In: <i>Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>. Association for Computational Linguistics; 2016. doi:<a href=\"https://doi.org/10.18653/v1/p16-1150\">10.18653/v1/p16-1150</a>","mla":"Habernal, Ivan, and Iryna Gurevych. “Which Argument Is More Convincing? Analyzing and Predicting Convincingness of Web Arguments Using Bidirectional LSTM.” <i>Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>, Association for Computational Linguistics, 2016, doi:<a href=\"https://doi.org/10.18653/v1/p16-1150\">10.18653/v1/p16-1150</a>."},"publication":"Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","date_created":"2023-10-19T08:31:11Z","department":[{"_id":"34"},{"_id":"820"}],"type":"conference"},{"author":[{"full_name":"Blot, A","last_name":"Blot","first_name":"A"},{"full_name":"Hoos, H","first_name":"H","last_name":"Hoos"},{"full_name":"Jourdan, L","last_name":"Jourdan","first_name":"L"},{"last_name":"Marmion","first_name":"M","full_name":"Marmion, M"},{"full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","id":"100740"}],"title":"MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework","year":"2016","intvolume":"     10079","date_updated":"2023-10-16T13:37:50Z","language":[{"iso":"eng"}],"series_title":"LNTCS","doi":"10.1007/978-3-319-50349-3_3","publication":"LION 2016: Learning and Intelligent Optimization","abstract":[{"lang":"eng","text":"Automated algorithm configuration procedures play an increasingly important role in the development and application of algorithms for a wide range of computationally challenging problems. Until very recently, these configuration procedures were limited to optimising a single performance objective, such as the running time or solution quality achieved by the algorithm being configured. However, in many applications there is more than one performance objective of interest. This gives rise to the multi-objective automatic algorithm configuration problem, which involves finding a Pareto set of configurations of a given target algorithm that characterises trade-offs between multiple performance objectives. In this work, we introduce MO-ParamILS, a multi-objective extension of the state-of-the-art single-objective algorithm configuration framework ParamILS, and demonstrate that it produces good results on several challenging bi-objective algorithm configuration scenarios compared to a base-line obtained from using a state-of-the-art single-objective algorithm configurator."}],"date_created":"2023-08-04T15:10:09Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","status":"public","publisher":"Springer International Publishing","_id":"46364","page":"32–47","volume":10079,"editor":[{"full_name":"et al. Joaquin, Vanschooren","first_name":"Vanschooren","last_name":"et al. Joaquin"}],"user_id":"15504","citation":{"mla":"Blot, A., et al. “MO-ParamILS: A Multi-Objective Automatic Algorithm Configuration Framework.” <i>LION 2016: Learning and Intelligent Optimization</i>, edited by Vanschooren et al. Joaquin, vol. 10079, Springer International Publishing, 2016, pp. 32–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">10.1007/978-3-319-50349-3_3</a>.","bibtex":"@inproceedings{Blot_Hoos_Jourdan_Marmion_Trautmann_2016, place={Cham}, series={LNTCS}, title={MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework}, volume={10079}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">10.1007/978-3-319-50349-3_3</a>}, booktitle={LION 2016: Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Blot, A and Hoos, H and Jourdan, L and Marmion, M and Trautmann, Heike}, editor={et al. Joaquin, Vanschooren}, year={2016}, pages={32–47}, collection={LNTCS} }","ama":"Blot A, Hoos H, Jourdan L, Marmion M, Trautmann H. MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework. In: et al. Joaquin V, ed. <i>LION 2016: Learning and Intelligent Optimization</i>. Vol 10079. LNTCS. Springer International Publishing; 2016:32–47. doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">10.1007/978-3-319-50349-3_3</a>","ieee":"A. Blot, H. Hoos, L. Jourdan, M. Marmion, and H. Trautmann, “MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework,” in <i>LION 2016: Learning and Intelligent Optimization</i>, 2016, vol. 10079, pp. 32–47, doi: <a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">10.1007/978-3-319-50349-3_3</a>.","apa":"Blot, A., Hoos, H., Jourdan, L., Marmion, M., &#38; Trautmann, H. (2016). MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework. In V. et al. Joaquin (Ed.), <i>LION 2016: Learning and Intelligent Optimization</i> (Vol. 10079, pp. 32–47). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">https://doi.org/10.1007/978-3-319-50349-3_3</a>","chicago":"Blot, A, H Hoos, L Jourdan, M Marmion, and Heike Trautmann. “MO-ParamILS: A Multi-Objective Automatic Algorithm Configuration Framework.” In <i>LION 2016: Learning and Intelligent Optimization</i>, edited by Vanschooren et al. Joaquin, 10079:32–47. LNTCS. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_3\">https://doi.org/10.1007/978-3-319-50349-3_3</a>.","short":"A. Blot, H. Hoos, L. Jourdan, M. Marmion, H. Trautmann, in: V. et al. Joaquin (Ed.), LION 2016: Learning and Intelligent Optimization, Springer International Publishing, Cham, 2016, pp. 32–47."},"place":"Cham"},{"type":"book_chapter","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:09:14Z","abstract":[{"lang":"eng","text":"The averaged Hausdorff distance has been proposed as an indicator for assessing the quality of finitely sized approximations of the Pareto front of a multiobjective problem. Since many set-based, iterative optimization algorithms store their currently best approximation in an internal archive these approximations are also termed archives. In case of two objectives and continuous variables it is known that the best approximations in terms of averaged Hausdorff distance are subsets of the Pareto front if it is concave. If it is linear or circularly concave the points of the best approximation are equally spaced.\r\n\r\nHere, it is proven that the optimal averaged Hausdorff approximation and the Pareto front have an empty intersection if the Pareto front is circularly convex. But the points of the best approximation are equally spaced and they rapidly approach the Pareto front for increasing size of the approximation."}],"publication":"Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II","doi":"10.1007/978-3-319-31153-1_4","language":[{"iso":"eng"}],"date_updated":"2023-10-16T13:37:33Z","year":"2016","title":"On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front","author":[{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"},{"full_name":"Schütze, O","first_name":"O","last_name":"Schütze"},{"orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"}],"publication_identifier":{"isbn":["978-3-319-31153-1"]},"place":"Cham","citation":{"mla":"Rudolph, G., et al. “On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front.” <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i>, edited by G Squillero and P Burelli, Springer International Publishing, 2016, pp. 42–55, doi:<a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">10.1007/978-3-319-31153-1_4</a>.","ama":"Rudolph G, Schütze O, Trautmann H. On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front. In: Squillero G, Burelli P, eds. <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i>. Springer International Publishing; 2016:42–55. doi:<a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">10.1007/978-3-319-31153-1_4</a>","bibtex":"@inbook{Rudolph_Schütze_Trautmann_2016, place={Cham}, title={On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">10.1007/978-3-319-31153-1_4</a>}, booktitle={Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II}, publisher={Springer International Publishing}, author={Rudolph, G and Schütze, O and Trautmann, Heike}, editor={Squillero, G and Burelli, P}, year={2016}, pages={42–55} }","apa":"Rudolph, G., Schütze, O., &#38; Trautmann, H. (2016). On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front. In G. Squillero &#38; P. Burelli (Eds.), <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i> (pp. 42–55). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">https://doi.org/10.1007/978-3-319-31153-1_4</a>","ieee":"G. Rudolph, O. Schütze, and H. Trautmann, “On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front,” in <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i>, G. Squillero and P. Burelli, Eds. Cham: Springer International Publishing, 2016, pp. 42–55.","short":"G. Rudolph, O. Schütze, H. Trautmann, in: G. Squillero, P. Burelli (Eds.), Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II, Springer International Publishing, Cham, 2016, pp. 42–55.","chicago":"Rudolph, G, O Schütze, and Heike Trautmann. “On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front.” In <i>Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i>, edited by G Squillero and P Burelli, 42–55. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-31153-1_4\">https://doi.org/10.1007/978-3-319-31153-1_4</a>."},"user_id":"15504","editor":[{"full_name":"Squillero, G","last_name":"Squillero","first_name":"G"},{"full_name":"Burelli, P","first_name":"P","last_name":"Burelli"}],"page":"42–55","_id":"46363","publisher":"Springer International Publishing","status":"public"},{"publisher":"Springer","_id":"46369","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"page":"962–972","user_id":"15504","doi":"10.1007/978-3-319-45823-6_90","author":[{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"first_name":"Hao","last_name":"Wang","full_name":"Wang, Hao"},{"full_name":"Preuss, Mike","last_name":"Preuss","first_name":"Mike"},{"full_name":"Grimme, Christian","first_name":"Christian","last_name":"Grimme"},{"first_name":"André","last_name":"Deutz","full_name":"Deutz, André"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740"},{"last_name":"Emmerich","first_name":"Michael","full_name":"Emmerich, Michael"}],"title":"Towards Analyzing Multimodality of Multiobjective Landscapes","status":"public","year":"2016","date_updated":"2023-10-16T13:39:42Z","date_created":"2023-08-04T15:16:02Z","place":"Edinburgh, Scotland","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","citation":{"chicago":"Kerschke, Pascal, Hao Wang, Mike Preuss, Christian Grimme, André Deutz, Heike Trautmann, and Michael Emmerich. “Towards Analyzing Multimodality of Multiobjective Landscapes.” In <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>, 962–972. Lecture Notes in Computer Science. Edinburgh, Scotland: Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">https://doi.org/10.1007/978-3-319-45823-6_90</a>.","short":"P. Kerschke, H. Wang, M. Preuss, C. Grimme, A. Deutz, H. Trautmann, M. Emmerich, in: Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV), Springer, Edinburgh, Scotland, 2016, pp. 962–972.","ieee":"P. Kerschke <i>et al.</i>, “Towards Analyzing Multimodality of Multiobjective Landscapes,” in <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>, 2016, pp. 962–972, doi: <a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">10.1007/978-3-319-45823-6_90</a>.","apa":"Kerschke, P., Wang, H., Preuss, M., Grimme, C., Deutz, A., Trautmann, H., &#38; Emmerich, M. (2016). Towards Analyzing Multimodality of Multiobjective Landscapes. <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>, 962–972. <a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">https://doi.org/10.1007/978-3-319-45823-6_90</a>","bibtex":"@inproceedings{Kerschke_Wang_Preuss_Grimme_Deutz_Trautmann_Emmerich_2016, place={Edinburgh, Scotland}, series={Lecture Notes in Computer Science}, title={Towards Analyzing Multimodality of Multiobjective Landscapes}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">10.1007/978-3-319-45823-6_90</a>}, booktitle={Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)}, publisher={Springer}, author={Kerschke, Pascal and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann, Heike and Emmerich, Michael}, year={2016}, pages={962–972}, collection={Lecture Notes in Computer Science} }","ama":"Kerschke P, Wang H, Preuss M, et al. Towards Analyzing Multimodality of Multiobjective Landscapes. In: <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>. Lecture Notes in Computer Science. Springer; 2016:962–972. doi:<a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">10.1007/978-3-319-45823-6_90</a>","mla":"Kerschke, Pascal, et al. “Towards Analyzing Multimodality of Multiobjective Landscapes.” <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)</i>, Springer, 2016, pp. 962–972, doi:<a href=\"https://doi.org/10.1007/978-3-319-45823-6_90\">10.1007/978-3-319-45823-6_90</a>."},"publication":"Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)","abstract":[{"text":"This paper formally defines multimodality in multiobjective optimization (MO). We introduce a test-bed in which multimodal MO problems with known properties can be constructed as well as numerical characteristics of the resulting landscape. Gradient- and local search based strategies are compared on exemplary problems together with specific performance indicators in the multimodal MO setting. By this means the foundation for Exploratory Landscape Analysis in MO is provided.","lang":"eng"}]},{"year":"2016","title":"Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models","status":"public","publication_identifier":{"isbn":["978-1-4503-4206-3"]},"author":[{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"first_name":"Mike","last_name":"Preuss","full_name":"Preuss, Mike"},{"full_name":"Wessing, Simon","first_name":"Simon","last_name":"Wessing"},{"id":"100740","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike"}],"date_updated":"2023-10-16T13:38:47Z","page":"229–236","language":[{"iso":"eng"}],"_id":"46367","user_id":"15504","doi":"10.1145/2908812.2908845","publication":"Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation","citation":{"mla":"Kerschke, Pascal, et al. “Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models.” <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 2016, pp. 229–236, doi:<a href=\"https://doi.org/10.1145/2908812.2908845\">10.1145/2908812.2908845</a>.","ama":"Kerschke P, Preuss M, Wessing S, Trautmann H. Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models. In: <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>. ; 2016:229–236. doi:<a href=\"https://doi.org/10.1145/2908812.2908845\">10.1145/2908812.2908845</a>","bibtex":"@inproceedings{Kerschke_Preuss_Wessing_Trautmann_2016, place={Denver, CO, USA}, title={Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models}, DOI={<a href=\"https://doi.org/10.1145/2908812.2908845\">10.1145/2908812.2908845</a>}, booktitle={Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation}, author={Kerschke, Pascal and Preuss, Mike and Wessing, Simon and Trautmann, Heike}, year={2016}, pages={229–236} }","apa":"Kerschke, P., Preuss, M., Wessing, S., &#38; Trautmann, H. (2016). Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models. <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 229–236. <a href=\"https://doi.org/10.1145/2908812.2908845\">https://doi.org/10.1145/2908812.2908845</a>","ieee":"P. Kerschke, M. Preuss, S. Wessing, and H. Trautmann, “Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models,” in <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 2016, pp. 229–236, doi: <a href=\"https://doi.org/10.1145/2908812.2908845\">10.1145/2908812.2908845</a>.","chicago":"Kerschke, Pascal, Mike Preuss, Simon Wessing, and Heike Trautmann. “Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models.” In <i>Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 229–236. Denver, CO, USA, 2016. <a href=\"https://doi.org/10.1145/2908812.2908845\">https://doi.org/10.1145/2908812.2908845</a>.","short":"P. Kerschke, M. Preuss, S. Wessing, H. Trautmann, in: Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation, Denver, CO, USA, 2016, pp. 229–236."},"abstract":[{"lang":"eng","text":"When selecting the best suited algorithm for an unknown optimization problem, it is useful to possess some a priori knowledge of the problem at hand. In the context of single-objective, continuous optimization problems such knowledge can be retrieved by means of Exploratory Landscape Analysis (ELA), which automatically identifies properties of a landscape, e.g., the so-called funnel structures, based on an initial sample. In this paper, we extract the relevant features (for detecting funnels) out of a large set of landscape features when only given a small initial sample consisting of 50 x D observations, where D is the number of decision space dimensions. This is already in the range of the start population sizes of many evolutionary algorithms. The new Multiple Peaks Model Generator (MPM2) is used for training the classifier, and the approach is then very successfully validated on the Black-Box Optimization Benchmark (BBOB) and a subset of the CEC 2013 niching competition problems."}],"date_created":"2023-08-04T15:14:06Z","place":"Denver, CO, USA","type":"conference","department":[{"_id":"34"},{"_id":"819"}]},{"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:17:48Z","abstract":[{"text":"One main task in evolutionary multiobjective optimization (EMO) is to obtain a suitable finite size approximation of the Pareto front which is the image of the solution set, termed the Pareto set, of a given multiobjective optimization problem. In the technical literature, the characteristic of the desired approximation is commonly expressed by closeness to the Pareto front and a sufficient spread of the solutions obtained. In this paper, we first make an effort to show by theoretical and empirical findings that the recently proposed Averaged Hausdorff (or Δ𝑝-) indicator indeed aims at fulfilling both performance criteria for bi-objective optimization problems. In the second part of this paper, standard EMO algorithms combined with a specialized archiver and a postprocessing step based on the Δ𝑝 indicator are introduced which sufficiently approximate the Δ𝑝-optimal archives and generate solutions evenly spread along the Pareto front.","lang":"eng"}],"issue":"2","publication":"Computational Optimization and Applications (Comput. Optim. Appl.)","citation":{"apa":"Rudolph, G., Schütze, O., Grimme, C., Domínguez-Medina, C., &#38; Trautmann, H. (2016). Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results. <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i>, <i>64</i>(2), 589–618. <a href=\"https://doi.org/10.1007/s10589-015-9815-8\">https://doi.org/10.1007/s10589-015-9815-8</a>","mla":"Rudolph, G., et al. “Optimal Averaged Hausdorff Archives for Bi-Objective Problems: Theoretical and Numerical Results.” <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i>, vol. 64, no. 2, 2016, pp. 589–618, doi:<a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>.","ieee":"G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, and H. Trautmann, “Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results,” <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i>, vol. 64, no. 2, pp. 589–618, 2016, doi: <a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>.","chicago":"Rudolph, G, O Schütze, C Grimme, C Domínguez-Medina, and Heike Trautmann. “Optimal Averaged Hausdorff Archives for Bi-Objective Problems: Theoretical and Numerical Results.” <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i> 64, no. 2 (2016): 589–618. <a href=\"https://doi.org/10.1007/s10589-015-9815-8\">https://doi.org/10.1007/s10589-015-9815-8</a>.","ama":"Rudolph G, Schütze O, Grimme C, Domínguez-Medina C, Trautmann H. Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results. <i>Computational Optimization and Applications (Comput Optim Appl)</i>. 2016;64(2):589–618. doi:<a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>","short":"G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, H. Trautmann, Computational Optimization and Applications (Comput. Optim. Appl.) 64 (2016) 589–618.","bibtex":"@article{Rudolph_Schütze_Grimme_Domínguez-Medina_Trautmann_2016, title={Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results}, volume={64}, DOI={<a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>}, number={2}, journal={Computational Optimization and Applications (Comput. Optim. Appl.)}, author={Rudolph, G and Schütze, O and Grimme, C and Domínguez-Medina, C and Trautmann, Heike}, year={2016}, pages={589–618} }"},"user_id":"15504","doi":"10.1007/s10589-015-9815-8","volume":64,"page":"589–618","_id":"46371","language":[{"iso":"eng"}],"date_updated":"2023-10-16T13:40:21Z","intvolume":"        64","title":"Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results","year":"2016","status":"public","author":[{"last_name":"Rudolph","first_name":"G","full_name":"Rudolph, G"},{"last_name":"Schütze","first_name":"O","full_name":"Schütze, O"},{"last_name":"Grimme","first_name":"C","full_name":"Grimme, C"},{"full_name":"Domínguez-Medina, C","last_name":"Domínguez-Medina","first_name":"C"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}]},{"abstract":[{"lang":"eng","text":"We present a new hybrid evolutionary algorithm for the effective hypervolume approximation of the Pareto front of a given differentiable multi-objective optimization problem. Starting point for the local search (LS) mechanism is a new division of the decision space as we will argue that in each of these regions a different LS strategy seems to be most promising. For the LS in two out of the three regions we will utilize and adapt the Directed Search method which is capable of steering the search into any direction given in objective space and which is thus well suited for the problem at hand. We further on integrate the resulting LS mechanism into SMS-EMOA, a state-of-the-art evolutionary algorithm for hypervolume approximations. Finally, we will present some numerical results on several benchmark problems with two and three objectives indicating the strength and competitiveness of the novel hybrid."}],"issue":"3","publication":"Journal of Heuristics","citation":{"bibtex":"@article{Schütze_Sosa_Trautmann_Rudolph_2016, title={The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems}, volume={22}, DOI={<a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>}, number={3}, journal={Journal of Heuristics}, author={Schütze, O and Sosa, Hernandez VA and Trautmann, Heike and Rudolph, G}, year={2016}, pages={273–300} }","ama":"Schütze O, Sosa HV, Trautmann H, Rudolph G. The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems. <i>Journal of Heuristics</i>. 2016;22(3):273–300. doi:<a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>","mla":"Schütze, O., et al. “The Hypervolume Based Directed Search Method for Multi-Objective Optimization Problems.” <i>Journal of Heuristics</i>, vol. 22, no. 3, 2016, pp. 273–300, doi:<a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>.","chicago":"Schütze, O, Hernandez VA Sosa, Heike Trautmann, and G Rudolph. “The Hypervolume Based Directed Search Method for Multi-Objective Optimization Problems.” <i>Journal of Heuristics</i> 22, no. 3 (2016): 273–300. <a href=\"https://doi.org/10.1007/s10732-016-9310-0\">https://doi.org/10.1007/s10732-016-9310-0</a>.","short":"O. Schütze, H.V. Sosa, H. Trautmann, G. Rudolph, Journal of Heuristics 22 (2016) 273–300.","ieee":"O. Schütze, H. V. Sosa, H. Trautmann, and G. Rudolph, “The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems,” <i>Journal of Heuristics</i>, vol. 22, no. 3, pp. 273–300, 2016, doi: <a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>.","apa":"Schütze, O., Sosa, H. V., Trautmann, H., &#38; Rudolph, G. (2016). The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems. <i>Journal of Heuristics</i>, <i>22</i>(3), 273–300. <a href=\"https://doi.org/10.1007/s10732-016-9310-0\">https://doi.org/10.1007/s10732-016-9310-0</a>"},"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:19:11Z","date_updated":"2023-10-16T13:40:43Z","intvolume":"        22","title":"The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems","status":"public","year":"2016","author":[{"first_name":"O","last_name":"Schütze","full_name":"Schütze, O"},{"first_name":"Hernandez VA","last_name":"Sosa","full_name":"Sosa, Hernandez VA"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","id":"100740"},{"full_name":"Rudolph, G","first_name":"G","last_name":"Rudolph"}],"user_id":"15504","doi":"10.1007/s10732-016-9310-0","volume":22,"page":"273–300","language":[{"iso":"eng"}],"_id":"46372"},{"author":[{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"id":"100740","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike"}],"status":"public","year":"2016","title":"The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems","date_updated":"2023-10-16T13:39:06Z","language":[{"iso":"eng"}],"_id":"46368","doi":"10.1109/CEC.2016.7748359","user_id":"15504","citation":{"mla":"Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>.","ama":"Kerschke P, Trautmann H. The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. In: <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>","bibtex":"@inproceedings{Kerschke_Trautmann_2016, place={Vancouver, BC, Kanada}, title={The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems}, DOI={<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>}, booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}, author={Kerschke, Pascal and Trautmann, Heike}, year={2016} }","apa":"Kerschke, P., &#38; Trautmann, H. (2016). The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">https://doi.org/10.1109/CEC.2016.7748359</a>","ieee":"P. Kerschke and H. Trautmann, “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems,” 2016, doi: <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>.","chicago":"Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” In <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. Vancouver, BC, Kanada, 2016. <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">https://doi.org/10.1109/CEC.2016.7748359</a>.","short":"P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Kanada, 2016."},"publication":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC)","abstract":[{"lang":"eng","text":"Exploratory Landscape Analysis (ELA) aims at understanding characteristics of single-objective continuous (black-box) optimization problems in an automated way. Moreover, the approach provides the basis for constructing algorithm selection models for unseen problem instances. Recently, it has gained increasing attention and numerical features have been designed by various research groups. This paper introduces the R-Package FLACCO which makes all relevant features available in a unified framework together with efficient helper functions. Moreover, a case study which gives perspectives to ELA for multi-objective optimization problems is presented."}],"place":"Vancouver, BC, Kanada","date_created":"2023-08-04T15:14:52Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference"},{"abstract":[{"text":"This report documents the talks and discussions at the Dagstuhl Seminar 15211 \"Theory of Evolutionary Algorithms\". This seminar, now in its 8th edition, is the main meeting point of the highly active theory of randomized search heuristics subcommunities in Australia, Asia, North America, and Europe. Topics intensively discussed include rigorous runtime analysis and computational complexity theory for randomised search heuristics, information geometry of randomised search, and synergies between the theory of evolutionary algorithms and theories of natural evolution.","lang":"eng"}],"issue":"5","publication":"Dagstuhl Reports","citation":{"bibtex":"@article{Neumann_Trautmann_2016, title={Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)}, volume={5}, DOI={<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>}, number={5}, journal={Dagstuhl Reports}, author={Neumann, F and Trautmann, Heike}, year={2016}, pages={78–79} }","ama":"Neumann F, Trautmann H. Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). <i>Dagstuhl Reports</i>. 2016;5(5):78–79. doi:<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>","mla":"Neumann, F., and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” <i>Dagstuhl Reports</i>, vol. 5, no. 5, 2016, pp. 78–79, doi:<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>.","chicago":"Neumann, F, and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” <i>Dagstuhl Reports</i> 5, no. 5 (2016): 78–79. <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">https://doi.org/10.4230/DagRep.5.5.57</a>.","short":"F. Neumann, H. Trautmann, Dagstuhl Reports 5 (2016) 78–79.","ieee":"F. Neumann and H. Trautmann, “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211),” <i>Dagstuhl Reports</i>, vol. 5, no. 5, pp. 78–79, 2016, doi: <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>.","apa":"Neumann, F., &#38; Trautmann, H. (2016). Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). <i>Dagstuhl Reports</i>, <i>5</i>(5), 78–79. <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">https://doi.org/10.4230/DagRep.5.5.57</a>"},"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:17:00Z","date_updated":"2023-10-16T13:40:00Z","intvolume":"         5","status":"public","year":"2016","title":"Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)","author":[{"full_name":"Neumann, F","last_name":"Neumann","first_name":"F"},{"id":"100740","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"doi":"10.4230/DagRep.5.5.57","user_id":"15504","volume":5,"page":"78–79","language":[{"iso":"eng"}],"_id":"46370"},{"status":"public","title":"What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation","year":"2016","author":[{"full_name":"Habernal, Ivan","first_name":"Ivan","last_name":"Habernal","id":"101881"},{"full_name":"Gurevych, Iryna","last_name":"Gurevych","first_name":"Iryna"}],"publication_status":"published","date_updated":"2023-10-19T12:07:05Z","_id":"48309","publisher":"Association for Computational Linguistics","language":[{"iso":"eng"}],"user_id":"15504","doi":"10.18653/v1/d16-1129","publication":"Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing","citation":{"mla":"Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>, Association for Computational Linguistics, 2016, doi:<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>.","bibtex":"@inproceedings{Habernal_Gurevych_2016, title={What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation}, DOI={<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>}, booktitle={Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing}, publisher={Association for Computational Linguistics}, author={Habernal, Ivan and Gurevych, Iryna}, year={2016} }","ama":"Habernal I, Gurevych I. What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. In: <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. Association for Computational Linguistics; 2016. doi:<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>","ieee":"I. Habernal and I. Gurevych, “What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation,” 2016, doi: <a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>.","apa":"Habernal, I., &#38; Gurevych, I. (2016). What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. <a href=\"https://doi.org/10.18653/v1/d16-1129\">https://doi.org/10.18653/v1/d16-1129</a>","chicago":"Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” In <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. Association for Computational Linguistics, 2016. <a href=\"https://doi.org/10.18653/v1/d16-1129\">https://doi.org/10.18653/v1/d16-1129</a>.","short":"I. Habernal, I. Gurevych, in: Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing, Association for Computational Linguistics, 2016."},"date_created":"2023-10-19T08:31:58Z","type":"conference","department":[{"_id":"34"},{"_id":"820"}]},{"department":[{"_id":"54"}],"oa":"1","type":"conference","date_created":"2019-07-12T05:30:14Z","quality_controlled":"1","abstract":[{"text":"In this paper we study the influence of directional radio patterns of Bluetooth low energy (BLE) beacons on smartphone localization accuracy and beacon network planning. A two-dimensional model of the power emission characteristic is derived from measurements of the radiation pattern of BLE beacons carried out in an RF chamber. The Cramer-Rao lower bound (CRLB) for position estimation is then derived for this directional power emission model. With this lower bound on the RMS positioning error the coverage of different beacon network configurations can be evaluated. For near-optimal network planing an evolutionary optimization algorithm for finding the best beacon placement is presented.","lang":"eng"}],"related_material":{"link":[{"relation":"supplementary_material","url":"https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16_Poster.pdf","description":"Poster"}]},"citation":{"apa":"Schmalenstroeer, J., &#38; Haeb-Umbach, R. (2016). Investigations into Bluetooth Low Energy Localization Precision Limits. <i>24th European Signal Processing Conference (EUSIPCO 2016)</i>.","ieee":"J. Schmalenstroeer and R. Haeb-Umbach, “Investigations into Bluetooth Low Energy Localization Precision Limits,” 2016.","chicago":"Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into Bluetooth Low Energy Localization Precision Limits.” In <i>24th European Signal Processing Conference (EUSIPCO 2016)</i>, 2016.","short":"J. Schmalenstroeer, R. Haeb-Umbach, in: 24th European Signal Processing Conference (EUSIPCO 2016), 2016.","mla":"Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into Bluetooth Low Energy Localization Precision Limits.” <i>24th European Signal Processing Conference (EUSIPCO 2016)</i>, 2016.","ama":"Schmalenstroeer J, Haeb-Umbach R. Investigations into Bluetooth Low Energy Localization Precision Limits. In: <i>24th European Signal Processing Conference (EUSIPCO 2016)</i>. ; 2016.","bibtex":"@inproceedings{Schmalenstroeer_Haeb-Umbach_2016, title={Investigations into Bluetooth Low Energy Localization Precision Limits}, booktitle={24th European Signal Processing Conference (EUSIPCO 2016)}, author={Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}, year={2016} }"},"publication":"24th European Signal Processing Conference (EUSIPCO 2016)","user_id":"460","_id":"11890","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16.pdf","open_access":"1"}],"date_updated":"2023-10-26T08:11:52Z","author":[{"id":"460","last_name":"Schmalenstroeer","first_name":"Joerg","full_name":"Schmalenstroeer, Joerg"},{"id":"242","full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"status":"public","year":"2016","title":"Investigations into Bluetooth Low Energy Localization Precision Limits"},{"_id":"48873","publisher":"Springer International Publishing","page":"48–59","editor":[{"last_name":"Festa","first_name":"Paola","full_name":"Festa, Paola"},{"first_name":"Meinolf","last_name":"Sellmann","full_name":"Sellmann, Meinolf"},{"full_name":"Vanschoren, Joaquin","first_name":"Joaquin","last_name":"Vanschoren"}],"user_id":"102979","status":"public","place":"Cham","citation":{"short":"J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2016, pp. 48–59.","chicago":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” In <i>Learning and Intelligent Optimization</i>, edited by Paola Festa, Meinolf Sellmann, and Joaquin Vanschoren, 48–59. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>.","ieee":"J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers,” in <i>Learning and Intelligent Optimization</i>, 2016, pp. 48–59, doi: <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","apa":"Bossek, J., &#38; Trautmann, H. (2016). Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In P. Festa, M. Sellmann, &#38; J. Vanschoren (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 48–59). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>","bibtex":"@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes in Computer Science}, title={Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, Paola and Sellmann, Meinolf and Vanschoren, Joaquin}, year={2016}, pages={48–59}, collection={Lecture Notes in Computer Science} }","ama":"Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J, eds. <i>Learning and Intelligent Optimization</i>. Lecture Notes in Computer Science. Springer International Publishing; 2016:48–59. doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>","mla":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” <i>Learning and Intelligent Optimization</i>, edited by Paola Festa et al., Springer International Publishing, 2016, pp. 48–59, doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>."},"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-50349-3_4","author":[{"last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979"},{"last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"publication_identifier":{"isbn":["978-3-319-50349-3"]},"year":"2016","title":"Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers","date_updated":"2023-12-13T10:47:05Z","publication_status":"published","date_created":"2023-11-14T15:58:57Z","department":[{"_id":"819"}],"type":"conference","keyword":["Algorithm selection","Feature selection","Instance hardness","TSP"],"publication":"Learning and Intelligent Optimization","abstract":[{"lang":"eng","text":"Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP) heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful in generating satisfactory or even optimal solutions. However, the reasons for their success are not yet fully understood. Recent approaches take an analytical viewpoint and try to identify instance features, which make an instance hard or easy to solve. We contribute to this area by generating instance sets for couples of TSP algorithms A and B by maximizing/minimizing their performance difference in order to generate instances which are easier to solve for one solver and much harder to solve for the other. This instance set offers the potential to identify key features which allow to distinguish between the problem hardness classes of both algorithms."}],"extern":"1"},{"citation":{"apa":"Hilgert, J. (2016). Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen. In A. Hoppenbrock &#38; et al. (Eds.), <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>. Springer Spektrum.","ieee":"J. Hilgert, “Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen,” in <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>, A. Hoppenbrock and et al., Eds. Springer Spektrum, 2016.","chicago":"Hilgert, Joachim. “Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen.” In <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>, edited by A. Hoppenbrock and et al. Springer Spektrum, 2016.","short":"J. Hilgert, in: A. Hoppenbrock, et al. (Eds.), Lehren und Lernen von Mathematik in der Studieneingangsphase, Springer Spektrum, 2016.","mla":"Hilgert, Joachim. “Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen.” <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>, edited by A. Hoppenbrock and et al., Springer Spektrum, 2016.","ama":"Hilgert J. Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen. In: Hoppenbrock A, et al., eds. <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>. Springer Spektrum; 2016.","bibtex":"@inbook{Hilgert_2016, title={Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen}, booktitle={Lehren und Lernen von Mathematik in der Studieneingangsphase}, publisher={Springer Spektrum}, author={Hilgert, Joachim}, editor={Hoppenbrock, A. and et al.}, year={2016} }"},"publication":"Lehren und Lernen von Mathematik in der Studieneingangsphase","department":[{"_id":"91"}],"type":"book_chapter","date_created":"2024-02-19T08:06:18Z","date_updated":"2024-02-19T08:06:22Z","publication_status":"published","author":[{"last_name":"Hilgert","first_name":"Joachim","full_name":"Hilgert, Joachim","id":"220"}],"corporate_editor":["et al."],"title":"Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen","status":"public","year":"2016","editor":[{"full_name":"Hoppenbrock, A.","last_name":"Hoppenbrock","first_name":"A."}],"user_id":"49063","_id":"51464","publisher":"Springer Spektrum","language":[{"iso":"ger"}]},{"citation":{"bibtex":"@inbook{Hilgert_Pasquale_Przebinda_2016, title={Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p&#62;2 odd)}, booktitle={Geometric Methods in Physics}, publisher={Birkhäuser}, author={Hilgert, Joachim and Pasquale, A. and Przebinda, T.}, editor={Kielanowski, P. and et al.}, year={2016} }","ama":"Hilgert J, Pasquale A, Przebinda T. Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p&#62;2 odd). In: Kielanowski P, et al., eds. <i>Geometric Methods in Physics</i>. Birkhäuser; 2016.","short":"J. Hilgert, A. Pasquale, T. Przebinda, in: P. Kielanowski, et al. (Eds.), Geometric Methods in Physics, Birkhäuser, 2016.","chicago":"Hilgert, Joachim, A. Pasquale, and T. Przebinda. “Resonances for the Laplacian: The Cases BC2 and C2 (except SO(p,2) with P&#62;2 Odd).” In <i>Geometric Methods in Physics</i>, edited by P. Kielanowski and et al. Birkhäuser, 2016.","ieee":"J. Hilgert, A. Pasquale, and T. Przebinda, “Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p&#62;2 odd),” in <i>Geometric Methods in Physics</i>, P. Kielanowski and et al., Eds. Birkhäuser, 2016.","apa":"Hilgert, J., Pasquale, A., &#38; Przebinda, T. (2016). Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p&#62;2 odd). In P. Kielanowski &#38; et al. (Eds.), <i>Geometric Methods in Physics</i>. Birkhäuser.","mla":"Hilgert, Joachim, et al. “Resonances for the Laplacian: The Cases BC2 and C2 (except SO(p,2) with P&#62;2 Odd).” <i>Geometric Methods in Physics</i>, edited by P. Kielanowski and et al., Birkhäuser, 2016."},"publication":"Geometric Methods in Physics","department":[{"_id":"91"}],"type":"book_chapter","date_created":"2024-02-19T08:05:20Z","date_updated":"2024-02-19T08:05:24Z","publication_status":"published","corporate_editor":["et al."],"author":[{"full_name":"Hilgert, Joachim","first_name":"Joachim","last_name":"Hilgert","id":"220"},{"first_name":"A.","last_name":"Pasquale","full_name":"Pasquale, A."},{"full_name":"Przebinda, T.","last_name":"Przebinda","first_name":"T."}],"status":"public","title":"Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p>2 odd)","year":"2016","editor":[{"last_name":"Kielanowski","first_name":"P.","full_name":"Kielanowski, P."}],"user_id":"49063","language":[{"iso":"eng"}],"_id":"51463","publisher":"Birkhäuser"},{"date_created":"2024-03-25T09:23:39Z","department":[{"_id":"888"}],"type":"journal_article","keyword":["Artificial Intelligence","Computer Networks and Communications","Information Systems"],"issue":"2","publication":"Journal on Data Semantics","language":[{"iso":"eng"}],"doi":"10.1007/s13740-015-0055-y","author":[{"full_name":"Borgwardt, Stefan","last_name":"Borgwardt","first_name":"Stefan"},{"first_name":"Theofilos","last_name":"Mailis","full_name":"Mailis, Theofilos"},{"last_name":"Peñaloza","first_name":"Rafael","full_name":"Peñaloza, Rafael"},{"id":"104470","first_name":"Anni-Yasmin","last_name":"Turhan","full_name":"Turhan, Anni-Yasmin"}],"publication_identifier":{"issn":["1861-2032","1861-2040"]},"title":"Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies","year":"2016","intvolume":"         5","date_updated":"2024-03-25T13:50:33Z","publication_status":"published","citation":{"ieee":"S. Borgwardt, T. Mailis, R. Peñaloza, and A.-Y. Turhan, “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies,” <i>Journal on Data Semantics</i>, vol. 5, no. 2, pp. 55–75, 2016, doi: <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>.","apa":"Borgwardt, S., Mailis, T., Peñaloza, R., &#38; Turhan, A.-Y. (2016). Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. <i>Journal on Data Semantics</i>, <i>5</i>(2), 55–75. <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">https://doi.org/10.1007/s13740-015-0055-y</a>","short":"S. Borgwardt, T. Mailis, R. Peñaloza, A.-Y. Turhan, Journal on Data Semantics 5 (2016) 55–75.","chicago":"Borgwardt, Stefan, Theofilos Mailis, Rafael Peñaloza, and Anni-Yasmin Turhan. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” <i>Journal on Data Semantics</i> 5, no. 2 (2016): 55–75. <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">https://doi.org/10.1007/s13740-015-0055-y</a>.","mla":"Borgwardt, Stefan, et al. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” <i>Journal on Data Semantics</i>, vol. 5, no. 2, Springer Science and Business Media LLC, 2016, pp. 55–75, doi:<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>.","bibtex":"@article{Borgwardt_Mailis_Peñaloza_Turhan_2016, title={Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies}, volume={5}, DOI={<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>}, number={2}, journal={Journal on Data Semantics}, publisher={Springer Science and Business Media LLC}, author={Borgwardt, Stefan and Mailis, Theofilos and Peñaloza, Rafael and Turhan, Anni-Yasmin}, year={2016}, pages={55–75} }","ama":"Borgwardt S, Mailis T, Peñaloza R, Turhan A-Y. Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. <i>Journal on Data Semantics</i>. 2016;5(2):55-75. doi:<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>"},"_id":"52803","publisher":"Springer Science and Business Media LLC","page":"55-75","volume":5,"user_id":"9503","status":"public"}]