[{"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:20:24Z","project":[{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"3551","user_id":"477","department":[{"_id":"63"}],"file":[{"file_id":"5299","access_level":"closed","file_name":"SchedulingWithInterjobCommunic.pdf","file_size":745708,"date_created":"2018-11-02T15:20:24Z","creator":"ups","date_updated":"2018-11-02T15:20:24Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"journal_article","publication":"Journal of Combinatorial Optimization","title":"Scheduling with interjob communication on parallel processors","doi":"10.1007/s10878-018-0325-3","date_updated":"2022-01-06T06:59:24Z","date_created":"2018-07-13T09:57:48Z","author":[{"first_name":"Jürgen","last_name":"König","full_name":"König, Jürgen","id":"22358"},{"last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"volume":36,"year":"2018","citation":{"apa":"König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2018). Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1356–1379. <a href=\"https://doi.org/10.1007/s10878-018-0325-3\">https://doi.org/10.1007/s10878-018-0325-3</a>","bibtex":"@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling with interjob communication on parallel processors}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>}, number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2018}, pages={1356–1379} }","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379.","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, 2018, pp. 1356–79, doi:<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>.","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1356-1379. doi:<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1356–1379, 2018.","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1356–79. <a href=\"https://doi.org/10.1007/s10878-018-0325-3\">https://doi.org/10.1007/s10878-018-0325-3</a>."},"page":"1356-1379","intvolume":"        36","has_accepted_license":"1","issue":"4"},{"_id":"3552","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"355"}],"user_id":"49109","file_date_updated":"2018-11-06T15:23:02Z","type":"conference","status":"public","date_updated":"2022-01-06T06:59:25Z","oa":"1","author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"full_name":"Wever, Marcel Dominik","id":"33176","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"}],"doi":"10.1007/978-3-030-01768-2_19","conference":{"end_date":"2018-10-26","location":"‘s-Hertogenbosch, the Netherlands","name":"Symposium on Intelligent Data Analysis","start_date":"2018-10-24"},"main_file_link":[{"open_access":"1","url":"https://link.springer.com/chapter/10.1007%2F978-3-030-01768-2_19"}],"has_accepted_license":"1","publication_status":"accepted","place":"‘s-Hertogenbosch, the Netherlands","citation":{"ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “Reduction Stumps for Multi-Class Classification,” in <i>Proceedings of the Symposium on Intelligent Data Analysis</i>, ‘s-Hertogenbosch, the Netherlands.","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Reduction Stumps for Multi-Class Classification.” In <i>Proceedings of the Symposium on Intelligent Data Analysis</i>. ‘s-Hertogenbosch, the Netherlands, n.d. <a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">https://doi.org/10.1007/978-3-030-01768-2_19</a>.","ama":"Mohr F, Wever MD, Hüllermeier E. Reduction Stumps for Multi-Class Classification. In: <i>Proceedings of the Symposium on Intelligent Data Analysis</i>. ‘s-Hertogenbosch, the Netherlands. doi:<a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">10.1007/978-3-030-01768-2_19</a>","mla":"Mohr, Felix, et al. “Reduction Stumps for Multi-Class Classification.” <i>Proceedings of the Symposium on Intelligent Data Analysis</i>, doi:<a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">10.1007/978-3-030-01768-2_19</a>.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, in: Proceedings of the Symposium on Intelligent Data Analysis, ‘s-Hertogenbosch, the Netherlands, n.d.","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier, place={‘s-Hertogenbosch, the Netherlands}, title={Reduction Stumps for Multi-Class Classification}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">10.1007/978-3-030-01768-2_19</a>}, booktitle={Proceedings of the Symposium on Intelligent Data Analysis}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke} }","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (n.d.). Reduction Stumps for Multi-Class Classification. In <i>Proceedings of the Symposium on Intelligent Data Analysis</i>. ‘s-Hertogenbosch, the Netherlands. <a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">https://doi.org/10.1007/978-3-030-01768-2_19</a>"},"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the Symposium on Intelligent Data Analysis","file":[{"date_updated":"2018-11-06T15:23:02Z","date_created":"2018-11-06T15:23:02Z","creator":"wever","file_size":1348768,"file_name":"Mohr2018_Chapter_ReductionStumpsForMulti-classC.pdf","file_id":"5385","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"date_created":"2018-07-13T15:29:15Z","title":"Reduction Stumps for Multi-Class Classification","quality_controlled":"1","year":"2018"},{"department":[{"_id":"78"}],"user_id":"49051","_id":"3586","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-07-20T14:13:31Z","keyword":["Approximate Computing","Framework","Pareto Front","Accuracy"],"ddc":["000"],"publication":"Third Workshop on Approximate Computing (AxC 2018)","type":"preprint","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-07-20T14:13:31Z","creator":"tobias82","date_created":"2018-07-20T14:13:31Z","file_size":285348,"access_level":"closed","file_id":"3587","file_name":"WitschenWMAP2018.pdf"}],"abstract":[{"text":"Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments.","lang":"eng"}],"date_created":"2018-07-20T14:10:46Z","author":[{"first_name":"Linus Matthias","id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen"},{"first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118","last_name":"Wiersema"},{"id":"61186","full_name":"Ghasemzadeh Mohammadi, Hassan","last_name":"Ghasemzadeh Mohammadi","first_name":"Hassan"},{"id":"64665","full_name":"Awais, Muhammad","orcid":"https://orcid.org/0000-0003-4148-2969","last_name":"Awais","first_name":"Muhammad"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"date_updated":"2022-01-06T06:59:26Z","title":"CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation","has_accepted_license":"1","publication_status":"accepted","page":"6","citation":{"ama":"Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Third Workshop on Approximate Computing (AxC 2018)</i>.","ieee":"L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” <i>Third Workshop on Approximate Computing (AxC 2018)</i>. .","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Third Workshop on Approximate Computing (AxC 2018)</i>, n.d.","mla":"Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Third Workshop on Approximate Computing (AxC 2018)</i>.","bibtex":"@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, journal={Third Workshop on Approximate Computing (AxC 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco} }","short":"L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Third Workshop on Approximate Computing (AxC 2018) (n.d.).","apa":"Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &#38; Platzner, M. (n.d.). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Third Workshop on Approximate Computing (AxC 2018)</i>."},"year":"2018"},{"publication_status":"published","citation":{"chicago":"Ho, Nam. <i>FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-376\">https://doi.org/10.17619/UNIPB/1-376</a>.","ieee":"N. Ho, <i>FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn, 2018.","ama":"Ho N. <i>FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-376\">10.17619/UNIPB/1-376</a>","short":"N. Ho, FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization, Universität Paderborn, 2018.","bibtex":"@book{Ho_2018, title={FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-376\">10.17619/UNIPB/1-376</a>}, publisher={Universität Paderborn}, author={Ho, Nam}, year={2018} }","mla":"Ho, Nam. <i>FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-376\">10.17619/UNIPB/1-376</a>.","apa":"Ho, N. (2018). <i>FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-376\">https://doi.org/10.17619/UNIPB/1-376</a>"},"page":"139","year":"2018","supervisor":[{"full_name":"Kaufmann, Paul","last_name":"Kaufmann","first_name":"Paul"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"author":[{"full_name":"Ho, Nam","last_name":"Ho","first_name":"Nam"}],"date_created":"2018-07-27T06:41:13Z","date_updated":"2022-01-06T06:59:31Z","publisher":"Universität Paderborn","doi":"10.17619/UNIPB/1-376","title":"FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization","type":"dissertation","status":"public","abstract":[{"text":"Traditional cache design uses a consolidated block of memory address bits to index a cache set, equivalent to the use of modulo functions. While this module-based mapping scheme is widely used in contemporary cache structures due to the simplicity of its hardware design and its good performance for sequences of consecutive addresses, its use may not be satisfactory for a variety of application domains having different characteristics.This thesis presents a new type of cache mapping scheme, motivated by programmable capabilities combined with Nature-inspired optimization of reconfigurable hardware. This research has focussed on an FPGA-based evolvable cache structure of the first level cache in a multi-core processor architecture, able to dynamically change cache indexing. To solve the challenge of reconfigurable cache mappings, a programmable Boolean circuit based on a combination of Look-up Table (LUT) memory elements is proposed. Focusing on optimization aspects at the system level, a Performance Measurement Infrastructure is introduced that is able to monitor the underlying microarchitectural metrics, and an adaptive evaluation strategy is presented that leverages on Evolutionary Algorithms, that is not only capable of evolving application-specific address-to-cache-index mappings for level one split caches but also of reducing optimization times. Putting this all together and prototyping in an FPGA for a LEON3/Linux-based multi-core processor, the creation of a system architecture reduces cache misses and improves performance over the use of conventional caches.","lang":"eng"},{"text":"Traditionelle Cachedesigns verwenden konsolidierte Blöcke von Speicheradressbits um einen Cachesatz zu indizieren, vergleichbar mit der Anwendung einer Modulofunktion. Obwohl dieses modulobasierte Abbildungsschema in heutigen Cachestrukturen weit verbreitet ist, vor allem wegen seiner einfachen Anforderungen an das Hardwaredesign und seiner Effizienz für die Indizierung eufeinanderfolgender Speicheradressen, kann seine Verwendung für eine Vielzahl von Anwendungsdomänen mit unterschiedlichen Charakteristiken zu suboptimalen Ergebnissen führen. Diese Dissertation präsentiert einen neuen Typ von Cacheabbildungsschema, motiviert durch die Kombination programmierbarer Ressourcen mit der naturinspirierten Optimierung rekonfigurierbarer Hardware. Im Fokus dieser Forschung steht eine FPGA-basierte Cachestruktur für den first level Cache einer Mehrkernprozessorarchitektur, welche die Cacheindizierung dynamisch ändern kann. Um die Herausforderung rekonfigurierbarer Cacheabbildungen zu lösen, wird eine reprogrammierbare Boolesche Schaltung eingeführt, die auf Look-up Table (LUT) Speicherelementen basiert. Weiterhin wird eine Infrastruktur zur Effizienzmessung eingeführt, welche die zugrundeliege Mikroarchitektur überwachen kann, sowie eine adaptive Evaluationsstrategie präsentiert, die evolutionäre Algorithmen wirksam einsetzt, und die nicht nur anwendungsspezifische Abbildungen von Speicheradressen zu Cacheindizes für level one Caches evolvieren sondern dabei auch die Optimierungszeiten reduzieren kann. All diese Aspekte zusammen in einer prototypischen Implementierung auf einem FPGA für einen LEON3/Linux-basierten Mehrkernprozessor zeigen, dass evolvierbare Cacheabbildungsfunktionen Cache Misses reduzieren, sowie die Effizienz im Vergleich zu konventionellen Caches erhöhen können.","lang":"ger"}],"user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"3720","language":[{"iso":"eng"}]},{"status":"public","type":"book_chapter","file_date_updated":"2018-11-02T16:10:34Z","department":[{"_id":"205"}],"user_id":"477","_id":"3742","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"page":"13-23","citation":{"ama":"Hoof S. Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution. In: <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>. Cham: Springer International Publishing; 2018:13-23. doi:<a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">10.1007/978-3-319-92988-0_2</a>","ieee":"S. Hoof, “Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution,” in <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>, Cham: Springer International Publishing, 2018, pp. 13–23.","chicago":"Hoof, Simon. “Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution.” In <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>, 13–23. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">https://doi.org/10.1007/978-3-319-92988-0_2</a>.","mla":"Hoof, Simon. “Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution.” <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>, Springer International Publishing, 2018, pp. 13–23, doi:<a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">10.1007/978-3-319-92988-0_2</a>.","short":"S. Hoof, in: Static &#38; Dynamic Game Theory: Foundations &#38; Applications, Springer International Publishing, Cham, 2018, pp. 13–23.","bibtex":"@inbook{Hoof_2018, place={Cham}, title={Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">10.1007/978-3-319-92988-0_2</a>}, booktitle={Static &#38; Dynamic Game Theory: Foundations &#38; Applications}, publisher={Springer International Publishing}, author={Hoof, Simon}, year={2018}, pages={13–23} }","apa":"Hoof, S. (2018). Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution. In <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i> (pp. 13–23). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">https://doi.org/10.1007/978-3-319-92988-0_2</a>"},"place":"Cham","has_accepted_license":"1","publication_identifier":{"isbn":["9783319929873","9783319929880"],"issn":["2363-8516","2363-8524"]},"publication_status":"published","doi":"10.1007/978-3-319-92988-0_2","author":[{"first_name":"Simon","full_name":"Hoof, Simon","id":"59676","last_name":"Hoof"}],"date_updated":"2022-01-06T06:59:34Z","file":[{"file_size":199568,"file_name":"Hoof2018_Chapter_DynamicVoluntaryProvisionOfPub.pdf","file_id":"5325","access_level":"closed","date_updated":"2018-11-02T16:10:34Z","date_created":"2018-11-02T16:10:34Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Static & Dynamic Game Theory: Foundations & Applications","language":[{"iso":"eng"}],"ddc":["000"],"year":"2018","title":"Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution","date_created":"2018-08-01T09:51:57Z","publisher":"Springer International Publishing"},{"_id":"3851","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"541"},{"_id":"63"}],"user_id":"14052","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:45Z","date_created":"2018-08-08T11:56:37Z","author":[{"first_name":"Samuel","last_name":"Koop","full_name":"Koop, Samuel"}],"supervisor":[{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"title":"Congestion Games mit gewichteten Strategien","year":"2018","citation":{"mla":"Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","short":"S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn, 2018.","bibtex":"@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität Paderborn}, author={Koop, Samuel}, year={2018} }","apa":"Koop, S. (2018). <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn.","ama":"Koop S. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn; 2018.","chicago":"Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","ieee":"S. Koop, <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018."}},{"abstract":[{"lang":"eng","text":"In automated machine learning (AutoML), the process of engineering machine learning applications with respect to a specific problem is (partially) automated.\r\nVarious AutoML tools have already been introduced to provide out-of-the-box machine learning functionality.\r\nMore specifically, by selecting machine learning algorithms and optimizing their hyperparameters, these tools produce a machine learning pipeline tailored to the problem at hand.\r\nExcept for TPOT, all of these tools restrict the maximum number of processing steps of such a pipeline.\r\nHowever, as TPOT follows an evolutionary approach, it suffers from performance issues when dealing with larger datasets.\r\nIn this paper, we present an alternative approach leveraging a hierarchical planning to configure machine learning pipelines that are unlimited in length.\r\nWe evaluate our approach and find its performance to be competitive with other AutoML tools, including TPOT."}],"file":[{"relation":"main_file","content_type":"application/pdf","file_id":"3853","file_name":"38.pdf","access_level":"open_access","file_size":297811,"creator":"wever","date_created":"2018-08-09T06:14:43Z","date_updated":"2018-08-09T06:14:43Z"}],"publication":"ICML 2018 AutoML Workshop","ddc":["006"],"keyword":["automated machine learning","complex pipelines","hierarchical planning"],"language":[{"iso":"eng"}],"year":"2018","quality_controlled":"1","title":"ML-Plan for Unlimited-Length Machine Learning Pipelines","date_created":"2018-08-09T06:14:54Z","urn":"38527","status":"public","type":"conference","file_date_updated":"2018-08-09T06:14:43Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"_id":"3852","user_id":"49109","department":[{"_id":"355"}],"citation":{"ama":"Wever MD, Mohr F, Hüllermeier E. ML-Plan for Unlimited-Length Machine Learning Pipelines. In: <i>ICML 2018 AutoML Workshop</i>. ; 2018.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “ML-Plan for Unlimited-Length Machine Learning Pipelines.” In <i>ICML 2018 AutoML Workshop</i>, 2018.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “ML-Plan for Unlimited-Length Machine Learning Pipelines,” in <i>ICML 2018 AutoML Workshop</i>, Stockholm, Sweden, 2018.","mla":"Wever, Marcel Dominik, et al. “ML-Plan for Unlimited-Length Machine Learning Pipelines.” <i>ICML 2018 AutoML Workshop</i>, 2018.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: ICML 2018 AutoML Workshop, 2018.","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2018, title={ML-Plan for Unlimited-Length Machine Learning Pipelines}, booktitle={ICML 2018 AutoML Workshop}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). ML-Plan for Unlimited-Length Machine Learning Pipelines. In <i>ICML 2018 AutoML Workshop</i>. Stockholm, Sweden."},"has_accepted_license":"1","main_file_link":[{"url":"https://docs.google.com/viewer?a=v&pid=sites&srcid=ZGVmYXVsdGRvbWFpbnxhdXRvbWwyMDE4aWNtbHxneDo3M2Q3MjUzYjViNDRhZTAx"}],"conference":{"location":"Stockholm, Sweden","end_date":"2018-07-15","start_date":"2018-07-10","name":"ICML 2018 AutoML Workshop"},"oa":"1","date_updated":"2022-01-06T06:59:46Z","author":[{"last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"first_name":"Eyke","id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"}]},{"language":[{"iso":"eng"}],"keyword":["Bargaining problem","CES Function","Normalized CES Function","Nash solution","Kalai-Smorodinsky Solution","Egalitarian Solution."],"ddc":["040"],"file":[{"file_size":469001,"title":"On unification of solutions to the bargaining problem","access_level":"closed","file_name":"On unification of solutions to the bargaining problem.pdf","file_id":"3855","date_updated":"2018-08-09T09:14:52Z","date_created":"2018-08-09T08:15:31Z","creator":"cjhaake","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"We establish axioms under which a bargaining solution can be found by the maximization of the CES function and is unique up to specification of the distribution and elasticity parameters. This solution is referred to as the CES solution which includes the NASH and egalitarian solutions as special cases. Next, we consider a normalization of the CES function and establish axioms, under which a bargaining solution can be found by the maximization of the normalized CES and is unique up to the specifications of the distribution and its substitution parameters. We refer to this solution as the normalized CES solution, which includes the Nash and Kalai-Smorodinsky solutions as special cases. Our paper contributes to bargaining theory by establishing unified characterizations of existing as well as a great variety of new bargaining solutions.","lang":"eng"}],"date_created":"2018-05-28T07:00:28Z","publisher":"CIE Working Paper Series, Paderborn University","title":"On unification of solutions to the bargaining problem","year":"2018","department":[{"_id":"205"},{"_id":"475"}],"series_title":"Working Papers CIE","user_id":"65453","_id":"2933","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"file_date_updated":"2018-08-09T09:14:52Z","type":"working_paper","status":"public","urn":"29332","volume":113,"author":[{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"},{"last_name":"Qin","full_name":"Qin, Cheng-Zhong","first_name":"Cheng-Zhong"}],"date_updated":"2022-01-06T06:58:48Z","has_accepted_license":"1","intvolume":"       113","citation":{"ama":"Haake C-J, Qin C-Z. <i>On Unification of Solutions to the Bargaining Problem</i>. Vol 113. Paderborn University: CIE Working Paper Series, Paderborn University; 2018.","ieee":"C.-J. Haake and C.-Z. Qin, <i>On unification of solutions to the bargaining problem</i>, vol. 113. Paderborn University: CIE Working Paper Series, Paderborn University, 2018.","chicago":"Haake, Claus-Jochen, and Cheng-Zhong Qin. <i>On Unification of Solutions to the Bargaining Problem</i>. Vol. 113. Working Papers CIE. Paderborn University: CIE Working Paper Series, Paderborn University, 2018.","apa":"Haake, C.-J., &#38; Qin, C.-Z. (2018). <i>On unification of solutions to the bargaining problem</i> (Vol. 113). Paderborn University: CIE Working Paper Series, Paderborn University.","short":"C.-J. Haake, C.-Z. Qin, On Unification of Solutions to the Bargaining Problem, CIE Working Paper Series, Paderborn University, Paderborn University, 2018.","bibtex":"@book{Haake_Qin_2018, place={Paderborn University}, series={Working Papers CIE}, title={On unification of solutions to the bargaining problem}, volume={113}, publisher={CIE Working Paper Series, Paderborn University}, author={Haake, Claus-Jochen and Qin, Cheng-Zhong}, year={2018}, collection={Working Papers CIE} }","mla":"Haake, Claus-Jochen, and Cheng-Zhong Qin. <i>On Unification of Solutions to the Bargaining Problem</i>. Vol. 113, CIE Working Paper Series, Paderborn University, 2018."},"place":"Paderborn University"},{"publisher":"ACM","date_created":"2018-06-04T11:33:15Z","title":"Cloud Architectures for Searchable Encryption","quality_controlled":"1","year":"2018","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T14:39:46Z","date_updated":"2018-11-02T14:39:46Z","access_level":"closed","file_id":"5278","file_name":"a25-Blomer.pdf","file_size":769807}],"date_updated":"2022-01-06T06:58:49Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Nils","full_name":"Löken, Nils","id":"13703","last_name":"Löken"}],"doi":"10.1145/3230833.3230853","conference":{"name":"ARES 2018","location":"Hamburg, Germany"},"publication_identifier":{"isbn":["978-1-4503-6448-5"]},"has_accepted_license":"1","publication_status":"accepted","place":"New York, NY, USA","page":"25:1--25:10","citation":{"ama":"Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>. New York, NY, USA: ACM; :25:1--25:10. doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>","chicago":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, 25:1--25:10. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>.","ieee":"J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, Hamburg, Germany, pp. 25:1--25:10.","short":"J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.","mla":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, ACM, pp. 25:1--25:10, doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>.","bibtex":"@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures for Searchable Encryption}, DOI={<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken, Nils}, pages={25:1--25:10} }","apa":"Blömer, J., &#38; Löken, N. (n.d.). Cloud Architectures for Searchable Encryption. In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i> (pp. 25:1--25:10). New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>"},"_id":"2965","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"64"},{"_id":"568"}],"user_id":"13703","file_date_updated":"2018-11-02T14:39:46Z","type":"conference","status":"public"},{"language":[{"iso":"eng"}],"ddc":["040"],"file":[{"title":"Thoughts on Social Design","file_size":141983,"access_level":"closed","file_name":"WP - Thoughts on Social Design.pdf","file_id":"3857","date_updated":"2018-08-09T09:14:11Z","creator":"cjhaake","date_created":"2018-08-09T08:36:24Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"One of the fundamental problems in applications of methods and results\r\nfrom mechanism design and implementation theory is the effective enforcement of\r\ntheoretically established equilibria by which social choice rules are implemented.\r\nHurwicz (2008) and Myerson (2009) introduce different concepts of formalizing\r\nenforcement of institutional rules via the introduction of legal and illegal games. In\r\nthis note the relation of their concepts with that of a social system defined inDebreu\r\n(1952) is analyzed and its potential of being instrumental for modelling institution\r\ndesign is discussed. The existence proof for such a system, also known as generalized\r\ngame or abstract economy had been the basis for the existence proof of a\r\ncompetitive equilibrium of an economy.","lang":"eng"}],"publication":"Studies in Economic Design","title":"Thoughts on Social Design","date_created":"2018-06-06T17:07:28Z","publisher":"Springer","year":"2018","quality_controlled":"1","file_date_updated":"2018-08-09T09:14:11Z","department":[{"_id":"205"},{"_id":"475"}],"user_id":"477","series_title":"Studies in Economic Design","_id":"3098","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"status":"public","editor":[{"full_name":"Laslier, Jean-Francois","last_name":"Laslier","first_name":"Jean-Francois"},{"last_name":"Moulin","full_name":"Moulin, Herve","first_name":"Herve"},{"full_name":"Sanver, Remzi","last_name":"Sanver","first_name":"Remzi"},{"full_name":"Zwicker, William","last_name":"Zwicker","first_name":"William"}],"urn":"30987","type":"book_chapter","volume":"(n.d.)","author":[{"last_name":"Trockel","full_name":"Trockel, Walter","first_name":"Walter"},{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"date_updated":"2022-01-06T06:58:55Z","citation":{"apa":"Trockel, W., &#38; Haake, C.-J. (n.d.). Thoughts on Social Design. In J.-F. Laslier, H. Moulin, R. Sanver, &#38; W. Zwicker (Eds.), <i>Studies in Economic Design</i> (Vol. (n.d.)). Heidelberg: Springer.","mla":"Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.” <i>Studies in Economic Design</i>, edited by Jean-Francois Laslier et al., vol. (n.d.), Springer.","short":"W. Trockel, C.-J. Haake, in: J.-F. Laslier, H. Moulin, R. Sanver, W. Zwicker (Eds.), Studies in Economic Design, Springer, Heidelberg, n.d.","bibtex":"@inbook{Trockel_Haake, place={Heidelberg}, series={Studies in Economic Design}, title={Thoughts on Social Design}, volume={(n.d.)}, booktitle={Studies in Economic Design}, publisher={Springer}, author={Trockel, Walter and Haake, Claus-Jochen}, editor={Laslier, Jean-Francois and Moulin, Herve and Sanver, Remzi and Zwicker, WilliamEditors}, collection={Studies in Economic Design} }","ieee":"W. Trockel and C.-J. Haake, “Thoughts on Social Design,” in <i>Studies in Economic Design</i>, vol. (n.d.), J.-F. Laslier, H. Moulin, R. Sanver, and W. Zwicker, Eds. Heidelberg: Springer.","chicago":"Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.” In <i>Studies in Economic Design</i>, edited by Jean-Francois Laslier, Herve Moulin, Remzi Sanver, and William Zwicker, Vol. (n.d.). Studies in Economic Design. Heidelberg: Springer, n.d.","ama":"Trockel W, Haake C-J. Thoughts on Social Design. In: Laslier J-F, Moulin H, Sanver R, Zwicker W, eds. <i>Studies in Economic Design</i>. Vol (n.d.). Studies in Economic Design. Heidelberg: Springer."},"place":"Heidelberg","publication_identifier":{"issn":["2510-3970"]},"has_accepted_license":"1","publication_status":"accepted"},{"_id":"3152","project":[{"name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","_id":"23","grant_number":"762057"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"user_id":"31764","article_type":"original","file_date_updated":"2019-01-21T16:12:36Z","type":"journal_article","urn":"31522","status":"public","oa":"1","date_updated":"2022-01-06T06:59:00Z","author":[{"first_name":"Sevil","id":"31764","full_name":"Dräxler, Sevil","last_name":"Dräxler"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"full_name":"Mann, Zoltan Adam","last_name":"Mann","first_name":"Zoltan Adam"}],"doi":"10.1109/TNSM.2018.2846572","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.10839"}],"has_accepted_license":"1","citation":{"chicago":"Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” <i>IEEE Transactions on Network and Service Management</i>, 2018. <a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">https://doi.org/10.1109/TNSM.2018.2846572</a>.","ieee":"S. Dräxler, H. Karl, and Z. A. Mann, “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services,” <i>IEEE Transactions on Network and Service Management</i>, 2018.","ama":"Dräxler S, Karl H, Mann ZA. JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. <i>IEEE Transactions on Network and Service Management</i>. 2018. doi:<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>","apa":"Dräxler, S., Karl, H., &#38; Mann, Z. A. (2018). JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. <i>IEEE Transactions on Network and Service Management</i>. <a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">https://doi.org/10.1109/TNSM.2018.2846572</a>","mla":"Dräxler, Sevil, et al. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” <i>IEEE Transactions on Network and Service Management</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>.","bibtex":"@article{Dräxler_Karl_Mann_2018, title={JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services}, DOI={<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2018} }","short":"S. Dräxler, H. Karl, Z.A. Mann, IEEE Transactions on Network and Service Management (2018)."},"ddc":["000"],"language":[{"iso":"eng"}],"publication":"IEEE Transactions on Network and Service Management","abstract":[{"text":"To adapt to continuously changing workloads in networks, components of the running network services may need to be replicated (scaling the network service) and allocated to physical resources (placement) dynamically, also necessitating dynamic re-routing of flows between service components. In this paper, we propose JASPER, a fully automated approach to jointly optimizing scaling, placement, and routing for complex network services, consisting of multiple (virtualized) components. JASPER handles multiple network services that share the same substrate network; services can be dynamically added or removed and dynamic workload changes are handled. Our approach lets service designers specify their services on a high level of abstraction using service templates. JASPER automatically makes scaling, placement and routing decisions, enabling quick reaction to changes. We formalize the problem, analyze its complexity, and develop two algorithms to solve it. Extensive empirical results show the applicability and effectiveness of the proposed approach.","lang":"eng"}],"file":[{"file_size":1767054,"file_name":"08382313.pdf","access_level":"closed","file_id":"5302","date_updated":"2018-11-02T15:25:49Z","creator":"ups","date_created":"2018-11-02T15:25:49Z","success":1,"relation":"main_file","content_type":"application/pdf"},{"content_type":"application/pdf","relation":"main_file","date_created":"2019-01-21T16:12:36Z","creator":"sevilmeh","date_updated":"2019-01-21T16:12:36Z","file_name":"TNSM2846572_RIS.pdf","access_level":"open_access","file_id":"6950","file_size":2878350}],"publisher":"IEEE","date_created":"2018-06-11T06:55:05Z","title":"JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services","year":"2018"},{"citation":{"chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018.","ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep their Promises?,” <i>arXiv:1804.02903</i>. 2018.","ama":"Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises? <i>arXiv:180402903</i>. 2018.","apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? <i>ArXiv:1804.02903</i>.","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018.","bibtex":"@article{Pauck_Bodden_Wehrheim_2018, title={Do Android Taint Analysis Tools Keep their Promises?}, journal={arXiv:1804.02903}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }","short":"F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018)."},"year":"2018","has_accepted_license":"1","title":"Do Android Taint Analysis Tools Keep their Promises?","date_created":"2018-05-09T08:27:11Z","author":[{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix","id":"22398"},{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T06:57:35Z","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1045861,"file_id":"5781","access_level":"closed","file_name":"Do Android Taint Analysis Tools Keep their Promises.pdf","date_updated":"2018-11-21T10:49:23Z","date_created":"2018-11-21T10:49:23Z","creator":"florida"}],"status":"public","abstract":[{"lang":"eng","text":"In recent years, researchers have developed a number of tools to conduct\r\ntaint analysis of Android applications. While all the respective papers aim at\r\nproviding a thorough empirical evaluation, comparability is hindered by varying\r\nor unclear evaluation targets. Sometimes, the apps used for evaluation are not\r\nprecisely described. In other cases, authors use an established benchmark but\r\ncover it only partially. In yet other cases, the evaluations differ in terms of\r\nthe data leaks searched for, or lack a ground truth to compare against. All\r\nthose limitations make it impossible to truly compare the tools based on those\r\npublished evaluations.\r\n  We thus present ReproDroid, a framework allowing the accurate comparison of\r\nAndroid taint analysis tools. ReproDroid supports researchers in inferring the\r\nground truth for data leaks in apps, in automatically applying tools to\r\nbenchmarks, and in evaluating the obtained results. We use ReproDroid to\r\ncomparatively evaluate on equal grounds the six prominent taint analysis tools\r\nAmandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are\r\nlargely positive although four tools violate some promises concerning features\r\nand accuracy. Finally, we contribute to the area of unbiased benchmarking with\r\na new and improved version of the open test suite DroidBench."}],"type":"preprint","publication":"arXiv:1804.02903","file_date_updated":"2018-11-21T10:49:23Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"477","department":[{"_id":"77"},{"_id":"76"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"_id":"2711"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"2712","user_id":"477","department":[{"_id":"276"}],"language":[{"iso":"eng"}],"type":"dissertation","status":"public","date_updated":"2022-01-06T06:57:35Z","publisher":"Universität Paderborn","supervisor":[{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"}],"date_created":"2018-05-09T08:34:14Z","author":[{"first_name":"Darius","last_name":"Schlangenotto","full_name":"Schlangenotto, Darius"}],"title":"Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer","doi":"10.17619/UNIPB/1-312","year":"2018","citation":{"short":"D. Schlangenotto, Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer, Universität Paderborn, 2018.","mla":"Schlangenotto, Darius. <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-312\">10.17619/UNIPB/1-312</a>.","bibtex":"@book{Schlangenotto_2018, title={Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-312\">10.17619/UNIPB/1-312</a>}, publisher={Universität Paderborn}, author={Schlangenotto, Darius}, year={2018} }","apa":"Schlangenotto, D. (2018). <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-312\">https://doi.org/10.17619/UNIPB/1-312</a>","chicago":"Schlangenotto, Darius. <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-312\">https://doi.org/10.17619/UNIPB/1-312</a>.","ieee":"D. Schlangenotto, <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn, 2018.","ama":"Schlangenotto D. <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-312\">10.17619/UNIPB/1-312</a>"}},{"status":"public","type":"dissertation","_id":"1138","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"477","year":"2018","citation":{"ieee":"R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018.","chicago":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>.","ama":"Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>","mla":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>.","short":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018.","bibtex":"@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }","apa":"Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>"},"title":"Distributed Algorithms for Overlay Networks and Programmable Matter","doi":"10.17619/UNIPB/1-265","date_updated":"2022-01-06T06:51:00Z","publisher":"Universität Paderborn","author":[{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-01-31T06:04:03Z"},{"year":"2018","publisher":"IEEE","date_created":"2018-02-01T13:56:01Z","title":"Self-Stabilizing Supervised Publish-Subscribe Systems","publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","abstract":[{"text":"In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-10-31T13:25:37Z","creator":"mfeldma2","date_created":"2018-10-31T13:25:37Z","file_size":239559,"file_id":"5211","file_name":"08425258.pdf","access_level":"closed"}],"external_id":{"arxiv":["1710.08128"]},"keyword":["Topological Self-stabilization","Supervised Overlay","Publish-Subscribe System"],"ddc":["040"],"language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"ama":"Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>","ieee":"M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","chicago":"Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>.","mla":"Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }","short":"M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","apa":"Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>"},"date_updated":"2022-01-06T06:51:05Z","author":[{"first_name":"Michael","last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael"},{"first_name":"Christina","id":"43647","full_name":"Kolb, Christina","last_name":"Kolb"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik"}],"doi":"10.1109/IPDPS.2018.00114","conference":{"name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22","end_date":"2018-5-24","location":"Vancouver"},"type":"conference","status":"public","_id":"1163","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"},{"_id":"66"}],"user_id":"11319","file_date_updated":"2018-10-31T13:25:37Z"},{"publisher":"IEEE","date_created":"2018-02-01T14:00:36Z","title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue","year":"2018","external_id":{"arxiv":["1802.07504"]},"ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","abstract":[{"lang":"eng","text":"We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.\r\nOperations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5212","file_name":"08425257.pdf","access_level":"closed","file_size":218420,"date_created":"2018-10-31T13:29:26Z","creator":"mfeldma2","date_updated":"2018-10-31T13:29:26Z"}],"date_updated":"2022-01-06T06:51:05Z","author":[{"id":"23538","full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander"}],"conference":{"end_date":"2018-5-24","location":"Vancouver","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22"},"doi":"10.1109/IPDPS.2018.00113","has_accepted_license":"1","citation":{"apa":"Feldmann, M., Scheideler, C., &#38; Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>","bibtex":"@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }","short":"M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","mla":"Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>.","ama":"Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>","chicago":"Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>.","ieee":"M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"1164","user_id":"23538","department":[{"_id":"79"}],"file_date_updated":"2018-10-31T13:29:26Z","type":"conference","status":"public"},{"_id":"1165","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"department":[{"_id":"7"},{"_id":"34"},{"_id":"78"}],"user_id":"49051","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-26T08:00:53Z","publication":"4th Workshop On Approximate Computing (WAPCO 2018)","type":"preprint","status":"public","file":[{"file_size":287224,"file_id":"5821","file_name":"WitschenWP2018[1].pdf","access_level":"closed","date_updated":"2018-11-26T08:00:53Z","creator":"tobias82","date_created":"2018-11-26T08:00:53Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"date_updated":"2022-01-06T06:51:06Z","date_created":"2018-02-01T14:24:54Z","author":[{"last_name":"Witschen","full_name":"Witschen, Linus Matthias","id":"49051","first_name":"Linus Matthias"},{"id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"title":"Making the Case for Proof-carrying Approximate Circuits","has_accepted_license":"1","year":"2018","citation":{"apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (2018). Making the Case for Proof-carrying Approximate Circuits. <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>.","mla":"Witschen, Linus Matthias, et al. “Making the Case for Proof-Carrying Approximate Circuits.” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>, 2018.","bibtex":"@article{Witschen_Wiersema_Platzner_2018, title={Making the Case for Proof-carrying Approximate Circuits}, journal={4th Workshop On Approximate Computing (WAPCO 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2018} }","short":"L.M. Witschen, T. Wiersema, M. Platzner, 4th Workshop On Approximate Computing (WAPCO 2018) (2018).","ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Making the Case for Proof-carrying Approximate Circuits,” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>. 2018.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Making the Case for Proof-Carrying Approximate Circuits.” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>, 2018.","ama":"Witschen LM, Wiersema T, Platzner M. Making the Case for Proof-carrying Approximate Circuits. <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>. 2018."}},{"language":[{"iso":"eng"}],"keyword":["Classification","Hierarchical Decomposition","Indirect Encoding"],"ddc":["000"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5275","access_level":"closed","file_name":"p561-wever.pdf","file_size":875404,"date_created":"2018-11-02T14:33:54Z","creator":"ups","date_updated":"2018-11-02T14:33:54Z"}],"abstract":[{"text":"In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance.","lang":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018","title":"Ensembles of Evolved Nested Dichotomies for Classification","date_created":"2018-03-31T13:51:23Z","publisher":"ACM","year":"2018","file_date_updated":"2018-11-02T14:33:54Z","department":[{"_id":"355"}],"user_id":"33176","_id":"2109","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","type":"conference","doi":"10.1145/3205455.3205562","conference":{"name":"GECCO 2018","start_date":"2018-07-15","end_date":"2018-07-19","location":"Kyoto, Japan"},"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?doid=3205455.3205562"}],"author":[{"first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176","full_name":"Wever, Marcel Dominik"},{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"oa":"1","date_updated":"2022-01-06T06:54:45Z","citation":{"ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Ensembles of Evolved Nested Dichotomies for Classification,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, Kyoto, Japan, 2018.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Ensembles of Evolved Nested Dichotomies for Classification.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM, 2018. <a href=\"https://doi.org/10.1145/3205455.3205562\">https://doi.org/10.1145/3205455.3205562</a>.","ama":"Wever MD, Mohr F, Hüllermeier E. Ensembles of Evolved Nested Dichotomies for Classification. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>","short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, Kyoto, Japan, 2018.","mla":"Wever, Marcel Dominik, et al. “Ensembles of Evolved Nested Dichotomies for Classification.” <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>.","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2018, place={Kyoto, Japan}, title={Ensembles of Evolved Nested Dichotomies for Classification}, DOI={<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}, publisher={ACM}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). Ensembles of Evolved Nested Dichotomies for Classification. In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/3205455.3205562\">https://doi.org/10.1145/3205455.3205562</a>"},"place":"Kyoto, Japan","has_accepted_license":"1","publication_status":"published"},{"language":[{"iso":"eng"}],"_id":"17713","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"user_id":"5786","status":"public","type":"preprint","title":"Automated Multi-Label Classification based on ML-Plan","main_file_link":[{"url":"https://arxiv.org/pdf/1811.04060.pdf","open_access":"1"}],"date_updated":"2022-01-06T06:53:17Z","oa":"1","publisher":"Arxiv","date_created":"2020-08-07T11:38:10Z","author":[{"last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"year":"2018","citation":{"short":"M.D. Wever, F. Mohr, E. Hüllermeier, (2018).","mla":"Wever, Marcel Dominik, et al. <i>Automated Multi-Label Classification Based on ML-Plan</i>. Arxiv, 2018.","bibtex":"@article{Wever_Mohr_Hüllermeier_2018, title={Automated Multi-Label Classification based on ML-Plan}, publisher={Arxiv}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). <i>Automated Multi-Label Classification based on ML-Plan</i>. Arxiv.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Automated Multi-Label Classification based on ML-Plan.” Arxiv, 2018.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automated Multi-Label Classification Based on ML-Plan.” Arxiv, 2018.","ama":"Wever MD, Mohr F, Hüllermeier E. Automated Multi-Label Classification based on ML-Plan. Published online 2018."}},{"language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"user_id":"5786","_id":"17714","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","type":"preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/1809.00486.pdf"}],"title":"Automated machine learning service composition","author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176","full_name":"Wever, Marcel Dominik"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"}],"date_created":"2020-08-07T11:40:13Z","date_updated":"2022-01-06T06:53:17Z","oa":"1","citation":{"ama":"Mohr F, Wever MD, Hüllermeier E. Automated machine learning service composition. Published online 2018.","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Automated Machine Learning Service Composition,” 2018.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “Automated machine learning service composition.” 2018.","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). <i>Automated machine learning service composition</i>.","bibtex":"@article{Mohr_Wever_Hüllermeier_2018, title={Automated machine learning service composition}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }","short":"F. Mohr, M.D. Wever, E. Hüllermeier, (2018).","mla":"Mohr, Felix, et al. <i>Automated Machine Learning Service Composition</i>. 2018."},"year":"2018"}]