--- _id: '97' abstract: - lang: eng text: Bridging the gap between informal, imprecise, and vague user requirements descriptions and precise formalized specifications is the main task of requirements engineering. Techniques such as interviews or story telling are used when requirements engineers try to identify a user's needs. The requirements specification process is typically done in a dialogue between users, domain experts, and requirements engineers. In our research, we aim at automating the specification of requirements. The idea is to distinguish between untrained users and trained users, and to exploit domain knowledge learned from previous runs of our system. We let untrained users provide unstructured natural language descriptions, while we allow trained users to provide examples of behavioral descriptions. In both cases, our goal is to synthesize formal requirements models similar to statecharts. From requirements specification processes with trained users, behavioral ontologies are learned which are later used to support the requirements specification process for untrained users. Our research method is original in combining natural language processing and search-based techniques for the synthesis of requirements specifications. Our work is embedded in a larger project that aims at automating the whole software development and deployment process in envisioned future software service markets. author: - first_name: Lorijn full_name: van Rooijen, Lorijn id: '58843' last_name: van Rooijen - first_name: Frederik Simon full_name: Bäumer, Frederik Simon id: '38837' last_name: Bäumer - first_name: Marie Christin full_name: Platenius, Marie Christin last_name: Platenius - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'van Rooijen L, Bäumer FS, Platenius MC, Geierhos M, Hamann H, Engels G. From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW). Piscataway, NJ, USA: IEEE; 2017:379-385. doi:10.1109/REW.2017.26' apa: 'van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H., & Engels, G. (2017). From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW) (pp. 379–385). Piscataway, NJ, USA: IEEE. https://doi.org/10.1109/REW.2017.26' bibtex: '@inproceedings{van Rooijen_Bäumer_Platenius_Geierhos_Hamann_Engels_2017, place={Piscataway, NJ, USA}, title={From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}, DOI={10.1109/REW.2017.26}, booktitle={2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)}, publisher={IEEE}, author={van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017}, pages={379–385} }' chicago: 'Rooijen, Lorijn van, Frederik Simon Bäumer, Marie Christin Platenius, Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” In 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), 379–85. Piscataway, NJ, USA: IEEE, 2017. https://doi.org/10.1109/REW.2017.26.' ieee: 'L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” in 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), Lisbon, Portugal, 2017, pp. 379–385.' mla: 'van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, 2017, pp. 379–85, doi:10.1109/REW.2017.26.' short: 'L. van Rooijen, F.S. Bäumer, M.C. Platenius, M. Geierhos, H. Hamann, G. Engels, in: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, Piscataway, NJ, USA, 2017, pp. 379–385.' conference: end_date: 2017-09-08 location: Lisbon, Portugal name: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW) start_date: 2017-09-04 date_created: 2017-10-17T12:41:10Z date_updated: 2022-01-06T07:04:18Z ddc: - '000' department: - _id: '36' - _id: '1' - _id: '579' - _id: '34' - _id: '7' - _id: '66' - _id: '238' - _id: '63' doi: 10.1109/REW.2017.26 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:50:35Z date_updated: 2018-11-02T14:50:35Z file_id: '5285' file_name: 08054881.pdf file_size: 433613 relation: main_file success: 1 file_date_updated: 2018-11-02T14:50:35Z has_accepted_license: '1' keyword: - Software - Unified modeling language - Requirements engineering - Ontologies - Search problems - Natural languages language: - iso: eng page: 379-385 place: Piscataway, NJ, USA project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publication: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW) publication_identifier: eisbn: - '978-1-5386-3488-2 ' isbn: - 978-1-5386-3489-9 publication_status: published publisher: IEEE quality_controlled: '1' status: public title: 'From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process' type: conference user_id: '57458' year: '2017' ... --- _id: '55' abstract: - lang: eng text: We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this are embedded systems in autonomous cars that communicate in order to coordinate their actions. Our model is a variant of the classical Page Migration Problem. Moreformally, we consider a mobile server holding a data page.The server can move in the Euclidean space (of arbitrary dimension). In every round, requests for data items from the page pop up at arbitrary points in the space. The requests are served, each at a cost of the distance from the requesting point and the server, and the mobile server may move, at a cost D times the distance traveled for some constant D . We assume a maximum distance m the server is allowed to move per round. We show that no online algorithm can achieve a competitive ratio independent of the length of the input sequence in this setting. Hence we augment the maximum movement distance of the online algorithms to ( 1 + δ) times the maximum distance of the offline solution. We provide a deterministic algorithm which is simple to describe and works for multiple variants of our problem. The algorithm achieves almost tight competitive ratios independent of the length of the input sequence. author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2017:313-319. doi:10.1145/3087556.3087575' apa: Feldkord, B., & Meyer auf der Heide, F. (2017). The Mobile Server Problem. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 313–319). https://doi.org/10.1145/3087556.3087575 bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server Problem}, DOI={10.1145/3087556.3087575}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2017}, pages={313–319} }' chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 313–19, 2017. https://doi.org/10.1145/3087556.3087575. ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319. mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575. short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.' date_created: 2017-10-17T12:41:02Z date_updated: 2022-01-06T07:01:56Z ddc: - '000' department: - _id: '63' doi: 10.1145/3087556.3087575 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:55:10Z date_updated: 2018-11-02T14:55:10Z file_id: '5288' file_name: p313-feldkord.pdf file_size: 691691 relation: main_file success: 1 file_date_updated: 2018-11-02T14:55:10Z has_accepted_license: '1' language: - iso: eng page: 313-319 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: The Mobile Server Problem type: conference user_id: '477' year: '2017' ... --- _id: '66' abstract: - lang: eng text: In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player. author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted Budget Games. In: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON). LNCS. ; 2017:175--187. doi:10.1007/978-3-319-62389-4_15' apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) (pp. 175--187). https://doi.org/10.1007/978-3-319-62389-4_15 bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure Nash Equilibria in Restricted Budget Games}, DOI={10.1007/978-3-319-62389-4_15}, booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }' chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 175--187. LNCS, 2017. https://doi.org/10.1007/978-3-319-62389-4_15. ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187. mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15. short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.' date_created: 2017-10-17T12:41:04Z date_updated: 2022-01-06T07:03:13Z ddc: - '000' department: - _id: '541' - _id: '63' doi: 10.1007/978-3-319-62389-4_15 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T16:58:42Z date_updated: 2018-10-31T16:58:42Z file_id: '5228' file_name: Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf file_size: 346390 relation: main_file success: 1 file_date_updated: 2018-10-31T16:58:42Z has_accepted_license: '1' language: - iso: eng page: 175--187 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '16' name: SFB 901 - Subproject C4 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) series_title: LNCS status: public title: Pure Nash Equilibria in Restricted Budget Games type: conference user_id: '14052' year: '2017' ... --- _id: '695' author: - first_name: Joshua full_name: Nowack, Joshua last_name: Nowack citation: ama: Nowack J. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn; 2017. apa: Nowack, J. (2017). On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn. bibtex: '@book{Nowack_2017, title={On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen}, publisher={Universität Paderborn}, author={Nowack, Joshua}, year={2017} }' chicago: Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017. ieee: J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017. mla: Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017. short: J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen, Universität Paderborn, 2017. date_created: 2017-11-14T06:57:49Z date_updated: 2022-01-06T07:03:23Z department: - _id: '63' language: - iso: ger publisher: Universität Paderborn status: public title: On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen type: bachelorsthesis user_id: '14052' year: '2017' ... --- _id: '16444' author: - first_name: Jürgen full_name: Gausemeier, Jürgen last_name: Gausemeier - first_name: Eric full_name: Bodden, Eric last_name: Bodden - first_name: Falko full_name: ' Dressler, Falko' last_name: ' Dressler' - first_name: Roman full_name: Dumitrescu, Roman last_name: Dumitrescu - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christoph full_name: Scheytt, Christoph last_name: Scheytt - first_name: Ansgar full_name: Trächtler, Ansgar last_name: Trächtler citation: ama: Gausemeier J, Bodden E, Dressler F, et al. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn; 2017. apa: Gausemeier, J., Bodden, E., Dressler, F., Dumitrescu, R., Meyer auf der Heide, F., Scheytt, C., & Trächtler, A. (2017). Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn. bibtex: '@book{Gausemeier_Bodden_ Dressler_Dumitrescu_Meyer auf der Heide_Scheytt_Trächtler_2017, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)}, author={Gausemeier, Jürgen and Bodden, Eric and Dressler, Falko and Dumitrescu, Roman and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler, Ansgar}, year={2017}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}} }' chicago: Gausemeier, Jürgen, Eric Bodden, Falko Dressler, Roman Dumitrescu, Friedhelm Meyer auf der Heide, Christoph Scheytt, and Ansgar Trächtler. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn}. Paderborn, 2017. ieee: J. Gausemeier et al., Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn, 2017. mla: Gausemeier, Jürgen, et al. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). 2017. short: J. Gausemeier, E. Bodden, F. Dressler, R. Dumitrescu, F. Meyer auf der Heide, C. Scheytt, A. Trächtler, Wissenschaftsforum Intelligente Technische Systeme (WInTeSys), Paderborn, 2017. date_created: 2020-04-07T06:36:06Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' language: - iso: eng page: '369' place: Paderborn publication_status: published series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} status: public title: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) type: book user_id: '15415' year: '2017' ... --- _id: '16461' author: - first_name: Pascal full_name: Bemmann, Pascal last_name: Bemmann - first_name: Felix full_name: Biermeier, Felix last_name: Biermeier - first_name: Jan full_name: Bürmann, Jan last_name: Bürmann - first_name: Arne full_name: Kemper, Arne last_name: Kemper - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Steffen full_name: Knorr, Steffen last_name: Knorr - first_name: Nils full_name: Kothe, Nils last_name: Kothe - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel id: '41265' last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Johannes Sebastian full_name: Schaefer, Johannes Sebastian id: '30291' last_name: Schaefer - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier citation: ama: 'Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems in Distributed Data Streams. In: Structural Information and Communication Complexity. ; 2017. doi:10.1007/978-3-319-72050-0_13' apa: Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J. S., & Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In Structural Information and Communication Complexity. https://doi.org/10.1007/978-3-319-72050-0_13 bibtex: '@inbook{Bemmann_Biermeier_Bürmann_Kemper_Knollmann_Knorr_Kothe_Mäcker_Malatyali_Meyer auf der Heide_et al._2017, place={Cham}, title={Monitoring of Domain-Related Problems in Distributed Data Streams}, DOI={10.1007/978-3-319-72050-0_13}, booktitle={Structural Information and Communication Complexity}, author={Bemmann, Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and et al.}, year={2017} }' chicago: Bemmann, Pascal, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” In Structural Information and Communication Complexity. Cham, 2017. https://doi.org/10.1007/978-3-319-72050-0_13. ieee: P. Bemmann et al., “Monitoring of Domain-Related Problems in Distributed Data Streams,” in Structural Information and Communication Complexity, Cham, 2017. mla: Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” Structural Information and Communication Complexity, 2017, doi:10.1007/978-3-319-72050-0_13. short: 'P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.' date_created: 2020-04-08T07:20:20Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-3-319-72050-0_13 external_id: arxiv: - 'arXiv:1706.03568 ' language: - iso: eng place: Cham publication: Structural Information and Communication Complexity publication_identifier: isbn: - '9783319720494' - '9783319720500' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Monitoring of Domain-Related Problems in Distributed Data Streams type: book_chapter user_id: '15415' year: '2017' ... --- _id: '1073' author: - first_name: Simon full_name: Nachtigall, Simon last_name: Nachtigall citation: ama: Nachtigall S. Sortieren dynamischer Daten. Universität Paderborn; 2017. apa: Nachtigall, S. (2017). Sortieren dynamischer Daten. Universität Paderborn. bibtex: '@book{Nachtigall_2017, title={Sortieren dynamischer Daten}, publisher={Universität Paderborn}, author={Nachtigall, Simon}, year={2017} }' chicago: Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017. ieee: S. Nachtigall, Sortieren dynamischer Daten. Universität Paderborn, 2017. mla: Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017. short: S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017. date_created: 2017-12-19T09:59:32Z date_updated: 2022-01-06T06:50:50Z department: - _id: '63' - _id: '541' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Sortieren dynamischer Daten type: bachelorsthesis user_id: '14052' year: '2017' ... --- _id: '1074' author: - first_name: Simon full_name: Pukrop, Simon last_name: Pukrop citation: ama: Pukrop S. Robuste Optimierung in Congestion Games. Universität Paderborn; 2017. apa: Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität Paderborn. bibtex: '@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2017} }' chicago: Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017. ieee: S. Pukrop, Robuste Optimierung in Congestion Games. Universität Paderborn, 2017. mla: Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017. short: S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn, 2017. date_created: 2017-12-19T10:00:25Z date_updated: 2022-01-06T06:50:50Z department: - _id: '63' - _id: '541' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Robuste Optimierung in Congestion Games type: bachelorsthesis user_id: '14052' year: '2017' ... --- _id: '1080' author: - first_name: Jan full_name: Bürmann, Jan last_name: Bürmann citation: ama: Bürmann J. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn; 2017. apa: Bürmann, J. (2017). Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn. bibtex: '@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={2017} }' chicago: Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017. ieee: J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017. mla: Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017. short: J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty, Universität Paderborn, 2017. date_created: 2017-12-19T10:07:35Z date_updated: 2022-01-06T06:50:50Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Complexity of Signalling in Routing Games under Uncertainty type: mastersthesis user_id: '14052' year: '2017' ... --- _id: '1081' author: - first_name: Vipin Ravindran full_name: Vijayalakshmi, Vipin Ravindran last_name: Vijayalakshmi citation: ama: Vijayalakshmi VR. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn; 2017. apa: Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn. bibtex: '@book{Vijayalakshmi_2017, title={Bounding the Inefficiency of Equilibria in Congestion Games under Taxation}, publisher={Universität Paderborn}, author={Vijayalakshmi, Vipin Ravindran}, year={2017} }' chicago: Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017. ieee: V. R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017. mla: Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017. short: V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation, Universität Paderborn, 2017. date_created: 2017-12-19T10:08:44Z date_updated: 2022-01-06T06:50:51Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Bounding the Inefficiency of Equilibria in Congestion Games under Taxation type: mastersthesis user_id: '14052' year: '2017' ... --- _id: '1094' 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. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Thomas full_name: John, Thomas id: '3952' last_name: John - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Paul full_name: Hemsen, Paul id: '22546' last_name: Hemsen - first_name: Katrin full_name: Klingsieck, Katrin last_name: Klingsieck - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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' 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} }' 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.' 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.' 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.' 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.' date_created: 2018-01-05T08:37:52Z date_updated: 2022-01-06T06:50:53Z ddc: - '000' department: - _id: '63' - _id: '541' - _id: '276' doi: 10.1007/978-3-319-59144-5_32 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:01:09Z date_updated: 2018-10-31T17:01:09Z file_id: '5230' file_name: Feldotto2017_Chapter_MakingGamificationEasyForThePr.pdf file_size: 1576363 relation: main_file success: 1 file_date_updated: 2018-10-31T17:01:09Z has_accepted_license: '1' language: - iso: eng page: 462-467 publication: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST) series_title: LNCS status: public title: 'Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App' type: conference user_id: '14052' year: '2017' ... --- _id: '1095' 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. ' author: - first_name: Thomas full_name: John, Thomas id: '3952' last_name: John - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Paul full_name: Hemsen, Paul id: '22546' last_name: Hemsen - first_name: Katrin full_name: Klingsieck, Katrin last_name: Klingsieck - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Mike full_name: Langendorf, Mike last_name: Langendorf citation: 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.' 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). 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} }' 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. 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. 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. 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.' date_created: 2018-01-05T08:39:41Z date_updated: 2022-01-06T06:50:53Z ddc: - '000' department: - _id: '63' - _id: '541' - _id: '178' - _id: '185' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:02:07Z date_updated: 2018-10-31T17:02:07Z file_id: '5232' file_name: TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf file_size: 485333 relation: main_file success: 1 file_date_updated: 2018-10-31T17:02:07Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://aisel.aisnet.org/ecis2017_rip/46 oa: '1' page: 2970-2979 publication: Proceedings of the 25th European Conference on Information Systems (ECIS) status: public title: Towards a Lean Approach for Gamifying Education type: conference user_id: '14052' year: '2017' ... --- _id: '110' abstract: - lang: eng 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.' author: - first_name: Antonios full_name: Antoniadis, Antonios last_name: Antoniadis - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Sebastian full_name: Ott, Sebastian last_name: Ott - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: 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' 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} }' 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.' 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.' short: A. Antoniadis, P. Kling, S. Ott, S. Riechers, Theoretical Computer Science (2017) 1–13. date_created: 2017-10-17T12:41:13Z date_updated: 2022-01-06T06:50:55Z ddc: - '040' department: - _id: '63' doi: 10.1016/j.tcs.2017.03.021 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:07:43Z date_updated: 2018-03-21T13:07:43Z file_id: '1567' file_name: 110-TCSSubmission.pdf file_size: 494600 relation: main_file success: 1 file_date_updated: 2018-03-21T13:07:43Z has_accepted_license: '1' language: - iso: eng page: 1-13 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Theoretical Computer Science publisher: Elsevier status: public title: 'Continuous Speed Scaling with Variability: A Simple and Direct Approach' type: journal_article user_id: '477' year: '2017' ... --- _id: '16338' 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. author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: https://orcid.org/0000-0003-3546-203X - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - 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 citation: 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' 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} }' 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.' 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.' 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.' 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.' conference: end_date: 2017-08-09 location: Cleveland, USA name: 37th Computers and Information in Engineering Conference start_date: 2017-08-06 date_created: 2020-03-24T08:36:05Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1115/detc2017-67528 intvolume: ' 1' language: - iso: eng page: 91:1-91:10 publication: 'Volume 1: 37th Computers and Information in Engineering Conference' publication_identifier: isbn: - '9780791858110' publication_status: published status: public title: Automatic Derivation of Geometric Properties of Components From 3D Polygon Models type: conference user_id: '15415' volume: 1 year: '2017' ... --- _id: '16339' 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. author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: https://orcid.org/0000-0003-3546-203X - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: 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.' 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.' 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} }' 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.' 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. 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. short: 'S. Brandt, M. Fischer, in: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Paderborn, 2017, pp. 415–427.' conference: end_date: 2017-05-12 location: Paderborn name: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 start_date: 2017-05-11 date_created: 2020-03-24T08:44:25Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' intvolume: ' 369' language: - iso: ger page: 415-427 place: Paderborn publication: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 publication_status: published publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell type: conference user_id: '11648' volume: 369 year: '2017' ... --- _id: '16347' author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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' 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.' 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. 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. 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.' date_created: 2020-03-27T14:32:39Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1007/978-3-319-72751-6_13 editor: - first_name: Antonio full_name: Fernández Anta, Antonio last_name: Fernández Anta - first_name: Tomasz full_name: Jurdzinski, Tomasz last_name: Jurdzinski - first_name: Miguel A. full_name: Mosteiro, Miguel A. last_name: Mosteiro - first_name: Yanyong full_name: Zhang, Yanyong last_name: Zhang intvolume: ' 10718' language: - iso: eng page: 168-181 place: Vienna, Austria publication: Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Gathering Anonymous, Oblivious Robots on a Grid type: conference user_id: '15415' volume: 10718 year: '2017' ... --- _id: '16348' author: - first_name: Felix full_name: Biermeier, Felix last_name: Biermeier - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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 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} }' 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. 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. 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.' date_created: 2020-03-30T09:25:18Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1007/978-3-319-89441-6_21 language: - iso: eng page: 285 - 300 publication: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) publisher: Springer status: public title: A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries type: conference user_id: '15415' year: '2017' ... --- _id: '16349' author: - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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 ' 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 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} }' 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 . 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. 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 . 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.' date_created: 2020-03-30T09:43:05Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: '10.1007/978-3-319-72751-6_14 ' language: - iso: eng page: 182-197 publication: Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) status: public title: A Continuous Strategy for Collisionless Gathering type: conference user_id: '15415' year: '2017' ... --- _id: '19961' abstract: - lang: eng 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. author: - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Daniel Nicolas full_name: Hofstadler, Daniel Nicolas last_name: Hofstadler - first_name: Mary Katherine full_name: Heinrich, Mary Katherine last_name: Heinrich - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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' 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' 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} }' 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.' 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.' 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.' date_created: 2020-10-08T12:57:13Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1109/saso.2016.8 language: - iso: eng publication: Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems publication_identifier: isbn: - '9781509035342' publication_status: published status: public title: 'An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap' type: conference user_id: '15415' year: '2016' ... --- _id: '19968' author: - first_name: Mary Katherine full_name: Heinrich, Mary Katherine last_name: Heinrich - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati - first_name: Daniel Nicolas full_name: Hofstadler, Daniel Nicolas last_name: Hofstadler - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat - first_name: Phil full_name: Ayres, Phil last_name: Ayres - first_name: Kasper full_name: Stoy, Kasper last_name: Stoy - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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' 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' 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} }' 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.' 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.' 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.' 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.' date_created: 2020-10-09T13:57:21Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1109/fas-w.2016.43 language: - iso: eng publication: Proc. of the 1st International Workshop on Self-Organising Construction (SOCO) publication_identifier: isbn: - '9781509036516' publication_status: published status: public title: 'Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures' type: conference user_id: '15415' year: '2016' ... --- _id: '19969' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Yara full_name: Khaluf, Yara last_name: Khaluf - first_name: Jean full_name: Botev, Jean last_name: Botev - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati - first_name: Eliseo full_name: Ferrante, Eliseo last_name: Ferrante - first_name: Oliver full_name: Kosak, Oliver last_name: Kosak - first_name: Jean-Marc full_name: Montanier, Jean-Marc last_name: Montanier - first_name: Sanaz full_name: Mostaghim, Sanaz last_name: Mostaghim - first_name: Richard full_name: Redpath, Richard last_name: Redpath - first_name: Jon full_name: Timmis, Jon last_name: Timmis - first_name: Frank full_name: Veenstra, Frank last_name: Veenstra - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Aleš full_name: Zamuda, Aleš last_name: Zamuda citation: 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} }' 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.' 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.' 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.' 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). date_created: 2020-10-09T14:04:05Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.3389/frobt.2016.00014 language: - iso: eng publication: Frontiers in Robotics and AI publication_identifier: issn: - 2296-9144 publication_status: published status: public title: 'Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems' type: journal_article user_id: '15415' year: '2016' ... --- _id: '19979' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati citation: 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} }' 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.' 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.' 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.' short: 'H. Hamann, M. Divband Soorati, in: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016.' date_created: 2020-10-12T13:06:07Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1109/IROS.2016.7759845 language: - iso: eng publication: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016) status: public title: 'Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures' type: conference user_id: '15415' year: '2016' ... --- _id: '19983' author: - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini - first_name: Eliseo full_name: Ferrante, Eliseo last_name: Ferrante citation: 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' 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.' 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.' 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.' short: M. Dorigo, H. Hamann, G. Valentini, E. Ferrante, Journal of Autonomous Agents and Multi-Agent Systems 30 (2016) 553–580. date_created: 2020-10-13T08:33:37Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1007/s10458-015-9323-3 intvolume: ' 30' issue: '3' language: - iso: eng page: 553-580 publication: Journal of Autonomous Agents and Multi-Agent Systems status: public title: 'Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems' type: journal_article user_id: '15415' volume: 30 year: '2016' ... --- _id: '200' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees citation: 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. bibtex: '@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian}, year={2016} }' chicago: Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016. ieee: M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016. mla: Drees, Maximilian. 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. date_created: 2017-10-17T12:41:31Z date_updated: 2022-01-06T06:54:18Z ddc: - '040' department: - _id: '63' - _id: '541' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:45:57Z date_updated: 2018-03-21T10:45:57Z file_id: '1525' file_name: 200-thesis.pdf file_size: 880390 relation: main_file success: 1 file_date_updated: 2018-03-21T10:45:57Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn related_material: link: - relation: confirmation url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915 status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Existence and Properties of Pure Nash Equilibria in Budget Games type: dissertation user_id: '15415' year: '2016' ... --- _id: '20000' 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 citation: 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' 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} }' 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.' 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.' 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.' short: 'H. Hamann, G. Valentini, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence, ANTS 2016, Cham, 2016.' date_created: 2020-10-15T09:55:35Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-44427-7_15 language: - iso: eng place: Cham publication: 10th Int. Conf. on Swarm Intelligence, ANTS 2016 publication_identifier: isbn: - '9783319444260' - '9783319444277' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Population Coding: A New Design Paradigm for Embodied Distributed Systems' type: conference user_id: '15415' year: '2016' ... --- _id: '20001' author: - first_name: Sebastian full_name: von Mammen, Sebastian last_name: von Mammen - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Michael full_name: Heider, Michael last_name: Heider citation: 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' 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' 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} }' 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.' 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.' 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.' short: 'S. von Mammen, H. Hamann, M. Heider, in: ACM Symposium on Virtual Reality Software and Technology (VRST), 2016.' date_created: 2020-10-15T10:00:23Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' doi: 10.1145/2993369.2993400 language: - iso: eng publication: ACM Symposium on Virtual Reality Software and Technology (VRST) publication_identifier: isbn: - '9781450344913' publication_status: published status: public title: 'Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems' type: conference user_id: '15415' year: '2016' ... --- _id: '20002' author: - first_name: Milan full_name: Rybář, Milan last_name: Rybář - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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' 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} }' 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.' 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.' short: 'M. Rybář, H. Hamann, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016.' date_created: 2020-10-15T10:05:11Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' doi: 10.1145/2908812.2908815 language: - iso: eng publication: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016) publication_identifier: isbn: - '9781450342063' publication_status: published status: public title: 'Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes' type: conference user_id: '15415' year: '2016' ... --- _id: '20003' author: - first_name: Yara full_name: Khaluf, Yara last_name: Khaluf - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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).' 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} }' 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.' 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.' 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.' short: 'Y. Khaluf, H. Hamann, in: ANTS 2016, 2016, p. 298.' date_created: 2020-10-15T10:16:39Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' intvolume: ' 9882' language: - iso: eng page: '298' publication: ANTS 2016 status: public title: 'On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations' type: conference user_id: '15415' volume: 9882 year: '2016' ... --- _id: '20004' author: - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini - first_name: Davide full_name: Brambilla, Davide last_name: Brambilla - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo citation: 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' 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 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} }' 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. 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. 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. short: 'G. Valentini, D. Brambilla, H. Hamann, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016.' date_created: 2020-10-15T10:22:20Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-44427-7_6 language: - iso: eng publication: 10th Int. Conf. on Swarm Intelligence, ANTS 2016 publication_identifier: isbn: - '9783319444260' - '9783319444277' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Collective Perception of Environmental Features in a Robot Swarm type: conference user_id: '15415' year: '2016' ... --- _id: '210' author: - first_name: Lennart full_name: Leder, Lennart last_name: Leder citation: ama: Leder L. Congestion Games with Mixed Objectives. Universität Paderborn; 2016. apa: Leder, L. (2016). Congestion Games with Mixed Objectives. Universität Paderborn. 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. ieee: L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn, 2016. mla: Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016. short: L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:33Z date_updated: 2022-01-06T06:54:42Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Congestion Games with Mixed Objectives type: mastersthesis user_id: '14052' year: '2016' ... --- _id: '215' abstract: - lang: eng 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.' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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' 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 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} }' 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. 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. 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. 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.' date_created: 2017-10-17T12:41:33Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1145/2935764.2935783 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:41:40Z date_updated: 2018-03-21T10:41:40Z file_id: '1518' file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf file_size: 352996 relation: main_file success: 1 file_date_updated: 2018-03-21T10:41:40Z has_accepted_license: '1' language: - iso: eng page: 417--427 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration type: conference user_id: '14955' year: '2016' ... --- _id: '17655' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: M.M. full_name: de Weerdt, M.M. last_name: de Weerdt - first_name: C.M. full_name: Jonker, C.M. last_name: Jonker citation: 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' 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' 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} }' 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.' 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.' 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.' short: 'G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, pp. 417–425.' date_created: 2020-08-06T15:20:30Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: 10.3233/978-1-61499-672-9-417 extern: '1' keyword: - agents - action - repeated reciprocation - fixed - floating - network - Nash equilibrium - social welfare - price of anarchy - price of stability - convex combination language: - iso: eng page: 417-425 publication: Proceedings of the 2016 European Conference on Artificial Intelligence series_title: Frontiers in Artificial Intelligence and Applications status: public title: The Game of Reciprocation Habits type: conference user_id: '83983' volume: 'Volume 285: ECAI 2016' year: '2016' ... --- _id: '17656' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Mathijs full_name: de Weerdt, Mathijs last_name: de Weerdt - first_name: Catholijn full_name: Jonker, Catholijn last_name: Jonker citation: 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.' 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.' 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} }' 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.' 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. 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.' date_created: 2020-08-06T15:20:45Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - agent's influence - behavior - convergence - perron-frobenius - reciprocal interaction - repeated reciprocation language: - iso: eng page: 1431-1432 place: Richland, SC publication: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems publication_identifier: isbn: - 978-1-4503-4239-1 publisher: International Foundation for Autonomous Agents and Multiagent Systems series_title: AAMAS '16 status: public title: The Convergence of Reciprocation type: conference user_id: '83983' year: '2016' ... --- _id: '177' 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.' author: - first_name: Faisal N. full_name: Abu-Khzam, Faisal N. last_name: Abu-Khzam - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: 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} }' 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. 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. 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.' date_created: 2017-10-17T12:41:26Z date_updated: 2022-01-06T06:53:17Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-48749-6_35 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:15:18Z date_updated: 2018-11-02T14:15:18Z file_id: '5266' file_name: OnTheParameterizedParallelComp.pdf file_size: 293345 relation: main_file success: 1 file_date_updated: 2018-11-02T14:15:18Z has_accepted_license: '1' language: - iso: eng page: 477-488 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: On the Parameterized Parallel Complexity and the Vertex Cover Problem type: conference user_id: '477' year: '2016' ... --- _id: '187' citation: 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 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} }' 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. 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. short: F. Meyer auf der Heide, ed., Introduction to the Special Issue on SPAA 2014, 2016. date_created: 2017-10-17T12:41:28Z date_updated: 2022-01-06T06:53:51Z ddc: - '040' department: - _id: '63' doi: 10.1145/2936716 editor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:31:42Z date_updated: 2018-03-21T12:31:42Z file_id: '1531' file_name: 187-a1-heide.pdf file_size: 34053 relation: main_file success: 1 file_date_updated: 2018-03-21T12:31:42Z has_accepted_license: '1' issue: '1' page: '1' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Transactions on Parallel Computing (TOPC) status: public title: Introduction to the Special Issue on SPAA 2014 type: journal_editor user_id: '15504' year: '2016' ... --- _id: '207' 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} author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: 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' 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 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} }' 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. 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. 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. 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.' date_created: 2017-10-17T12:41:32Z date_updated: 2022-01-06T06:54:33Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-48749-6_42 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:18:51Z date_updated: 2018-11-02T14:18:51Z file_id: '5268' file_name: Cost-EfficientSchedulingOnMach.pdf file_size: 608614 relation: main_file success: 1 file_date_updated: 2018-11-02T14:18:51Z has_accepted_license: '1' language: - iso: eng page: 578--592 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) status: public title: Cost-efficient Scheduling on Machines from the Cloud type: conference user_id: '477' year: '2016' ... --- _id: '209' abstract: - lang: eng 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. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Lennart full_name: Leder, Lennart last_name: Leder - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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' 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 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} }' 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. 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. 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. 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.' date_created: 2017-10-17T12:41:32Z date_updated: 2022-01-06T06:54:41Z ddc: - '000' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-48749-6_47 external_id: arxiv: - '1607.05143' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:03:44Z date_updated: 2018-10-31T17:03:44Z file_id: '5233' file_name: Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf file_size: 235739 relation: main_file success: 1 file_date_updated: 2018-10-31T17:03:44Z has_accepted_license: '1' language: - iso: eng page: 655--669 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: Congestion Games with Mixed Objectives type: conference user_id: '14052' year: '2016' ... --- _id: '5406' author: - first_name: Jonas full_name: Bülling, Jonas last_name: Bülling citation: 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. 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} }' chicago: Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016. ieee: J. Bülling, Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden. 2016. mla: Bülling, Jonas. 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. date_created: 2018-11-07T09:26:42Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng status: public title: Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden type: bachelorsthesis user_id: '22704' year: '2016' ... --- _id: '5407' author: - first_name: Jörn full_name: Koepe, Jörn last_name: Koepe citation: 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} }' chicago: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016. ieee: J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016. mla: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016. short: J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016. date_created: 2018-11-07T09:45:57Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public title: Price-Based Allocation Games type: bachelorsthesis user_id: '477' year: '2016' ... --- _id: '688' author: - first_name: Damian full_name: Kutzias, Damian last_name: Kutzias citation: 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} }' chicago: Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016. ieee: D. Kutzias, Friendship Processes in Network Creation Games. Universität Paderborn, 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. date_created: 2017-11-14T06:50:35Z date_updated: 2022-01-06T07:03:23Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Friendship Processes in Network Creation Games type: mastersthesis user_id: '477' year: '2016' ... --- _id: '689' author: - first_name: Johannes Sebastian full_name: Schaefer, Johannes Sebastian id: '30291' last_name: Schaefer 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. bibtex: '@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }' chicago: Schaefer, Johannes Sebastian. 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. mla: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. short: J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016. date_created: 2017-11-14T06:51:37Z date_updated: 2022-01-06T07:03:23Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Routing Algorithms on Delayed Networks for Disaster Management Support type: mastersthesis user_id: '477' year: '2016' ... --- _id: '16450' abstract: - lang: eng 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)$." author: - first_name: 'Andreas ' full_name: 'Cord-Landwehr, Andreas ' last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. arXiv:160203303. 2016. apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303. 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. ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” arXiv:1602.03303. 2016. mla: Cord-Landwehr, Andreas, et al. “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). date_created: 2020-04-07T07:20:47Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' external_id: arxiv: - '1602.03303' language: - iso: eng publication: arXiv:1602.03303 status: public title: Asymptotically Optimal Gathering on a Grid type: preprint user_id: '15415' year: '2016' ... --- _id: '169' abstract: - lang: eng 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. author: - first_name: Thomas full_name: Kühne, Thomas id: '49079' last_name: Kühne - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Svetlana full_name: Arifulina, Svetlana last_name: Arifulina - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: 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' 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' 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} }' 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.' 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.' 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.' date_created: 2017-10-17T12:41:25Z date_updated: 2022-01-06T06:52:58Z ddc: - '040' department: - _id: '66' - _id: '238' - _id: '63' doi: 10.1007/978-3-319-30668-1_18 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:41:08Z date_updated: 2018-03-21T12:41:08Z file_id: '1540' file_name: 169-kuehne.pdf file_size: 2069427 relation: main_file success: 1 file_date_updated: 2018-03-21T12:41:08Z has_accepted_license: '1' language: - iso: eng page: 278--293 project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) series_title: LNCS 9594 status: public title: 'Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application' type: conference user_id: '57458' year: '2016' ... --- _id: '1082' author: - first_name: Tobias full_name: Handirk, Tobias last_name: Handirk citation: ama: Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn; 2016. apa: Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn. bibtex: '@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken}, publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }' chicago: Handirk, Tobias. Ü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. mla: Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016. short: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität Paderborn, 2016. date_created: 2017-12-19T10:10:17Z date_updated: 2022-01-06T06:50:51Z department: - _id: '63' - _id: '541' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subproject A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Über die Rolle von Informationen in Verkehrsnetzwerken type: bachelorsthesis user_id: '14052' year: '2016' ... --- _id: '154' author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr citation: ama: Cord-Landwehr A. Selfish Network Creation - On Variants of Network Creation Games. Vol 353. 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. 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. ieee: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016. mla: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. 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. date_created: 2017-10-17T12:41:22Z date_updated: 2022-01-06T06:52:23Z ddc: - '040' department: - _id: '63' - _id: '26' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:52:03Z date_updated: 2018-03-21T12:52:03Z file_id: '1551' file_name: 154-dissertation.pdf file_size: 800101 relation: main_file success: 1 file_date_updated: 2018-03-21T12:52:03Z has_accepted_license: '1' intvolume: ' 353' language: - iso: eng 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 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Selfish Network Creation - On Variants of Network Creation Games type: dissertation user_id: '5786' volume: 353 year: '2016' ... --- _id: '157' 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. author: - first_name: Jürgen full_name: König, Jürgen last_name: König - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: 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 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. 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. 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. 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.' date_created: 2017-10-17T12:41:22Z date_updated: 2022-01-06T06:52:32Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-319-48749-6_41 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:50:29Z date_updated: 2018-03-21T12:50:29Z file_id: '1549' file_name: 157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf file_size: 753147 relation: main_file success: 1 file_date_updated: 2018-03-21T12:50:29Z has_accepted_license: '1' page: 563--577 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: Scheduling with Interjob Communication on Parallel Processors type: conference user_id: '15504' year: '2016' ... --- _id: '159' abstract: - lang: eng 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. 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 id: '40384' last_name: Skopalik citation: 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 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} }' 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.' 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. 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. short: T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562. date_created: 2017-10-17T12:41:23Z date_updated: 2022-01-06T06:52:40Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1109/TNET.2015.2468571 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:48:02Z date_updated: 2018-03-21T12:48:02Z file_id: '1547' file_name: 159-Harks-Hoefer-Schewior-Skopalik2016.pdf file_size: 1655309 relation: main_file success: 1 file_date_updated: 2018-03-21T12:48:02Z has_accepted_license: '1' issue: '4' language: - iso: eng page: 2553 - 2562 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: IEEE/ACM Transactions on Networking publisher: IEEE status: public title: Routing Games With Progressive Filling type: journal_article user_id: '477' year: '2016' ... --- _id: '149' 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(√α).' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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' 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 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. 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. 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. 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.' date_created: 2017-10-17T12:41:21Z date_updated: 2022-01-06T06:52:10Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-48749-6_43 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:55:43Z date_updated: 2018-03-21T12:55:43Z file_id: '1553' file_name: 149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf file_size: 236253 relation: main_file success: 1 file_date_updated: 2018-03-21T12:55:43Z has_accepted_license: '1' language: - iso: eng page: 593--607 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '7' name: SFB 901 - Subproject A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: Strategic Online Facility Location type: conference user_id: '477' year: '2016' ... --- _id: '163' citation: 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 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' 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} }' 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. 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. 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. 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. conference: end_date: 2016-07-08 location: Paderborn, Germany name: MobiHoc start_date: 2016-07-04 date_created: 2017-10-17T12:41:23Z date_updated: 2022-01-06T06:52:48Z department: - _id: '63' doi: 10.1145/2942358 editor: - first_name: Falko full_name: Dressler, Falko last_name: Dressler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publisher: ACM status: public title: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) type: conference_editor user_id: '15504' year: '2016' ... --- _id: '16351' 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" author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Ralf full_name: Petring, Ralf last_name: Petring citation: 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 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} }' 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. 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 . 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.' date_created: 2020-03-30T10:21:53Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: '10.1007/978-3-319-49487-6_7 ' editor: - first_name: Lasse full_name: Kliemann, Lasse last_name: Kliemann - first_name: Peter full_name: Sanders, Peter last_name: Sanders intvolume: ' 9220' language: - iso: eng page: 226-244 publication: Algorithm Engineering publisher: Springer series_title: LNCS status: public title: Algorithm Engineering Aspects of Real-Time Rendering Algorithms type: conference user_id: '15415' volume: 9220 year: '2016' ...