[{"series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:53Z","doi":"10.1007/978-3-319-59144-5_32","department":[{"_id":"63"},{"_id":"541"},{"_id":"276"}],"title":"Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App","page":"462-467","type":"conference","year":"2017","citation":{"bibtex":"@inproceedings{Feldotto_John_Kundisch_Hemsen_Klingsieck_Skopalik_2017, series={LNCS}, title={Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App}, DOI={10.1007/978-3-319-59144-5_32}, booktitle={Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)}, author={Feldotto, Matthias and John, Thomas and Kundisch, Dennis and Hemsen, Paul and Klingsieck, Katrin and Skopalik, Alexander}, year={2017}, pages={462–467}, collection={LNCS} }","mla":"Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–67, doi:10.1007/978-3-319-59144-5_32.","chicago":"Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 462–67. LNCS, 2017. https://doi.org/10.1007/978-3-319-59144-5_32.","ama":"Feldotto M, John T, Kundisch D, Hemsen P, Klingsieck K, Skopalik A. Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST). LNCS. ; 2017:462-467. doi:10.1007/978-3-319-59144-5_32","apa":"Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., & Skopalik, A. (2017). Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST) (pp. 462–467). https://doi.org/10.1007/978-3-319-59144-5_32","ieee":"M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, and A. Skopalik, “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App,” in Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.","short":"M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, A. Skopalik, in: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467."},"_id":"1094","file":[{"file_id":"5230","creator":"feldi","file_size":1576363,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-10-31T17:01:09Z","file_name":"Feldotto2017_Chapter_MakingGamificationEasyForThePr.pdf","date_created":"2018-10-31T17:01:09Z","access_level":"closed"}],"publication":"Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)","file_date_updated":"2018-10-31T17:01:09Z","author":[{"id":"14052","last_name":"Feldotto","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias"},{"full_name":"John, Thomas","first_name":"Thomas","id":"3952","last_name":"John"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","last_name":"Kundisch","id":"21117"},{"id":"22546","last_name":"Hemsen","full_name":"Hemsen, Paul","first_name":"Paul"},{"last_name":"Klingsieck","first_name":"Katrin","full_name":"Klingsieck, Katrin"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"date_created":"2018-01-05T08:37:52Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, gamification is hardly used in education, because current approaches to gamification require instructors to engage in the time-consuming preparation of their course contents for use in quizzes, mini-games and the like. Drawing on research on limited attention and present bias, we propose a \"lean\" approach to gamification, which relies on gamifying learning activities (rather than learning contents) and increasing their salience. In this paper, we present the app StudyNow that implements such a lean gamification approach. With this app, we aim to enable more students and instructors to benefit from the advantages of gamification."}],"user_id":"14052","ddc":["000"]},{"_id":"1095","page":"2970-2979","year":"2017","citation":{"short":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, M. Langendorf, in: Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.","ieee":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.","chicago":"John, Thomas, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis Kundisch, and Mike Langendorf. “Towards a Lean Approach for Gamifying Education.” In Proceedings of the 25th European Conference on Information Systems (ECIS), 2970–79, 2017.","apa":"John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., & Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In Proceedings of the 25th European Conference on Information Systems (ECIS) (pp. 2970–2979).","ama":"John T, Feldotto M, Hemsen P, Klingsieck K, Kundisch D, Langendorf M. Towards a Lean Approach for Gamifying Education. In: Proceedings of the 25th European Conference on Information Systems (ECIS). ; 2017:2970-2979.","bibtex":"@inproceedings{John_Feldotto_Hemsen_Klingsieck_Kundisch_Langendorf_2017, title={Towards a Lean Approach for Gamifying Education}, booktitle={Proceedings of the 25th European Conference on Information Systems (ECIS)}, author={John, Thomas and Feldotto, Matthias and Hemsen, Paul and Klingsieck, Katrin and Kundisch, Dennis and Langendorf, Mike}, year={2017}, pages={2970–2979} }","mla":"John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–79."},"type":"conference","main_file_link":[{"open_access":"1","url":"https://aisel.aisnet.org/ecis2017_rip/46"}],"user_id":"14052","ddc":["000"],"abstract":[{"lang":"eng","text":"Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, using gamification currently is rather tedious and time-consuming for instructors because current approaches to gamification require instructors to engage in the time-consuming preparation of course contents (e.g., for quizzes or mini-games). In reply to this issue, we propose a “lean” approach to gamification, which relies on gamifying learning activities rather than learning contents. The learning activities that are gamified in the lean approach can typically be drawn from existing course syllabi (e.g., attend certain lectures, hand in assignments, read book chapters and articles). Hence, compared to existing approaches, lean gamification substantially lowers the time requirements posed on instructors for gamifying a given course. Drawing on research on limited attention and the present bias, we provide the theoretical foundation for the lean gamification approach. In addition, we present a mobile application that implements lean gamification and outline a mixed-methods study that is currently under way for evaluating whether lean gamification does indeed have the potential to increase students’ motivation. We thereby hope to allow more students and instructors to benefit from the advantages of gamification. "}],"date_created":"2018-01-05T08:39:41Z","status":"public","has_accepted_license":"1","file":[{"file_size":485333,"creator":"feldi","file_id":"5232","date_updated":"2018-10-31T17:02:07Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-10-31T17:02:07Z","file_name":"TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf","access_level":"closed"}],"file_date_updated":"2018-10-31T17:02:07Z","publication":"Proceedings of the 25th European Conference on Information Systems (ECIS)","author":[{"id":"3952","last_name":"John","full_name":"John, Thomas","first_name":"Thomas"},{"id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias"},{"full_name":"Hemsen, Paul","first_name":"Paul","id":"22546","last_name":"Hemsen"},{"last_name":"Klingsieck","full_name":"Klingsieck, Katrin","first_name":"Katrin"},{"id":"21117","last_name":"Kundisch","full_name":"Kundisch, Dennis","first_name":"Dennis"},{"last_name":"Langendorf","first_name":"Mike","full_name":"Langendorf, Mike"}],"oa":"1","date_updated":"2022-01-06T06:50:53Z","language":[{"iso":"eng"}],"title":"Towards a Lean Approach for Gamifying Education","department":[{"_id":"63"},{"_id":"541"},{"_id":"178"},{"_id":"185"}]},{"language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2017.03.021","date_updated":"2022-01-06T06:50:55Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"title":"Continuous Speed Scaling with Variability: A Simple and Direct Approach","citation":{"mla":"Antoniadis, Antonios, et al. “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” Theoretical Computer Science, Elsevier, 2017, pp. 1–13, doi:10.1016/j.tcs.2017.03.021.","bibtex":"@article{Antoniadis_Kling_Ott_Riechers_2017, title={Continuous Speed Scaling with Variability: A Simple and Direct Approach}, DOI={10.1016/j.tcs.2017.03.021}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Antoniadis, Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören}, year={2017}, pages={1–13} }","ama":"Antoniadis A, Kling P, Ott S, Riechers S. Continuous Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer Science. 2017:1-13. doi:10.1016/j.tcs.2017.03.021","apa":"Antoniadis, A., Kling, P., Ott, S., & Riechers, S. (2017). Continuous Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer Science, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021","chicago":"Antoniadis, Antonios, Peter Kling, Sebastian Ott, and Sören Riechers. “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” Theoretical Computer Science, 2017, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021.","ieee":"A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling with Variability: A Simple and Direct Approach,” Theoretical Computer Science, pp. 1–13, 2017.","short":"A. Antoniadis, P. Kling, S. Ott, S. Riechers, Theoretical Computer Science (2017) 1–13."},"type":"journal_article","year":"2017","page":"1-13","_id":"110","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:13Z","file":[{"file_size":494600,"file_id":"1567","creator":"florida","date_updated":"2018-03-21T13:07:43Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"110-TCSSubmission.pdf","date_created":"2018-03-21T13:07:43Z","access_level":"closed"}],"publisher":"Elsevier","author":[{"first_name":"Antonios","full_name":"Antoniadis, Antonios","last_name":"Antoniadis"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"first_name":"Sebastian","full_name":"Ott, Sebastian","last_name":"Ott"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"publication":"Theoretical Computer Science","file_date_updated":"2018-03-21T13:07:43Z","user_id":"477","ddc":["040"],"abstract":[{"text":"We consider an extension of the dynamic speed scaling scheduling model introduced by Yao et al.: A set of jobs, each with a release time, deadline, and workload, has to be scheduled on a single, speed-scalable processor. Both the maximum allowed speed of the processor and the energy costs may vary continuously over time. The objective is to find a feasible schedule that minimizes the total energy costs. Theoretical algorithm design for speed scaling problems often tends to discretize problems, as our tools in the discrete realm are often better developed or understood. Using the above speed scaling variant with variable, continuous maximal processor speeds and energy prices as an example, we demonstrate that a more direct approach via tools from variational calculus can not only lead to a very concise and elegant formulation and analysis, but also avoids the “explosion of variables/constraints” that often comes with discretizing. Using well-known tools from calculus of variations, we derive combinatorial optimality characteristics for our continuous problem and provide a quite concise and simple correctness proof.","lang":"eng"}]},{"page":"91:1-91:10","citation":{"ieee":"S. Brandt, M. Fischer, M. Gerges, C. Jähn, and J. Berssenbrügge, “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models,” in Volume 1: 37th Computers and Information in Engineering Conference, Cleveland, USA, 2017, vol. 1, pp. 91:1-91:10.","short":"S. Brandt, M. Fischer, M. Gerges, C. Jähn, J. Berssenbrügge, in: Volume 1: 37th Computers and Information in Engineering Conference, 2017, pp. 91:1-91:10.","bibtex":"@inproceedings{Brandt_Fischer_Gerges_Jähn_Berssenbrügge_2017, title={Automatic Derivation of Geometric Properties of Components From 3D Polygon Models}, volume={1}, DOI={10.1115/detc2017-67528}, booktitle={Volume 1: 37th Computers and Information in Engineering Conference}, author={Brandt, Sascha and Fischer, Matthias and Gerges, Maria and Jähn, Claudius and Berssenbrügge, Jan}, year={2017}, pages={91:1-91:10} }","mla":"Brandt, Sascha, et al. “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.” Volume 1: 37th Computers and Information in Engineering Conference, vol. 1, 2017, pp. 91:1-91:10, doi:10.1115/detc2017-67528.","ama":"Brandt S, Fischer M, Gerges M, Jähn C, Berssenbrügge J. Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In: Volume 1: 37th Computers and Information in Engineering Conference. Vol 1. ; 2017:91:1-91:10. doi:10.1115/detc2017-67528","apa":"Brandt, S., Fischer, M., Gerges, M., Jähn, C., & Berssenbrügge, J. (2017). Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In Volume 1: 37th Computers and Information in Engineering Conference (Vol. 1, pp. 91:1-91:10). Cleveland, USA. https://doi.org/10.1115/detc2017-67528","chicago":"Brandt, Sascha, Matthias Fischer, Maria Gerges, Claudius Jähn, and Jan Berssenbrügge. “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.” In Volume 1: 37th Computers and Information in Engineering Conference, 1:91:1-91:10, 2017. https://doi.org/10.1115/detc2017-67528."},"type":"conference","year":"2017","conference":{"location":"Cleveland, USA","start_date":"2017-08-06","name":"37th Computers and Information in Engineering Conference","end_date":"2017-08-09"},"_id":"16338","intvolume":" 1","volume":1,"date_created":"2020-03-24T08:36:05Z","status":"public","publication":"Volume 1: 37th Computers and Information in Engineering Conference","author":[{"orcid":"https://orcid.org/0000-0003-3546-203X","full_name":"Brandt, Sascha","first_name":"Sascha","id":"11648","last_name":"Brandt"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"first_name":"Maria","full_name":"Gerges, Maria","last_name":"Gerges"},{"first_name":"Claudius","full_name":"Jähn, Claudius","last_name":"Jähn"},{"first_name":"Jan","full_name":"Berssenbrügge, Jan","last_name":"Berssenbrügge"}],"user_id":"15415","abstract":[{"lang":"eng","text":"To detect errors or find potential for improvement during the CAD-supported development of a complex technical system like modern industrial machines, the system’s virtual prototype can be examined in virtual reality (VR) in the context of virtual design reviews. Besides exploring the static shape of the examined system, observing the machines’ mechanics (e.g., motor-driven mechanisms) and transport routes for the material transport (e.g., via conveyor belts or chains, or rail-based transport systems) can play an equally important role in such a review. In practice it is often the case, that the relevant information about transport routes, or kinematic properties is either not consequently modeled in the CAD data or is lost during conversion processes. To significantly reduce the manual effort and costs for creating animations of the machines complex behavior with such limited input data for a design review, we present a set of algorithms to automatically determine geometrical properties of machine parts based only on their triangulated surfaces. The algorithms allow to detect the course of transport systems, the orientation of objects in 3d space, rotation axes of cylindrical objects and holes, the number of tooth of gears, as well as the tooth spacing of toothed racks. We implemented the algorithms in the VR system PADrend and applied them to animate virtual prototypes of real machines."}],"language":[{"iso":"eng"}],"doi":"10.1115/detc2017-67528","date_updated":"2022-01-06T06:52:49Z","publication_identifier":{"isbn":["9780791858110"]},"publication_status":"published","department":[{"_id":"63"}],"title":"Automatic Derivation of Geometric Properties of Components From 3D Polygon Models"},{"page":"415-427","type":"conference","citation":{"chicago":"Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell.” In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, 369:415–27. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017.","apa":"Brandt, S., & Fischer, M. (2017). Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 (Vol. 369, pp. 415–427). Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Brandt S, Fischer M. Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017. Vol 369. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2017:415-427.","mla":"Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell.” Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, vol. 369, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017, pp. 415–27.","bibtex":"@inproceedings{Brandt_Fischer_2017, place={Paderborn}, title={Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell}, volume={369}, booktitle={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Brandt, Sascha and Fischer, Matthias}, year={2017}, pages={415–427} }","short":"S. Brandt, M. Fischer, in: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Paderborn, 2017, pp. 415–427.","ieee":"S. Brandt and M. Fischer, “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell,” in Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Paderborn, 2017, vol. 369, pp. 415–427."},"year":"2017","conference":{"location":"Paderborn","start_date":"2017-05-11","name":"Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017","end_date":"2017-05-12"},"intvolume":" 369","_id":"16339","volume":369,"date_created":"2020-03-24T08:44:25Z","status":"public","publication":"Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Brandt, Sascha","orcid":"https://orcid.org/0000-0003-3546-203X","first_name":"Sascha","id":"11648","last_name":"Brandt"},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"}],"user_id":"11648","abstract":[{"lang":"ger","text":"In der CAD-unterstützten Entwicklung von technischen Systemen (Maschinen, Anlagen etc.) werden virtuelle Prototypen im Rahmen eines virtuellen Design-Reviews mit Hilfe eines VR-Systems gesamtheitlich betrachtet, um frühzeitig Fehler und Verbesserungsbedarf zu erkennen. Ein wichtiger Untersuchungsgegenstand ist dabei die Analyse von Transportwegen für den Materialtransport mittels Fließbändern, Förderketten oder schienenbasierten Transportsystemen. Diese Transportwege werden im VR-System animiert. Problematisch dabei ist, dass derartige Transportsysteme im zugrundeliegenden CAD-Modell in der Praxis oft nicht modelliert und nur exemplarisch angedeutet werden, da diese für die Konstruktion nicht relevant sind (z.B. der Fördergurt eines Förderbandes, oder die Kette einer Förderkette), oder die Informationen über den Verlauf bei der Konvertierung der Daten in das VR-System verloren gehen. Bei der Animation dieser Transportsysteme in einem VR-System muss der Transportweg also aufwändig, manuell nachgearbeitet werden. Das Ziel dieser Arbeit ist die Reduzierung des notwendigen manuellen Nachbearbeitungsaufwandes für das Design-Review durch eine automatische Berechnung der Animationspfade entlang eines Transportsystems. Es wird ein Algorithmus vorgestellt, der es ermöglicht mit nur geringem zeitlichem Benutzeraufwand den Animationspfad aus den reinen polygonalen dreidimensionalen Daten eines Transportsystems automatisch zu rekonstruieren."}],"language":[{"iso":"ger"}],"date_updated":"2022-01-06T06:52:49Z","publication_status":"published","department":[{"_id":"63"}],"title":"Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell","place":"Paderborn"},{"doi":"10.1007/978-3-319-72751-6_13","date_updated":"2022-01-06T06:52:49Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"Gathering Anonymous, Oblivious Robots on a Grid","place":"Vienna, Austria","editor":[{"first_name":"Antonio","full_name":"Fernández Anta, Antonio","last_name":"Fernández Anta"},{"last_name":"Jurdzinski","first_name":"Tomasz","full_name":"Jurdzinski, Tomasz"},{"last_name":"Mosteiro","full_name":"Mosteiro, Miguel A.","first_name":"Miguel A."},{"last_name":"Zhang","first_name":"Yanyong","full_name":"Zhang, Yanyong"}],"department":[{"_id":"63"}],"_id":"16347","intvolume":" 10718","type":"conference","citation":{"ieee":"M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” in Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, 2017, vol. 10718, pp. 168–181.","short":"M. Fischer, D. Jung, F. Meyer auf der Heide, in: A. Fernández Anta, T. Jurdzinski, M.A. Mosteiro, Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, Springer, Vienna, Austria, 2017, pp. 168–181.","mla":"Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13.","bibtex":"@inproceedings{Fischer_Jung_Meyer auf der Heide_2017, place={Vienna, Austria}, series={Lecture Notes in Computer Science}, title={Gathering Anonymous, Oblivious Robots on a Grid}, volume={10718}, DOI={10.1007/978-3-319-72751-6_13}, booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}}, publisher={Springer}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, editor={Fernández Anta, Antonio and Jurdzinski, Tomasz and Mosteiro, Miguel A. and Zhang, YanyongEditors}, year={2017}, pages={168–181}, collection={Lecture Notes in Computer Science} }","chicago":"Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, and Yanyong Zhang, 10718:168–81. Lecture Notes in Computer Science. Vienna, Austria: Springer, 2017. https://doi.org/10.1007/978-3-319-72751-6_13.","apa":"Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro, & Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} (Vol. 10718, pp. 168–181). Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-72751-6_13","ama":"Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. In: Fernández Anta A, Jurdzinski T, Mosteiro MA, Zhang Y, eds. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}. Vol 10718. Lecture Notes in Computer Science. Vienna, Austria: Springer; 2017:168-181. doi:10.1007/978-3-319-72751-6_13"},"year":"2017","page":"168-181","user_id":"15415","volume":10718,"status":"public","date_created":"2020-03-27T14:32:39Z","author":[{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publisher":"Springer","publication":"Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}"},{"title":"A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries","user_id":"15415","date_created":"2020-03-30T09:25:18Z","status":"public","publication":"Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)","department":[{"_id":"63"}],"author":[{"last_name":"Biermeier","full_name":"Biermeier, Felix","first_name":"Felix"},{"id":"22704","last_name":"Feldkord","full_name":"Feldkord, Björn","first_name":"Björn"},{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publisher":"Springer","doi":"10.1007/978-3-319-89441-6_21","date_updated":"2022-01-06T06:52:49Z","_id":"16348","page":"285 - 300","year":"2017","type":"conference","citation":{"mla":"Biermeier, Felix, et al. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300, doi:10.1007/978-3-319-89441-6_21.","bibtex":"@inproceedings{Biermeier_Feldkord_Malatyali_Meyer auf der Heide_2017, title={A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries}, DOI={10.1007/978-3-319-89441-6_21}, booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Biermeier, Felix and Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2017}, pages={285–300} }","ama":"Biermeier F, Feldkord B, Malatyali M, Meyer auf der Heide F. A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA). Springer; 2017:285-300. doi:10.1007/978-3-319-89441-6_21","apa":"Biermeier, F., Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2017). A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (pp. 285–300). Springer. https://doi.org/10.1007/978-3-319-89441-6_21","chicago":"Biermeier, Felix, Björn Feldkord, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 285–300. Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6_21.","ieee":"F. Biermeier, B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, pp. 285–300.","short":"F. Biermeier, B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300."},"language":[{"iso":"eng"}]},{"page":"182-197","type":"conference","citation":{"bibtex":"@inproceedings{Podlipyan_Li_Markarian_Meyer auf der Heide_2017, title={A Continuous Strategy for Collisionless Gathering}, DOI={10.1007/978-3-319-72751-6_14 }, booktitle={Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)}, author={Podlipyan, Pavel and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={182–197} }","mla":"Podlipyan, Pavel, et al. “A Continuous Strategy for Collisionless Gathering.” Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–97, doi:10.1007/978-3-319-72751-6_14 .","chicago":"Podlipyan, Pavel, Shouwei Li, Christine Markarian, and Friedhelm Meyer auf der Heide. “A Continuous Strategy for Collisionless Gathering.” In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 182–97, 2017. https://doi.org/10.1007/978-3-319-72751-6_14 .","apa":"Podlipyan, P., Li, S., Markarian, C., & Meyer auf der Heide, F. (2017). A Continuous Strategy for Collisionless Gathering. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) (pp. 182–197). https://doi.org/10.1007/978-3-319-72751-6_14 ","ama":"Podlipyan P, Li S, Markarian C, Meyer auf der Heide F. A Continuous Strategy for Collisionless Gathering. In: Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS). ; 2017:182-197. doi:10.1007/978-3-319-72751-6_14 ","ieee":"P. Podlipyan, S. Li, C. Markarian, and F. Meyer auf der Heide, “A Continuous Strategy for Collisionless Gathering,” in Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–197.","short":"P. Podlipyan, S. Li, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–197."},"year":"2017","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-72751-6_14 ","_id":"16349","date_updated":"2022-01-06T06:52:49Z","date_created":"2020-03-30T09:43:05Z","status":"public","department":[{"_id":"63"}],"publication":"Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)","author":[{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"},{"last_name":"Li","first_name":"Shouwei","full_name":"Li, Shouwei"},{"id":"37612","last_name":"Markarian","full_name":"Markarian, Christine","first_name":"Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"A Continuous Strategy for Collisionless Gathering","user_id":"15415"},{"user_id":"15415","title":"An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap","abstract":[{"text":"The self-organizing bio-hybrid collaboration ofrobots and natural plants allows for a variety of interestingapplications. As an example we investigate how robots can beused to control the growth and motion of a natural plant, using LEDs to provide stimuli. We follow an evolutionaryrobotics approach where task performance is determined bymonitoring the plant's reaction. First, we do initial plantexperiments with simple, predetermined controllers. Then weuse image sampling data as a model of the dynamics ofthe plant tip xy position. Second, we use this approach toevolve robot controllers in simulation. The task is to makethe plant approach three predetermined, distinct points in anxy-plane. Finally, we test the evolved controllers in real plantexperiments and find that we cross the reality gap successfully. We shortly describe how we have extended from plant tipto many points on the plant, for a model of the plant stemdynamics. Future work will extend to two-axes image samplingfor a 3-d approach.","lang":"eng"}],"status":"public","date_created":"2020-10-08T12:57:13Z","publication_identifier":{"isbn":["9781509035342"]},"publication_status":"published","author":[{"full_name":"Wahby, Mostafa","first_name":"Mostafa","last_name":"Wahby"},{"full_name":"Hofstadler, Daniel Nicolas","first_name":"Daniel Nicolas","last_name":"Hofstadler"},{"last_name":"Heinrich","first_name":"Mary Katherine","full_name":"Heinrich, Mary Katherine"},{"first_name":"Payam","full_name":"Zahadat, Payam","last_name":"Zahadat"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems","doi":"10.1109/saso.2016.8","date_updated":"2022-01-06T06:54:17Z","_id":"19961","language":[{"iso":"eng"}],"year":"2016","type":"conference","citation":{"bibtex":"@inproceedings{Wahby_Hofstadler_Heinrich_Zahadat_Hamann_2016, title={An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap}, DOI={10.1109/saso.2016.8}, booktitle={Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems}, author={Wahby, Mostafa and Hofstadler, Daniel Nicolas and Heinrich, Mary Katherine and Zahadat, Payam and Hamann, Heiko}, year={2016} }","mla":"Wahby, Mostafa, et al. “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap.” Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016, doi:10.1109/saso.2016.8.","apa":"Wahby, M., Hofstadler, D. N., Heinrich, M. K., Zahadat, P., & Hamann, H. (2016). An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap. In Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems. https://doi.org/10.1109/saso.2016.8","ama":"Wahby M, Hofstadler DN, Heinrich MK, Zahadat P, Hamann H. An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap. In: Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems. ; 2016. doi:10.1109/saso.2016.8","chicago":"Wahby, Mostafa, Daniel Nicolas Hofstadler, Mary Katherine Heinrich, Payam Zahadat, and Heiko Hamann. “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap.” In Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016. https://doi.org/10.1109/saso.2016.8.","ieee":"M. Wahby, D. N. Hofstadler, M. K. Heinrich, P. Zahadat, and H. Hamann, “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap,” in Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016.","short":"M. Wahby, D.N. Hofstadler, M.K. Heinrich, P. Zahadat, H. Hamann, in: Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016."}},{"author":[{"last_name":"Heinrich","full_name":"Heinrich, Mary Katherine","first_name":"Mary Katherine"},{"first_name":"Mostafa","full_name":"Wahby, Mostafa","last_name":"Wahby"},{"full_name":"Divband Soorati, Mohammad","first_name":"Mohammad","last_name":"Divband Soorati"},{"last_name":"Hofstadler","full_name":"Hofstadler, Daniel Nicolas","first_name":"Daniel Nicolas"},{"last_name":"Zahadat","first_name":"Payam","full_name":"Zahadat, Payam"},{"first_name":"Phil","full_name":"Ayres, Phil","last_name":"Ayres"},{"full_name":"Stoy, Kasper","first_name":"Kasper","last_name":"Stoy"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"publication":"Proc. of the 1st International Workshop on Self-Organising Construction (SOCO)","department":[{"_id":"63"},{"_id":"238"}],"publication_status":"published","publication_identifier":{"isbn":["9781509036516"]},"status":"public","date_created":"2020-10-09T13:57:21Z","title":"Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures","user_id":"15415","year":"2016","citation":{"apa":"Heinrich, M. K., Wahby, M., Divband Soorati, M., Hofstadler, D. N., Zahadat, P., Ayres, P., … Hamann, H. (2016). Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures. In Proc. of the 1st International Workshop on Self-Organising Construction (SOCO). https://doi.org/10.1109/fas-w.2016.43","ama":"Heinrich MK, Wahby M, Divband Soorati M, et al. Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures. In: Proc. of the 1st International Workshop on Self-Organising Construction (SOCO). ; 2016. doi:10.1109/fas-w.2016.43","chicago":"Heinrich, Mary Katherine, Mostafa Wahby, Mohammad Divband Soorati, Daniel Nicolas Hofstadler, Payam Zahadat, Phil Ayres, Kasper Stoy, and Heiko Hamann. “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures.” In Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016. https://doi.org/10.1109/fas-w.2016.43.","mla":"Heinrich, Mary Katherine, et al. “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures.” Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016, doi:10.1109/fas-w.2016.43.","bibtex":"@inproceedings{Heinrich_Wahby_Divband Soorati_Hofstadler_Zahadat_Ayres_Stoy_Hamann_2016, title={Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures}, DOI={10.1109/fas-w.2016.43}, booktitle={Proc. of the 1st International Workshop on Self-Organising Construction (SOCO)}, author={Heinrich, Mary Katherine and Wahby, Mostafa and Divband Soorati, Mohammad and Hofstadler, Daniel Nicolas and Zahadat, Payam and Ayres, Phil and Stoy, Kasper and Hamann, Heiko}, year={2016} }","short":"M.K. Heinrich, M. Wahby, M. Divband Soorati, D.N. Hofstadler, P. Zahadat, P. Ayres, K. Stoy, H. Hamann, in: Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016.","ieee":"M. K. Heinrich et al., “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures,” in Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016."},"type":"conference","language":[{"iso":"eng"}],"_id":"19968","date_updated":"2022-01-06T06:54:17Z","doi":"10.1109/fas-w.2016.43"},{"title":"Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems","user_id":"15415","publication_status":"published","publication_identifier":{"issn":["2296-9144"]},"status":"public","date_created":"2020-10-09T14:04:05Z","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Khaluf","full_name":"Khaluf, Yara","first_name":"Yara"},{"full_name":"Botev, Jean","first_name":"Jean","last_name":"Botev"},{"last_name":"Divband Soorati","full_name":"Divband Soorati, Mohammad","first_name":"Mohammad"},{"last_name":"Ferrante","first_name":"Eliseo","full_name":"Ferrante, Eliseo"},{"last_name":"Kosak","full_name":"Kosak, Oliver","first_name":"Oliver"},{"last_name":"Montanier","full_name":"Montanier, Jean-Marc","first_name":"Jean-Marc"},{"first_name":"Sanaz","full_name":"Mostaghim, Sanaz","last_name":"Mostaghim"},{"last_name":"Redpath","first_name":"Richard","full_name":"Redpath, Richard"},{"full_name":"Timmis, Jon","first_name":"Jon","last_name":"Timmis"},{"first_name":"Frank","full_name":"Veenstra, Frank","last_name":"Veenstra"},{"last_name":"Wahby","full_name":"Wahby, Mostafa","first_name":"Mostafa"},{"last_name":"Zamuda","full_name":"Zamuda, Aleš","first_name":"Aleš"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Frontiers in Robotics and AI","doi":"10.3389/frobt.2016.00014","_id":"19969","date_updated":"2022-01-06T06:54:17Z","citation":{"short":"H. Hamann, Y. Khaluf, J. Botev, M. Divband Soorati, E. Ferrante, O. Kosak, J.-M. Montanier, S. Mostaghim, R. Redpath, J. Timmis, F. Veenstra, M. Wahby, A. Zamuda, Frontiers in Robotics and AI (2016).","ieee":"H. Hamann et al., “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems,” Frontiers in Robotics and AI, 2016.","chicago":"Hamann, Heiko, Yara Khaluf, Jean Botev, Mohammad Divband Soorati, Eliseo Ferrante, Oliver Kosak, Jean-Marc Montanier, et al. “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-Organizing Systems.” Frontiers in Robotics and AI, 2016. https://doi.org/10.3389/frobt.2016.00014.","ama":"Hamann H, Khaluf Y, Botev J, et al. Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems. Frontiers in Robotics and AI. 2016. doi:10.3389/frobt.2016.00014","apa":"Hamann, H., Khaluf, Y., Botev, J., Divband Soorati, M., Ferrante, E., Kosak, O., … Zamuda, A. (2016). Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems. Frontiers in Robotics and AI. https://doi.org/10.3389/frobt.2016.00014","bibtex":"@article{Hamann_Khaluf_Botev_Divband Soorati_Ferrante_Kosak_Montanier_Mostaghim_Redpath_Timmis_et al._2016, title={Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems}, DOI={10.3389/frobt.2016.00014}, journal={Frontiers in Robotics and AI}, author={Hamann, Heiko and Khaluf, Yara and Botev, Jean and Divband Soorati, Mohammad and Ferrante, Eliseo and Kosak, Oliver and Montanier, Jean-Marc and Mostaghim, Sanaz and Redpath, Richard and Timmis, Jon and et al.}, year={2016} }","mla":"Hamann, Heiko, et al. “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-Organizing Systems.” Frontiers in Robotics and AI, 2016, doi:10.3389/frobt.2016.00014."},"type":"journal_article","year":"2016","language":[{"iso":"eng"}]},{"title":"Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures","user_id":"15415","date_created":"2020-10-12T13:06:07Z","status":"public","department":[{"_id":"63"},{"_id":"238"}],"publication":"IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016)","author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"first_name":"Mohammad","full_name":"Divband Soorati, Mohammad","last_name":"Divband Soorati"}],"doi":"10.1109/IROS.2016.7759845","_id":"19979","date_updated":"2022-01-06T06:54:17Z","year":"2016","type":"conference","citation":{"short":"H. Hamann, M. Divband Soorati, in: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016.","ieee":"H. Hamann and M. Divband Soorati, “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures,” in IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016.","chicago":"Hamann, Heiko, and Mohammad Divband Soorati. “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures.” In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016. https://doi.org/10.1109/IROS.2016.7759845.","ama":"Hamann H, Divband Soorati M. Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016). ; 2016. doi:10.1109/IROS.2016.7759845","apa":"Hamann, H., & Divband Soorati, M. (2016). Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016). https://doi.org/10.1109/IROS.2016.7759845","bibtex":"@inproceedings{Hamann_Divband Soorati_2016, title={Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures}, DOI={10.1109/IROS.2016.7759845}, booktitle={IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016)}, author={Hamann, Heiko and Divband Soorati, Mohammad}, year={2016} }","mla":"Hamann, Heiko, and Mohammad Divband Soorati. “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures.” IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016, doi:10.1109/IROS.2016.7759845."},"language":[{"iso":"eng"}]},{"intvolume":" 30","_id":"19983","date_updated":"2022-01-06T06:54:17Z","issue":"3","doi":"10.1007/s10458-015-9323-3","language":[{"iso":"eng"}],"page":"553-580","year":"2016","citation":{"mla":"Dorigo, Marco, et al. “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems.” Journal of Autonomous Agents and Multi-Agent Systems, vol. 30, no. 3, 2016, pp. 553–80, doi:10.1007/s10458-015-9323-3.","bibtex":"@article{Dorigo_Hamann_Valentini_Ferrante_2016, title={Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems}, volume={30}, DOI={10.1007/s10458-015-9323-3}, number={3}, journal={Journal of Autonomous Agents and Multi-Agent Systems}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Ferrante, Eliseo}, year={2016}, pages={553–580} }","chicago":"Dorigo, Marco, Heiko Hamann, Gabriele Valentini, and Eliseo Ferrante. “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems.” Journal of Autonomous Agents and Multi-Agent Systems 30, no. 3 (2016): 553–80. https://doi.org/10.1007/s10458-015-9323-3.","ama":"Dorigo M, Hamann H, Valentini G, Ferrante E. Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems. Journal of Autonomous Agents and Multi-Agent Systems. 2016;30(3):553-580. doi:10.1007/s10458-015-9323-3","apa":"Dorigo, M., Hamann, H., Valentini, G., & Ferrante, E. (2016). Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems. Journal of Autonomous Agents and Multi-Agent Systems, 30(3), 553–580. https://doi.org/10.1007/s10458-015-9323-3","ieee":"M. Dorigo, H. Hamann, G. Valentini, and E. Ferrante, “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems,” Journal of Autonomous Agents and Multi-Agent Systems, vol. 30, no. 3, pp. 553–580, 2016.","short":"M. Dorigo, H. Hamann, G. Valentini, E. Ferrante, Journal of Autonomous Agents and Multi-Agent Systems 30 (2016) 553–580."},"type":"journal_article","user_id":"15415","title":"Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems","department":[{"_id":"63"},{"_id":"238"}],"publication":"Journal of Autonomous Agents and Multi-Agent Systems","author":[{"last_name":"Dorigo","first_name":"Marco","full_name":"Dorigo, Marco"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"full_name":"Valentini, Gabriele","first_name":"Gabriele","last_name":"Valentini"},{"last_name":"Ferrante","first_name":"Eliseo","full_name":"Ferrante, Eliseo"}],"date_created":"2020-10-13T08:33:37Z","status":"public","volume":30},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"title":"Existence and Properties of Pure Nash Equilibria in Budget Games","related_material":{"link":[{"url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915","relation":"confirmation"}]},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:18Z","date_created":"2017-10-17T12:41:31Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-03-21T10:45:57Z","author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"}],"publisher":"Universität Paderborn","file":[{"date_created":"2018-03-21T10:45:57Z","file_name":"200-thesis.pdf","access_level":"closed","file_size":880390,"creator":"florida","file_id":"1525","date_updated":"2018-03-21T10:45:57Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"ddc":["040"],"user_id":"15415","citation":{"ieee":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","short":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games, Universität Paderborn, 2016.","bibtex":"@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian}, year={2016} }","mla":"Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","chicago":"Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","ama":"Drees M. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn; 2016.","apa":"Drees, M. (2016). Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn."},"type":"dissertation","year":"2016","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"_id":"200"},{"user_id":"15415","title":"Population Coding: A New Design Paradigm for Embodied Distributed Systems","place":"Cham","date_created":"2020-10-15T09:55:35Z","status":"public","publication_identifier":{"isbn":["9783319444260","9783319444277"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","department":[{"_id":"63"},{"_id":"238"}],"publication":"10th Int. Conf. on Swarm Intelligence, ANTS 2016","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Gabriele","full_name":"Valentini, Gabriele","last_name":"Valentini"},{"first_name":"Marco","full_name":"Dorigo, Marco","last_name":"Dorigo"}],"doi":"10.1007/978-3-319-44427-7_15","_id":"20000","date_updated":"2022-01-06T06:54:18Z","language":[{"iso":"eng"}],"type":"conference","citation":{"short":"H. Hamann, G. Valentini, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence, ANTS 2016, Cham, 2016.","ieee":"H. Hamann, G. Valentini, and M. Dorigo, “Population Coding: A New Design Paradigm for Embodied Distributed Systems,” in 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016.","ama":"Hamann H, Valentini G, Dorigo M. Population Coding: A New Design Paradigm for Embodied Distributed Systems. In: 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham; 2016. doi:10.1007/978-3-319-44427-7_15","apa":"Hamann, H., Valentini, G., & Dorigo, M. (2016). Population Coding: A New Design Paradigm for Embodied Distributed Systems. In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham. https://doi.org/10.1007/978-3-319-44427-7_15","chicago":"Hamann, Heiko, Gabriele Valentini, and Marco Dorigo. “Population Coding: A New Design Paradigm for Embodied Distributed Systems.” In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham, 2016. https://doi.org/10.1007/978-3-319-44427-7_15.","mla":"Hamann, Heiko, et al. “Population Coding: A New Design Paradigm for Embodied Distributed Systems.” 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016, doi:10.1007/978-3-319-44427-7_15.","bibtex":"@inproceedings{Hamann_Valentini_Dorigo_2016, place={Cham}, title={Population Coding: A New Design Paradigm for Embodied Distributed Systems}, DOI={10.1007/978-3-319-44427-7_15}, booktitle={10th Int. Conf. on Swarm Intelligence, ANTS 2016}, author={Hamann, Heiko and Valentini, Gabriele and Dorigo, Marco}, year={2016} }"},"year":"2016"},{"_id":"20001","date_updated":"2022-01-06T06:54:18Z","doi":"10.1145/2993369.2993400","citation":{"short":"S. von Mammen, H. Hamann, M. Heider, in: ACM Symposium on Virtual Reality Software and Technology (VRST), 2016.","ieee":"S. von Mammen, H. Hamann, and M. Heider, “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems,” in ACM Symposium on Virtual Reality Software and Technology (VRST), 2016.","chicago":"Mammen, Sebastian von, Heiko Hamann, and Michael Heider. “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems.” In ACM Symposium on Virtual Reality Software and Technology (VRST), 2016. https://doi.org/10.1145/2993369.2993400.","apa":"von Mammen, S., Hamann, H., & Heider, M. (2016). Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems. In ACM Symposium on Virtual Reality Software and Technology (VRST). https://doi.org/10.1145/2993369.2993400","ama":"von Mammen S, Hamann H, Heider M. Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems. In: ACM Symposium on Virtual Reality Software and Technology (VRST). ; 2016. doi:10.1145/2993369.2993400","mla":"von Mammen, Sebastian, et al. “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems.” ACM Symposium on Virtual Reality Software and Technology (VRST), 2016, doi:10.1145/2993369.2993400.","bibtex":"@inproceedings{von Mammen_Hamann_Heider_2016, title={Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems}, DOI={10.1145/2993369.2993400}, booktitle={ACM Symposium on Virtual Reality Software and Technology (VRST)}, author={von Mammen, Sebastian and Hamann, Heiko and Heider, Michael}, year={2016} }"},"type":"conference","year":"2016","language":[{"iso":"eng"}],"title":"Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems","user_id":"15415","publication":"ACM Symposium on Virtual Reality Software and Technology (VRST)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"von Mammen","first_name":"Sebastian","full_name":"von Mammen, Sebastian"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Michael","full_name":"Heider, Michael","last_name":"Heider"}],"publication_status":"published","publication_identifier":{"isbn":["9781450344913"]},"date_created":"2020-10-15T10:00:23Z","status":"public"},{"user_id":"15415","title":"Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes","date_created":"2020-10-15T10:05:11Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781450342063"]},"publication":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"full_name":"Rybář, Milan","first_name":"Milan","last_name":"Rybář"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"}],"doi":"10.1145/2908812.2908815","_id":"20002","date_updated":"2022-01-06T06:54:18Z","language":[{"iso":"eng"}],"year":"2016","citation":{"bibtex":"@inproceedings{Rybář_Hamann_2016, title={Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes}, DOI={10.1145/2908812.2908815}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016)}, author={Rybář, Milan and Hamann, Heiko}, year={2016} }","mla":"Rybář, Milan, and Heiko Hamann. “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes.” Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016, doi:10.1145/2908812.2908815.","ama":"Rybář M, Hamann H. Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016). ; 2016. doi:10.1145/2908812.2908815","apa":"Rybář, M., & Hamann, H. (2016). Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016). https://doi.org/10.1145/2908812.2908815","chicago":"Rybář, Milan, and Heiko Hamann. “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes.” In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016. https://doi.org/10.1145/2908812.2908815.","ieee":"M. Rybář and H. Hamann, “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016.","short":"M. Rybář, H. Hamann, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016."},"type":"conference"},{"status":"public","date_created":"2020-10-15T10:16:39Z","volume":9882,"author":[{"last_name":"Khaluf","first_name":"Yara","full_name":"Khaluf, Yara"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"ANTS 2016","user_id":"15415","title":"On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations","language":[{"iso":"eng"}],"type":"conference","citation":{"short":"Y. Khaluf, H. Hamann, in: ANTS 2016, 2016, p. 298.","ieee":"Y. Khaluf and H. Hamann, “On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations,” in ANTS 2016, 2016, vol. 9882, p. 298.","ama":"Khaluf Y, Hamann H. On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations. In: ANTS 2016. Vol 9882. ; 2016:298.","apa":"Khaluf, Y., & Hamann, H. (2016). On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations. In ANTS 2016 (Vol. 9882, p. 298).","chicago":"Khaluf, Yara, and Heiko Hamann. “On the Definition of Self-Organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations.” In ANTS 2016, 9882:298, 2016.","mla":"Khaluf, Yara, and Heiko Hamann. “On the Definition of Self-Organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations.” ANTS 2016, vol. 9882, 2016, p. 298.","bibtex":"@inproceedings{Khaluf_Hamann_2016, title={On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations}, volume={9882}, booktitle={ANTS 2016}, author={Khaluf, Yara and Hamann, Heiko}, year={2016}, pages={298} }"},"year":"2016","page":"298","date_updated":"2022-01-06T06:54:18Z","_id":"20003","intvolume":" 9882"},{"language":[{"iso":"eng"}],"citation":{"short":"G. Valentini, D. Brambilla, H. Hamann, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016.","ieee":"G. Valentini, D. Brambilla, H. Hamann, and M. Dorigo, “Collective Perception of Environmental Features in a Robot Swarm,” in 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016.","apa":"Valentini, G., Brambilla, D., Hamann, H., & Dorigo, M. (2016). Collective Perception of Environmental Features in a Robot Swarm. In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. https://doi.org/10.1007/978-3-319-44427-7_6","ama":"Valentini G, Brambilla D, Hamann H, Dorigo M. Collective Perception of Environmental Features in a Robot Swarm. In: 10th Int. Conf. on Swarm Intelligence, ANTS 2016. ; 2016. doi:10.1007/978-3-319-44427-7_6","chicago":"Valentini, Gabriele, Davide Brambilla, Heiko Hamann, and Marco Dorigo. “Collective Perception of Environmental Features in a Robot Swarm.” In 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016. https://doi.org/10.1007/978-3-319-44427-7_6.","bibtex":"@inproceedings{Valentini_Brambilla_Hamann_Dorigo_2016, title={Collective Perception of Environmental Features in a Robot Swarm}, DOI={10.1007/978-3-319-44427-7_6}, booktitle={10th Int. Conf. on Swarm Intelligence, ANTS 2016}, author={Valentini, Gabriele and Brambilla, Davide and Hamann, Heiko and Dorigo, Marco}, year={2016} }","mla":"Valentini, Gabriele, et al. “Collective Perception of Environmental Features in a Robot Swarm.” 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016, doi:10.1007/978-3-319-44427-7_6."},"type":"conference","year":"2016","doi":"10.1007/978-3-319-44427-7_6","_id":"20004","date_updated":"2022-01-06T06:54:18Z","status":"public","date_created":"2020-10-15T10:22:20Z","publication_identifier":{"isbn":["9783319444260","9783319444277"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","author":[{"full_name":"Valentini, Gabriele","first_name":"Gabriele","last_name":"Valentini"},{"full_name":"Brambilla, Davide","first_name":"Davide","last_name":"Brambilla"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"full_name":"Dorigo, Marco","first_name":"Marco","last_name":"Dorigo"}],"publication":"10th Int. Conf. on Swarm Intelligence, ANTS 2016","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","title":"Collective Perception of Environmental Features in a Robot Swarm"},{"year":"2016","type":"mastersthesis","citation":{"mla":"Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","bibtex":"@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }","chicago":"Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","ama":"Leder L. Congestion Games with Mixed Objectives. Universität Paderborn; 2016.","apa":"Leder, L. (2016). Congestion Games with Mixed Objectives. Universität Paderborn.","ieee":"L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","short":"L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016."},"supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"date_updated":"2022-01-06T06:54:42Z","_id":"210","date_created":"2017-10-17T12:41:33Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","department":[{"_id":"63"},{"_id":"541"}],"publisher":"Universität Paderborn","author":[{"full_name":"Leder, Lennart","first_name":"Lennart","last_name":"Leder"}],"title":"Congestion Games with Mixed Objectives","user_id":"14052"},{"ddc":["040"],"user_id":"14955","abstract":[{"text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems.","lang":"eng"}],"date_created":"2017-10-17T12:41:33Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-03-21T10:41:40Z","publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":[{"last_name":"Drees","full_name":"Drees, Maximilian","first_name":"Maximilian"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"creator":"florida","file_id":"1518","file_size":352996,"success":1,"relation":"main_file","date_updated":"2018-03-21T10:41:40Z","content_type":"application/pdf","date_created":"2018-03-21T10:41:40Z","file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","access_level":"closed"}],"_id":"215","page":"417--427","citation":{"ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427, 2016. https://doi.org/10.1145/2935764.2935783.","apa":"Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427). https://doi.org/10.1145/2935764.2935783","ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783"},"year":"2016","type":"conference","title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"79"},{"_id":"63"}],"doi":"10.1145/2935764.2935783","date_updated":"2022-01-06T06:55:02Z","language":[{"iso":"eng"}]},{"year":"2016","citation":{"short":"G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, pp. 417–425.","ieee":"G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation Habits,” in Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, vol. Volume 285: ECAI 2016, pp. 417–425.","apa":"Polevoy, G., de Weerdt, M. M., & Jonker, C. M. (2016). The Game of Reciprocation Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence (Vol. Volume 285: ECAI 2016, pp. 417–425). https://doi.org/10.3233/978-1-61499-672-9-417","ama":"Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In: Proceedings of the 2016 European Conference on Artificial Intelligence. Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications. ; 2016:417-425. doi:10.3233/978-1-61499-672-9-417","chicago":"Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation Habits.” In Proceedings of the 2016 European Conference on Artificial Intelligence, Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications, 2016. https://doi.org/10.3233/978-1-61499-672-9-417.","mla":"Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” Proceedings of the 2016 European Conference on Artificial Intelligence, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, series={Frontiers in Artificial Intelligence and Applications}, title={The Game of Reciprocation Habits}, volume={Volume 285: ECAI 2016}, DOI={10.3233/978-1-61499-672-9-417}, booktitle={Proceedings of the 2016 European Conference on Artificial Intelligence}, author={Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}, year={2016}, pages={417–425}, collection={Frontiers in Artificial Intelligence and Applications} }"},"type":"conference","page":"417-425","language":[{"iso":"eng"}],"series_title":"Frontiers in Artificial Intelligence and Applications","doi":"10.3233/978-1-61499-672-9-417","_id":"17655","date_updated":"2022-01-06T06:53:16Z","volume":"Volume 285: ECAI 2016","status":"public","date_created":"2020-08-06T15:20:30Z","author":[{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"de Weerdt","first_name":"M.M.","full_name":"de Weerdt, M.M."},{"last_name":"Jonker","full_name":"Jonker, C.M.","first_name":"C.M."}],"department":[{"_id":"63"},{"_id":"541"}],"keyword":["agents","action","repeated reciprocation","fixed","floating","network","Nash equilibrium","social welfare","price of anarchy","price of stability","convex combination"],"publication":"Proceedings of the 2016 European Conference on Artificial Intelligence","title":"The Game of Reciprocation Habits","user_id":"83983","extern":"1"},{"citation":{"apa":"Polevoy, G., de Weerdt, M., & Jonker, C. (2016). The Convergence of Reciprocation. In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","ama":"Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2016:1431-1432.","chicago":"Polevoy, Gleb, Mathijs de Weerdt, and Catholijn Jonker. “The Convergence of Reciprocation.” In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 1431–32. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2016.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, place={Richland, SC}, series={AAMAS ’16}, title={The Convergence of Reciprocation}, booktitle={Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn}, year={2016}, pages={1431–1432}, collection={AAMAS ’16} }","mla":"Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32.","short":"G. Polevoy, M. de Weerdt, C. Jonker, in: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2016, pp. 1431–1432.","ieee":"G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,” in Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 2016, pp. 1431–1432."},"type":"conference","year":"2016","page":"1431-1432","language":[{"iso":"eng"}],"series_title":"AAMAS '16","date_updated":"2022-01-06T06:53:16Z","_id":"17656","publication_identifier":{"isbn":["978-1-4503-4239-1"]},"status":"public","date_created":"2020-08-06T15:20:45Z","author":[{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"de Weerdt","first_name":"Mathijs","full_name":"de Weerdt, Mathijs"},{"first_name":"Catholijn","full_name":"Jonker, Catholijn","last_name":"Jonker"}],"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","keyword":["agent's influence","behavior","convergence","perron-frobenius","reciprocal interaction","repeated reciprocation"],"department":[{"_id":"63"},{"_id":"541"}],"publication":"Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems","title":"The Convergence of Reciprocation","user_id":"83983","extern":"1","place":"Richland, SC"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"title":"On the Parameterized Parallel Complexity and the Vertex Cover Problem","language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-48749-6_35","date_updated":"2022-01-06T06:53:17Z","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:26Z","file":[{"access_level":"closed","date_created":"2018-11-02T14:15:18Z","file_name":"OnTheParameterizedParallelComp.pdf","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-02T14:15:18Z","creator":"ups","file_id":"5266","file_size":293345}],"author":[{"full_name":"Abu-Khzam, Faisal N.","first_name":"Faisal N.","last_name":"Abu-Khzam"},{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"},{"id":"37612","last_name":"Markarian","full_name":"Markarian, Christine","first_name":"Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Podlipyan, Pavel","first_name":"Pavel","last_name":"Podlipyan"}],"publication":"Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-11-02T14:15:18Z","user_id":"477","ddc":["000"],"abstract":[{"lang":"eng","text":"Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus."}],"year":"2016","type":"conference","citation":{"chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 477–88. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_35.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. On the Parameterized Parallel Complexity and the Vertex Cover Problem. In: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:477-488. doi:10.1007/978-3-319-48749-6_35","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 477–488). https://doi.org/10.1007/978-3-319-48749-6_35","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex Cover Problem}, DOI={10.1007/978-3-319-48749-6_35}, booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={477–488}, collection={LNCS} }","mla":"Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88, doi:10.1007/978-3-319-48749-6_35.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488."},"page":"477-488","_id":"177"},{"title":"Introduction to the Special Issue on SPAA 2014","ddc":["040"],"user_id":"15504","file_date_updated":"2018-03-21T12:31:42Z","department":[{"_id":"63"}],"publication":"Transactions on Parallel Computing (TOPC)","file":[{"access_level":"closed","date_created":"2018-03-21T12:31:42Z","file_name":"187-a1-heide.pdf","date_updated":"2018-03-21T12:31:42Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":34053,"creator":"florida","file_id":"1531"}],"editor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:28Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_updated":"2022-01-06T06:53:51Z","_id":"187","doi":"10.1145/2936716","issue":"1","type":"journal_editor","year":"2016","citation":{"bibtex":"@book{Meyer auf der Heide_2016, title={Introduction to the Special Issue on SPAA 2014}, DOI={10.1145/2936716}, number={1}, journal={Transactions on Parallel Computing (TOPC)}, year={2016} }","mla":"Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.” Transactions on Parallel Computing (TOPC), no. 1, 2016, doi:10.1145/2936716.","ama":"Meyer auf der Heide F, ed. Introduction to the Special Issue on SPAA 2014.; 2016. doi:10.1145/2936716","apa":"Meyer auf der Heide, F. (Ed.). (2016). Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC). https://doi.org/10.1145/2936716","chicago":"Meyer auf der Heide, Friedhelm, ed. Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC), 2016. https://doi.org/10.1145/2936716.","ieee":"F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA 2014, no. 1. 2016.","short":"F. Meyer auf der Heide, ed., Introduction to the Special Issue on SPAA 2014, 2016."},"page":"1"},{"date_updated":"2022-01-06T06:54:33Z","doi":"10.1007/978-3-319-48749-6_42","language":[{"iso":"eng"}],"title":"Cost-efficient Scheduling on Machines from the Cloud","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"207","page":"578--592","year":"2016","citation":{"short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 578--592, 2016. https://doi.org/10.1007/978-3-319-48749-6_42.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). ; 2016:578--592. doi:10.1007/978-3-319-48749-6_42","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, DOI={10.1007/978-3-319-48749-6_42}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592} }","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42."},"type":"conference","abstract":[{"lang":"eng","text":"We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\\beta$. While for $\\beta series = {LNCS}"}],"ddc":["000"],"user_id":"477","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-11-02T14:18:51Z","author":[{"last_name":"Mäcker","id":"13536","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"full_name":"Malatyali, Manuel","first_name":"Manuel","last_name":"Malatyali"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"}],"file":[{"content_type":"application/pdf","date_updated":"2018-11-02T14:18:51Z","success":1,"relation":"main_file","file_size":608614,"creator":"ups","file_id":"5268","access_level":"closed","file_name":"Cost-EfficientSchedulingOnMach.pdf","date_created":"2018-11-02T14:18:51Z"}],"date_created":"2017-10-17T12:41:32Z","has_accepted_license":"1","status":"public"},{"year":"2016","type":"conference","citation":{"short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.","apa":"Feldotto, M., Leder, L., & Skopalik, A. (2016). Congestion Games with Mixed Objectives. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 655--669). https://doi.org/10.1007/978-3-319-48749-6_47","ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Mixed Objectives. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:655--669. doi:10.1007/978-3-319-48749-6_47","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 655--669. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_47.","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669, doi:10.1007/978-3-319-48749-6_47.","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2016, series={LNCS}, title={Congestion Games with Mixed Objectives}, DOI={10.1007/978-3-319-48749-6_47}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2016}, pages={655--669}, collection={LNCS} }"},"page":"655--669","_id":"209","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:32Z","author":[{"last_name":"Feldotto","id":"14052","first_name":"Matthias","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516"},{"last_name":"Leder","full_name":"Leder, Lennart","first_name":"Lennart"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-10-31T17:03:44Z","file":[{"file_id":"5233","creator":"feldi","file_size":235739,"success":1,"relation":"main_file","date_updated":"2018-10-31T17:03:44Z","content_type":"application/pdf","date_created":"2018-10-31T17:03:44Z","file_name":"Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf","access_level":"closed"}],"ddc":["000"],"user_id":"14052","abstract":[{"text":"We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-48749-6_47","date_updated":"2022-01-06T06:54:41Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"title":"Congestion Games with Mixed Objectives","external_id":{"arxiv":["1607.05143"]}},{"status":"public","date_created":"2018-11-07T09:26:42Z","author":[{"full_name":"Bülling, Jonas","first_name":"Jonas","last_name":"Bülling"}],"department":[{"_id":"63"}],"user_id":"22704","title":"Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden","language":[{"iso":"eng"}],"citation":{"ieee":"J. Bülling, Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden. 2016.","short":"J. Bülling, Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016.","bibtex":"@book{Bülling_2016, title={Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden}, author={Bülling, Jonas}, year={2016} }","mla":"Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden. 2016.","chicago":"Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016.","ama":"Bülling J. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden.; 2016.","apa":"Bülling, J. (2016). Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden."},"type":"bachelorsthesis","year":"2016","_id":"5406","date_updated":"2022-01-06T07:01:51Z"},{"status":"public","date_created":"2018-11-07T09:45:57Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"author":[{"last_name":"Koepe","full_name":"Koepe, Jörn","first_name":"Jörn"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}],"user_id":"477","title":"Price-Based Allocation Games","language":[{"iso":"eng"}],"citation":{"chicago":"Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.","ama":"Koepe J. Price-Based Allocation Games. Universität Paderborn; 2016.","apa":"Koepe, J. (2016). Price-Based Allocation Games. Universität Paderborn.","bibtex":"@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität Paderborn}, author={Koepe, Jörn}, year={2016} }","mla":"Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.","short":"J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016.","ieee":"J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016."},"year":"2016","type":"bachelorsthesis","date_updated":"2022-01-06T07:01:51Z","_id":"5407"},{"title":"Friendship Processes in Network Creation Games","user_id":"477","publisher":"Universität Paderborn","author":[{"last_name":"Kutzias","full_name":"Kutzias, Damian","first_name":"Damian"}],"department":[{"_id":"63"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-11-14T06:50:35Z","_id":"688","date_updated":"2022-01-06T07:03:23Z","type":"mastersthesis","year":"2016","citation":{"chicago":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","ama":"Kutzias D. Friendship Processes in Network Creation Games. Universität Paderborn; 2016.","apa":"Kutzias, D. (2016). Friendship Processes in Network Creation Games. Universität Paderborn.","bibtex":"@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }","mla":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","short":"D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016.","ieee":"D. Kutzias, Friendship Processes in Network Creation Games. Universität Paderborn, 2016."},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}]},{"citation":{"ama":"Schaefer JS. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn; 2016.","apa":"Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn.","chicago":"Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.","mla":"Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.","bibtex":"@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }","short":"J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016.","ieee":"J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016."},"year":"2016","type":"mastersthesis","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_updated":"2022-01-06T07:03:23Z","_id":"689","status":"public","date_created":"2017-11-14T06:51:37Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"author":[{"last_name":"Schaefer","id":"30291","first_name":"Johannes Sebastian","full_name":"Schaefer, Johannes Sebastian"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}],"title":"Routing Algorithms on Delayed Networks for Disaster Management Support","user_id":"477"},{"date_created":"2020-04-07T07:20:47Z","status":"public","department":[{"_id":"63"}],"publication":"arXiv:1602.03303","author":[{"last_name":"Cord-Landwehr","first_name":"Andreas ","full_name":"Cord-Landwehr, Andreas "},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"full_name":"Jung, Daniel","first_name":"Daniel","id":"37827","last_name":"Jung"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"user_id":"15415","title":"Asymptotically Optimal Gathering on a Grid","external_id":{"arxiv":["1602.03303"]},"abstract":[{"text":"In this paper, we solve the local gathering problem of a swarm of $n$\r\nindistinguishable, point-shaped robots on a two dimensional grid in\r\nasymptotically optimal time $\\mathcal{O}(n)$ in the fully synchronous\r\n$\\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected)\r\nswarm of robots, the gathering problem on the grid is to locate all robots\r\nwithin a $2\\times 2$-sized area that is not known beforehand. Two robots are\r\nconnected if they are vertical or horizontal neighbors on the grid. The\r\nlocality constraint means that no global control, no compass, no global\r\ncommunication and only local vision is available; hence, a robot can only see\r\nits grid neighbors up to a constant $L_1$-distance, which also limits its\r\nmovements. A robot can move to one of its eight neighboring grid cells and if\r\ntwo or more robots move to the same location they are \\emph{merged} to be only\r\none robot. The locality constraint is the significant challenging issue here,\r\nsince robot movements must not harm the (only globally checkable) swarm\r\nconnectivity. For solving the gathering problem, we provide a synchronous\r\nalgorithm -- executed by every robot -- which ensures that robots merge without\r\nbreaking the swarm connectivity. In our model, robots can obtain a special\r\nstate, which marks such a robot to be performing specific connectivity\r\npreserving movements in order to allow later merge operations of the swarm.\r\nCompared to the grid, for gathering in the Euclidean plane for the same robot\r\nand time model the best known upper bound is $\\mathcal{O}(n^2)$.","lang":"eng"}],"language":[{"iso":"eng"}],"year":"2016","citation":{"mla":"Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.","bibtex":"@article{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, journal={arXiv:1602.03303}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016} }","chicago":"Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.","apa":"Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303.","ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. arXiv:160203303. 2016.","ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” arXiv:1602.03303. 2016.","short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1602.03303 (2016)."},"type":"preprint","_id":"16450","date_updated":"2022-01-06T06:52:50Z"},{"title":"Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application","department":[{"_id":"66"},{"_id":"238"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_updated":"2022-01-06T06:52:58Z","doi":"10.1007/978-3-319-30668-1_18","series_title":"LNCS 9594","language":[{"iso":"eng"}],"abstract":[{"text":"We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study.","lang":"eng"}],"user_id":"57458","ddc":["040"],"file":[{"access_level":"closed","file_name":"169-kuehne.pdf","date_created":"2018-03-21T12:41:08Z","relation":"main_file","success":1,"date_updated":"2018-03-21T12:41:08Z","content_type":"application/pdf","file_id":"1540","creator":"florida","file_size":2069427}],"publication":"Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)","file_date_updated":"2018-03-21T12:41:08Z","author":[{"full_name":"Kühne, Thomas","first_name":"Thomas","id":"49079","last_name":"Kühne"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"full_name":"Arifulina, Svetlana","first_name":"Svetlana","last_name":"Arifulina"},{"first_name":"Gregor","full_name":"Engels, Gregor","last_name":"Engels","id":"107"}],"date_created":"2017-10-17T12:41:25Z","has_accepted_license":"1","status":"public","_id":"169","page":"278--293","citation":{"chicago":"Kühne, Thomas, Heiko Hamann, Svetlana Arifulina, and Gregor Engels. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 278--293. LNCS 9594, 2016. https://doi.org/10.1007/978-3-319-30668-1_18.","apa":"Kühne, T., Hamann, H., Arifulina, S., & Engels, G. (2016). Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) (pp. 278--293). https://doi.org/10.1007/978-3-319-30668-1_18","ama":"Kühne T, Hamann H, Arifulina S, Engels G. Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016). LNCS 9594. ; 2016:278--293. doi:10.1007/978-3-319-30668-1_18","bibtex":"@inproceedings{Kühne_Hamann_Arifulina_Engels_2016, series={LNCS 9594}, title={Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}, DOI={10.1007/978-3-319-30668-1_18}, booktitle={Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)}, author={Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor}, year={2016}, pages={278--293}, collection={LNCS 9594} }","mla":"Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293, doi:10.1007/978-3-319-30668-1_18.","short":"T. Kühne, H. Hamann, S. Arifulina, G. Engels, in: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.","ieee":"T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application,” in Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293."},"type":"conference","year":"2016"},{"date_updated":"2022-01-06T06:50:51Z","_id":"1082","supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","year":"2016","citation":{"apa":"Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn.","ama":"Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn; 2016.","chicago":"Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.","mla":"Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.","bibtex":"@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken}, publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }","short":"T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität Paderborn, 2016.","ieee":"T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016."},"user_id":"14052","title":"Über die Rolle von Informationen in Verkehrsnetzwerken","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-12-19T10:10:17Z","author":[{"last_name":"Handirk","full_name":"Handirk, Tobias","first_name":"Tobias"}],"publisher":"Universität Paderborn","department":[{"_id":"63"},{"_id":"541"}]},{"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"type":"dissertation","year":"2016","citation":{"mla":"Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","bibtex":"@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","chicago":"Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","apa":"Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Cord-Landwehr A. Selfish Network Creation - On Variants of Network Creation Games. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2016.","ieee":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","short":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016."},"intvolume":" 353","_id":"154","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:22Z","volume":353,"file":[{"date_created":"2018-03-21T12:52:03Z","file_name":"154-dissertation.pdf","access_level":"closed","file_id":"1551","creator":"florida","file_size":800101,"relation":"main_file","success":1,"date_updated":"2018-03-21T12:52:03Z","content_type":"application/pdf"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"}],"file_date_updated":"2018-03-21T12:52:03Z","user_id":"5786","ddc":["040"],"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:52:23Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publication_identifier":{"isbn":["978-3-942647-72-4"]},"department":[{"_id":"63"},{"_id":"26"}],"related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089","relation":"confirmation"}]},"title":"Selfish Network Creation - On Variants of Network Creation Games"},{"_id":"157","type":"conference","citation":{"mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41.","bibtex":"@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS}, title={Scheduling with Interjob Communication on Parallel Processors}, DOI={10.1007/978-3-319-48749-6_41}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577}, collection={LNCS} }","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 563--577. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_41.","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob Communication on Parallel Processors. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:563--577. doi:10.1007/978-3-319-48749-6_41","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 563--577). https://doi.org/10.1007/978-3-319-48749-6_41","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577.","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577."},"year":"2016","page":"563--577","abstract":[{"lang":"eng","text":"Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees."}],"ddc":["040"],"user_id":"15504","author":[{"last_name":"König","full_name":"König, Jürgen","first_name":"Jürgen"},{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-03-21T12:50:29Z","file":[{"file_id":"1549","creator":"florida","file_size":753147,"success":1,"relation":"main_file","date_updated":"2018-03-21T12:50:29Z","content_type":"application/pdf","file_name":"157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf","date_created":"2018-03-21T12:50:29Z","access_level":"closed"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:22Z","date_updated":"2022-01-06T06:52:32Z","doi":"10.1007/978-3-319-48749-6_41","series_title":"LNCS","title":"Scheduling with Interjob Communication on Parallel Processors","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}],"title":"Routing Games With Progressive Filling","language":[{"iso":"eng"}],"doi":"10.1109/TNET.2015.2468571","date_updated":"2022-01-06T06:52:40Z","date_created":"2017-10-17T12:41:23Z","status":"public","has_accepted_license":"1","publication":"IEEE/ACM Transactions on Networking","file_date_updated":"2018-03-21T12:48:02Z","author":[{"first_name":"Tobias","full_name":"Harks, Tobias","last_name":"Harks"},{"first_name":"Martin","full_name":"Höfer, Martin","last_name":"Höfer"},{"first_name":"Kevin","full_name":"Schewior, Kevin","last_name":"Schewior"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"publisher":"IEEE","file":[{"access_level":"closed","date_created":"2018-03-21T12:48:02Z","file_name":"159-Harks-Hoefer-Schewior-Skopalik2016.pdf","content_type":"application/pdf","date_updated":"2018-03-21T12:48:02Z","success":1,"relation":"main_file","file_size":1655309,"creator":"florida","file_id":"1547"}],"ddc":["040"],"user_id":"477","abstract":[{"text":"Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived.","lang":"eng"}],"page":"2553 - 2562","year":"2016","type":"journal_article","citation":{"ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” IEEE/ACM Transactions on Networking, no. 4, pp. 2553–2562, 2016.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.","mla":"Harks, Tobias, et al. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.","bibtex":"@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With Progressive Filling}, DOI={10.1109/TNET.2015.2468571}, number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016}, pages={2553–2562} }","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking. 2016;(4):2553-2562. doi:10.1109/TNET.2015.2468571","apa":"Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2016). Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking, (4), 2553–2562. https://doi.org/10.1109/TNET.2015.2468571","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4 (2016): 2553–62. https://doi.org/10.1109/TNET.2015.2468571."},"issue":"4","_id":"159"},{"_id":"149","type":"conference","year":"2016","citation":{"ieee":"M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.","short":"M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.","mla":"Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.","bibtex":"@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic Online Facility Location}, DOI={10.1007/978-3-319-48749-6_43}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS} }","chicago":"Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_43.","apa":"Drees, M., Feldkord, B., & Skopalik, A. (2016). Strategic Online Facility Location. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 593--607). https://doi.org/10.1007/978-3-319-48749-6_43","ama":"Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:593--607. doi:10.1007/978-3-319-48749-6_43"},"page":"593--607","user_id":"477","ddc":["040"],"abstract":[{"lang":"eng","text":"In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α)."}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:21Z","file":[{"access_level":"closed","file_name":"149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf","date_created":"2018-03-21T12:55:43Z","date_updated":"2018-03-21T12:55:43Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":236253,"file_id":"1553","creator":"florida"}],"author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-03-21T12:55:43Z","doi":"10.1007/978-3-319-48749-6_43","date_updated":"2022-01-06T06:52:10Z","language":[{"iso":"eng"}],"series_title":"LNCS","title":"Strategic Online Facility Location","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}]},{"department":[{"_id":"63"}],"publisher":"ACM","editor":[{"last_name":"Dressler","first_name":"Falko","full_name":"Dressler, Falko"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:41:23Z","status":"public","title":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)","user_id":"15504","citation":{"apa":"Dressler, F., & Meyer auf der Heide, F. (Eds.). (2016). Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Presented at the MobiHoc, Paderborn, Germany: ACM. https://doi.org/10.1145/2942358","ama":"Dressler F, Meyer auf der Heide F, eds. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM; 2016. doi:10.1145/2942358","chicago":"Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016. https://doi.org/10.1145/2942358.","mla":"Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016, doi:10.1145/2942358.","bibtex":"@book{Dressler_Meyer auf der Heide_2016, title={Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)}, DOI={10.1145/2942358}, publisher={ACM}, year={2016} }","short":"F. Dressler, F. Meyer auf der Heide, eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), ACM, 2016.","ieee":"F. Dressler and F. Meyer auf der Heide, Eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016."},"year":"2016","type":"conference_editor","conference":{"end_date":"2016-07-08","start_date":"2016-07-04","name":"MobiHoc","location":"Paderborn, Germany"},"_id":"163","date_updated":"2022-01-06T06:52:48Z","doi":"10.1145/2942358"},{"user_id":"15415","abstract":[{"lang":"eng","text":"Defining, measuring, and comparing the quality and efficiency of rendering algorithms in computer graphics is a demanding challenge: quality measures are often application specific and efficiency is strongly influenced by properties of the rendered scene and the used hardware. We survey the currently employed evaluation methods for AQ1 the development process of rendering algorithms. Then, we present our PADrend framework, which supports systematic and flexible development, evaluation, adaptation, and comparison of rendering algorithms, and provides a comfortable and easy-to-use platform for developers of rendering algorithms. The system includes a new evaluation method to improve the objectivity of experimental evaluations of rendering algorithms.\r\n"}],"status":"public","date_created":"2020-03-30T10:21:53Z","volume":9220,"author":[{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Petring, Ralf","first_name":"Ralf","last_name":"Petring"}],"publisher":"Springer","publication":"Algorithm Engineering","_id":"16351","intvolume":" 9220","citation":{"bibtex":"@inproceedings{Fischer_Jähn_Meyer auf der Heide_Petring_2016, series={LNCS}, title={Algorithm Engineering Aspects of Real-Time Rendering Algorithms}, volume={9220}, DOI={10.1007/978-3-319-49487-6_7 }, booktitle={Algorithm Engineering}, publisher={Springer}, author={Fischer, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf}, editor={Kliemann, Lasse and Sanders, PeterEditors}, year={2016}, pages={226–244}, collection={LNCS} }","mla":"Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 .","ama":"Fischer M, Jähn C, Meyer auf der Heide F, Petring R. Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In: Kliemann L, Sanders P, eds. Algorithm Engineering. Vol 9220. LNCS. Springer; 2016:226-244. doi:10.1007/978-3-319-49487-6_7 ","apa":"Fischer, M., Jähn, C., Meyer auf der Heide, F., & Petring, R. (2016). Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann & P. Sanders (Eds.), Algorithm Engineering (Vol. 9220, pp. 226–244). Springer. https://doi.org/10.1007/978-3-319-49487-6_7 ","chicago":"Fischer, Matthias, Claudius Jähn, Friedhelm Meyer auf der Heide, and Ralf Petring. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” In Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, 9220:226–44. LNCS. Springer, 2016. https://doi.org/10.1007/978-3-319-49487-6_7 .","ieee":"M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering Aspects of Real-Time Rendering Algorithms,” in Algorithm Engineering, 2016, vol. 9220, pp. 226–244.","short":"M. Fischer, C. Jähn, F. Meyer auf der Heide, R. Petring, in: L. Kliemann, P. Sanders (Eds.), Algorithm Engineering, Springer, 2016, pp. 226–244."},"year":"2016","type":"conference","page":"226-244","title":"Algorithm Engineering Aspects of Real-Time Rendering Algorithms","editor":[{"full_name":"Kliemann, Lasse","first_name":"Lasse","last_name":"Kliemann"},{"last_name":"Sanders","full_name":"Sanders, Peter","first_name":"Peter"}],"department":[{"_id":"63"}],"doi":"10.1007/978-3-319-49487-6_7 ","date_updated":"2022-01-06T06:52:49Z","language":[{"iso":"eng"}],"series_title":"LNCS"},{"year":"2016","type":"conference","citation":{"mla":"Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016, doi:10.1007/978-3-319-53058-1_5 .","bibtex":"@inproceedings{Li_Meyer auf der Heide_Podlipyan_2016, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, DOI={10.1007/978-3-319-53058-1_5 }, booktitle={Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016} }","chicago":"Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” In Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer, 2016. https://doi.org/10.1007/978-3-319-53058-1_5 .","ama":"Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In: Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer; 2016. doi:10.1007/978-3-319-53058-1_5 ","apa":"Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2016). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer. https://doi.org/10.1007/978-3-319-53058-1_5 ","ieee":"S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” in Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), 2016.","short":"S. Li, F. Meyer auf der Heide, P. Podlipyan, in: Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:49Z","_id":"16358","doi":"10.1007/978-3-319-53058-1_5 ","department":[{"_id":"63"}],"publication":"Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)","publisher":"Springer","author":[{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Podlipyan","full_name":"Podlipyan, Pavel","first_name":"Pavel"}],"date_created":"2020-04-01T12:28:09Z","status":"public","title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","user_id":"15415"},{"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","department":[{"_id":"63"}],"publisher":"ACM","author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"last_name":"Jung","id":"37827","first_name":"Daniel","full_name":"Jung, Daniel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_created":"2020-04-01T12:46:35Z","status":"public","abstract":[{"lang":"eng","text":"In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2)."}],"title":"Asymptotically Optimal Gathering on a Grid","user_id":"15415","page":"301-312","year":"2016","type":"conference","citation":{"ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 301–312.","short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–312.","mla":"Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.","bibtex":"@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, DOI={10.1145/2935764.2935789}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={301–312} }","chicago":"Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 301–12. ACM, 2016. https://doi.org/10.1145/2935764.2935789.","apa":"Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 301–312). ACM. https://doi.org/10.1145/2935764.2935789","ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2016:301-312. doi:10.1145/2935764.2935789"},"language":[{"iso":"eng"}],"_id":"16359","date_updated":"2022-01-06T06:52:49Z","doi":"10.1145/2935764.2935789"},{"year":"2016","type":"conference","citation":{"ieee":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” in Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 2016, pp. 689–699.","short":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–699.","mla":"Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Gathering a Closed Chain of Robots on a Grid}, DOI={10.1109/IPDPS.2016.51}, booktitle={Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={689–699} }","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 689–99. IEEE, 2016. https://doi.org/10.1109/IPDPS.2016.51.","apa":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS) (pp. 689–699). IEEE. https://doi.org/10.1109/IPDPS.2016.51","ama":"Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. In: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2016:689-699. doi:10.1109/IPDPS.2016.51"},"page":"689-699","language":[{"iso":"eng"}],"_id":"16360","date_updated":"2022-01-06T06:52:49Z","doi":"10.1109/IPDPS.2016.51","author":[{"full_name":"Abshoff, Sebastian","first_name":"Sebastian","last_name":"Abshoff"},{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"full_name":"Jung, Daniel","first_name":"Daniel","id":"37827","last_name":"Jung"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publisher":"IEEE","publication":"Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-01T12:56:43Z","abstract":[{"text":"We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. ","lang":"eng"}],"title":"Gathering a Closed Chain of Robots on a Grid","user_id":"15415"},{"author":[{"last_name":"Macker","full_name":"Macker, Alexander","first_name":"Alexander"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"department":[{"_id":"63"}],"publication":"2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","publication_status":"published","publication_identifier":{"isbn":["9781509021406"]},"status":"public","date_created":"2020-04-02T10:14:25Z","title":"On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams","user_id":"15415","citation":{"chicago":"Macker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016. https://doi.org/10.1109/ipdps.2016.91.","ama":"Macker A, Malatyali M, Meyer auf der Heide F. On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2016. doi:10.1109/ipdps.2016.91","apa":"Macker, A., Malatyali, M., & Meyer auf der Heide, F. (2016). On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps.2016.91","mla":"Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91.","bibtex":"@inproceedings{Macker_Malatyali_Meyer auf der Heide_2016, title={On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams}, DOI={10.1109/ipdps.2016.91}, booktitle={2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2016} }","short":"A. Macker, M. Malatyali, F. Meyer auf der Heide, in: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016.","ieee":"A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams,” in 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016."},"type":"conference","year":"2016","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:49Z","_id":"16364","doi":"10.1109/ipdps.2016.91"},{"_id":"16396","date_updated":"2022-01-06T06:52:50Z","citation":{"short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, ArXiv:1609.01184 (2016).","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” arXiv:1609.01184. 2016.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. ArXiv:1609.01184.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. arXiv:160901184. 2016.","bibtex":"@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, journal={arXiv:1609.01184}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016} }","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016."},"type":"preprint","year":"2016","language":[{"iso":"eng"}],"title":"Cost-efficient Scheduling on Machines from the Cloud","user_id":"15415","external_id":{"arxiv":["1609.01184"]},"abstract":[{"lang":"eng","text":"We consider a scheduling problem where machines need to be rented from the\r\ncloud in order to process jobs. There are two types of machines available which\r\ncan be rented for machine-type dependent prices and for arbitrary durations.\r\nHowever, a machine-type dependent setup time is required before a machine is\r\navailable for processing. Jobs arrive online over time, have machine-type\r\ndependent sizes and have individual deadlines. The objective is to rent\r\nmachines and schedule jobs so as to meet all deadlines while minimizing the\r\nrental cost.\r\n Since we observe the slack of jobs to have a fundamental influence on the\r\ncompetitiveness, we study the model when instances are parameterized by their\r\n(minimum) slack. An instance is called to have a slack of $\\beta$ if, for all\r\njobs, the difference between the job's release time and the latest point in\r\ntime at which it needs to be started is at least $\\beta$. While for $\\beta < s$\r\nno finite competitiveness is possible, our main result is an\r\n$O(\\frac{c}{\\varepsilon} + \\frac{1}{\\varepsilon^3})$-competitive online\r\nalgorithm for $\\beta = (1+\\varepsilon)s$ with $\\frac{1}{s} \\leq \\varepsilon\r\n\\leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of\r\nthe machine-types, respectively. It is complemented by a lower bound of\r\n$\\Omega(\\frac{c}{\\varepsilon})$."}],"date_created":"2020-04-03T09:24:28Z","status":"public","publication":"arXiv:1609.01184","department":[{"_id":"63"}],"author":[{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}]},{"issue":"4","_id":"139","page":" 1197--1216","citation":{"bibtex":"@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards the price of leasing online}, DOI={10.1007/s10878-015-9915-5}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216} }","mla":"Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.","chicago":"Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, and Peter Pietrzyk. “Towards the Price of Leasing Online.” Journal of Combinatorial Optimization, no. 4 (2016): 1197--1216. https://doi.org/10.1007/s10878-015-9915-5.","ama":"Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards the price of leasing online. Journal of Combinatorial Optimization. 2016;(4):1197--1216. doi:10.1007/s10878-015-9915-5","apa":"Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk, P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization, (4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5","ieee":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” Journal of Combinatorial Optimization, no. 4, pp. 1197--1216, 2016.","short":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk, Journal of Combinatorial Optimization (2016) 1197--1216."},"year":"2016","type":"journal_article","ddc":["000"],"user_id":"477","abstract":[{"text":"We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2).","lang":"eng"}],"date_created":"2017-10-17T12:41:18Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-11-02T15:57:25Z","publication":"Journal of Combinatorial Optimization","publisher":"Springer","author":[{"last_name":"Abshoff","first_name":"Sebastian","full_name":"Abshoff, Sebastian"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Pietrzyk","full_name":"Pietrzyk, Peter ","first_name":"Peter "}],"file":[{"content_type":"application/pdf","date_updated":"2018-11-02T15:57:25Z","success":1,"relation":"main_file","file_size":654903,"creator":"ups","file_id":"5318","access_level":"closed","date_created":"2018-11-02T15:57:25Z","file_name":"Abshoff-TowardsThePriceOfLeasingOnline.pdf"}],"doi":"10.1007/s10878-015-9915-5","date_updated":"2022-01-06T06:51:46Z","language":[{"iso":"eng"}],"title":"Towards the price of leasing online","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"title":"The Monotone Circuit Value Problem with Bounded Genus Is in NC","language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-42634-1_8","date_updated":"2022-01-06T06:51:57Z","date_created":"2017-10-17T12:41:19Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-11-02T14:20:45Z","publication":"Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)","author":[{"last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N. ","first_name":"Faisal N. "},{"last_name":"Li","first_name":"Shouwei","full_name":"Li, Shouwei"},{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Podlipyan","full_name":"Podlipyan, Pavel","first_name":"Pavel"}],"file":[{"access_level":"closed","file_name":"TheMonotoneCircuitValueProblem.pdf","date_created":"2018-11-02T14:20:45Z","success":1,"relation":"main_file","date_updated":"2018-11-02T14:20:45Z","content_type":"application/pdf","creator":"ups","file_id":"5269","file_size":234587}],"ddc":["000"],"user_id":"477","abstract":[{"text":"We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].","lang":"eng"}],"page":"92-102","year":"2016","citation":{"bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is in NC}, DOI={10.1007/978-3-319-42634-1_8}, booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102}, collection={LNCS} }","mla":"Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.","chicago":"Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” In Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 92–102. LNCS, 2016. https://doi.org/10.1007/978-3-319-42634-1_8.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone Circuit Value Problem with Bounded Genus Is in NC. In: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON). LNCS. ; 2016:92-102. doi:10.1007/978-3-319-42634-1_8","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON) (pp. 92–102). https://doi.org/10.1007/978-3-319-42634-1_8","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102."},"type":"conference","_id":"143"},{"file":[{"content_type":"application/pdf","date_updated":"2018-03-21T12:57:57Z","relation":"main_file","success":1,"file_size":3121363,"file_id":"1556","creator":"florida","access_level":"closed","date_created":"2018-03-21T12:57:57Z","file_name":"145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf"}],"publisher":"Wiley Online Library","author":[{"first_name":"Matthias","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052"},{"full_name":"Graffi, Kalman","first_name":"Kalman","last_name":"Graffi"}],"file_date_updated":"2018-03-21T12:57:57Z","publication":"Concurrency and Computation: Practice and Experience","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:20Z","volume":28,"abstract":[{"lang":"eng","text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. "}],"user_id":"14052","ddc":["040"],"year":"2016","citation":{"ieee":"M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, pp. 1655–1677, 2016.","short":"M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience 28 (2016) 1655–1677.","mla":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.","bibtex":"@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}, volume={28}, DOI={10.1002/cpe.3716}, number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016}, pages={1655–1677} }","chicago":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience 28, no. 5 (2016): 1655–77. https://doi.org/10.1002/cpe.3716.","ama":"Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience. 2016;28(5):1655-1677. doi:10.1002/cpe.3716","apa":"Feldotto, M., & Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience, 28(5), 1655–1677. https://doi.org/10.1002/cpe.3716"},"type":"journal_article","page":"1655-1677","intvolume":" 28","_id":"145","issue":"5","department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publication_status":"published","title":"Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM","date_updated":"2022-01-06T06:52:00Z","doi":"10.1002/cpe.3716"},{"user_id":"14052","title":"Solving the aggregated bandits problem","date_created":"2017-10-17T12:41:41Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","department":[{"_id":"63"},{"_id":"541"}],"author":[{"full_name":"Pfannschmidt, Karlson","first_name":"Karlson","last_name":"Pfannschmidt"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:56:50Z","_id":"251","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"type":"mastersthesis","year":"2015","citation":{"ieee":"K. Pfannschmidt, Solving the aggregated bandits problem. Universität Paderborn, 2015.","short":"K. Pfannschmidt, Solving the Aggregated Bandits Problem, Universität Paderborn, 2015.","bibtex":"@book{Pfannschmidt_2015, title={Solving the aggregated bandits problem}, publisher={Universität Paderborn}, author={Pfannschmidt, Karlson}, year={2015} }","mla":"Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015.","apa":"Pfannschmidt, K. (2015). Solving the aggregated bandits problem. Universität Paderborn.","ama":"Pfannschmidt K. Solving the Aggregated Bandits Problem. Universität Paderborn; 2015.","chicago":"Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015."}},{"user_id":"15415","title":"On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking","author":[{"last_name":"Wahby","full_name":"Wahby, Mostafa","first_name":"Mostafa"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Applications of Evolutionary Computation (EvoApplications 2015)","status":"public","date_created":"2020-10-08T12:36:48Z","date_updated":"2022-01-06T06:54:17Z","_id":"19959","doi":"10.1007/978-3-319-16549-3_61","language":[{"iso":"eng"}],"type":"conference","year":"2015","citation":{"ieee":"M. Wahby and H. Hamann, “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking,” in Applications of Evolutionary Computation (EvoApplications 2015), 2015.","short":"M. Wahby, H. Hamann, in: Applications of Evolutionary Computation (EvoApplications 2015), 2015.","mla":"Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.” Applications of Evolutionary Computation (EvoApplications 2015), 2015, doi:10.1007/978-3-319-16549-3_61.","bibtex":"@inproceedings{Wahby_Hamann_2015, title={On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking}, DOI={10.1007/978-3-319-16549-3_61}, booktitle={Applications of Evolutionary Computation (EvoApplications 2015)}, author={Wahby, Mostafa and Hamann, Heiko}, year={2015} }","apa":"Wahby, M., & Hamann, H. (2015). On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking. In Applications of Evolutionary Computation (EvoApplications 2015). https://doi.org/10.1007/978-3-319-16549-3_61","ama":"Wahby M, Hamann H. On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking. In: Applications of Evolutionary Computation (EvoApplications 2015). ; 2015. doi:10.1007/978-3-319-16549-3_61","chicago":"Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.” In Applications of Evolutionary Computation (EvoApplications 2015), 2015. https://doi.org/10.1007/978-3-319-16549-3_61."}}]