--- _id: '657' abstract: - lang: eng text: 'We present two distributed, constant factor approximation algorithms for the metric facility location problem. Both algorithms have been designed with a strong emphasis on applicability in the area of wireless sensor networks: in order to execute them, each sensor node only requires limited local knowledge and simple computations. Also, the algorithms can cope with measurement errors and take into account that communication costs between sensor nodes do not necessarily increase linearly with the distance, but can be represented by a polynomial. Since it cannot always be expected that sensor nodes execute algorithms in a synchronized way, our algorithms are executed in an asynchronous model (but they are still able to break symmetry that might occur when two neighboring nodes act at exactly the same time). Furthermore, they can deal with dynamic scenarios: if a node moves, the solution is updated and the update affects only nodes in the local neighborhood. Finally, the algorithms are robust in the sense that incorrect behavior of some nodes during some round will, in the end, still result in a good approximation. The first algorithm runs in expected O(log_{1+\epsilon} n) communication rounds and yields a \my^4(1+4\my^2(1+\epsilon)^{1/p})^p approximation, while the second has a running time of expected O(log^2_{1+\epsilon} n) communication rounds and an approximation factor of \my^4(1 + 2(1 + \epsilon)^{1/p})^p. Here, \epsilon > 0 is an arbitrarily small constant, p the exponent of the polynomial representing the communication costs, and \my the relative measurement error.' author: - first_name: Sebastan full_name: Abshoff, Sebastan last_name: Abshoff - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: 'Barbara ' full_name: 'Kempkes, Barbara ' last_name: Kempkes - first_name: Peter full_name: Pietrzyk, Peter last_name: Pietrzyk citation: ama: 'Abshoff S, Cord-Landwehr A, Degener B, Kempkes B, Pietrzyk P. Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In: Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS). LNCS. ; 2011:13-27. doi:10.1007/978-3-642-28209-6_3' apa: Abshoff, S., Cord-Landwehr, A., Degener, B., Kempkes, B., & Pietrzyk, P. (2011). Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS) (pp. 13–27). https://doi.org/10.1007/978-3-642-28209-6_3 bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Degener_Kempkes_Pietrzyk_2011, series={LNCS}, title={Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks}, DOI={10.1007/978-3-642-28209-6_3}, booktitle={Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)}, author={Abshoff, Sebastan and Cord-Landwehr, Andreas and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}, year={2011}, pages={13–27}, collection={LNCS} }' chicago: Abshoff, Sebastan, Andreas Cord-Landwehr, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” In Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 13–27. LNCS, 2011. https://doi.org/10.1007/978-3-642-28209-6_3. ieee: S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks,” in Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27. mla: Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27, doi:10.1007/978-3-642-28209-6_3. short: 'S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, P. Pietrzyk, in: Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.' date_created: 2017-10-17T12:43:00Z date_updated: 2022-01-06T07:03:12Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-642-28209-6_3 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T13:48:21Z date_updated: 2018-03-14T13:48:21Z file_id: '1219' file_name: 657-flp_algosensors2011-Cord-Landwehr.pdf file_size: 454740 relation: main_file success: 1 file_date_updated: 2018-03-14T13:48:21Z has_accepted_license: '1' language: - iso: eng page: 13-27 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 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS) series_title: LNCS status: public title: Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks type: conference user_id: '477' year: '2011' ... --- _id: '663' author: - first_name: Kamil full_name: Swierkot, Kamil last_name: Swierkot citation: ama: Swierkot K. Complexity Classes for Local Computation. Universität Paderborn; 2011. apa: Swierkot, K. (2011). Complexity Classes for Local Computation. Universität Paderborn. bibtex: '@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }' chicago: Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011. ieee: K. Swierkot, Complexity Classes for Local Computation. Universität Paderborn, 2011. mla: Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011. short: K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011. date_created: 2017-10-17T12:43:01Z date_updated: 2022-01-06T07:03:13Z 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: Complexity Classes for Local Computation type: mastersthesis user_id: '477' year: '2011' ... --- _id: '664' abstract: - lang: eng text: 'Web Computing is a variant of parallel computing where the idle times of PCs donated by worldwide distributed users are employed to execute parallel programs. The PUB-Web library developed by us supports this kind of usage of computing resources. A major problem for the efficient execution of such parallel programs is load balancing. In the Web Computing context, this problem becomes more difficult because of the dynamic behavior of the underlying "parallel computer": the set of available processors (donated PCs) as well as their availability (idle times) change over time in an unpredictable fashion.In this paper, we experimentally evaluate and compare load balancing algorithms in this scenario, namely a variant of the well-established Work Stealing algorithm and strategies based on a heterogeneous version of distributed hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic data sets for the job input streams and for the dynamics of the availability of the resources.Our experimental evaluations suggest that Work Stealing is the better strategy if the number of processes ready to run matches the number of available processors. But a suitable variant of DHHTs outperforms Work Stealing if there are significantly more processes ready to run than available processors.' author: - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Gehweiler J, Kling P, Meyer auf der Heide F. An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM). LNCS. ; 2011:31--40. doi:10.1007/978-3-642-31500-8_4' apa: Gehweiler, J., Kling, P., & Meyer auf der Heide, F. (2011). An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 31--40). https://doi.org/10.1007/978-3-642-31500-8_4 bibtex: '@inproceedings{Gehweiler_Kling_Meyer auf der Heide_2011, series={LNCS}, title={An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment}, DOI={10.1007/978-3-642-31500-8_4}, booktitle={Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Gehweiler, Joachim and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2011}, pages={31--40}, collection={LNCS} }' chicago: Gehweiler, Joachim, Peter Kling, and Friedhelm Meyer auf der Heide. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” In Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 31--40. LNCS, 2011. https://doi.org/10.1007/978-3-642-31500-8_4. ieee: J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment,” in Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40. mla: Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40, doi:10.1007/978-3-642-31500-8_4. short: 'J. Gehweiler, P. Kling, F. Meyer auf der Heide, in: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40.' date_created: 2017-10-17T12:43:01Z date_updated: 2022-01-06T07:03:14Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-642-31500-8_4 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T13:45:57Z date_updated: 2018-03-14T13:45:57Z file_id: '1216' file_name: 664-PPAM11GKM_01.pdf file_size: 333335 relation: main_file success: 1 file_date_updated: 2018-03-14T13:45:57Z has_accepted_license: '1' page: 31--40 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '14' name: SFB 901 - Subproject C2 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM) series_title: LNCS status: public title: An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment type: conference user_id: '15504' year: '2011' ... --- _id: '667' citation: ama: Meyer auf der Heide F, Rajaraman R, eds. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures.; 2011. doi:10.1145/1989493 apa: Meyer auf der Heide, F., & Rajaraman, R. (Eds.). (2011). 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/1989493 bibtex: '@book{Meyer auf der Heide_Rajaraman_2011, title={23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures}, DOI={10.1145/1989493}, year={2011} }' chicago: Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, eds. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011. https://doi.org/10.1145/1989493. ieee: F. Meyer auf der Heide and R. Rajaraman, Eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011. mla: Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011, doi:10.1145/1989493. short: F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011. date_created: 2017-10-17T12:43:02Z date_updated: 2022-01-06T07:03:14Z department: - _id: '63' doi: 10.1145/1989493 editor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: 'Rajmohan ' full_name: 'Rajaraman, Rajmohan ' last_name: Rajaraman language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A status: public title: 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures type: conference_editor user_id: '477' year: '2011' ... --- _id: '16410' abstract: - lang: eng text: 'Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version.' author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Martina full_name: Hüllmann, Martina last_name: Hüllmann - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Alexander full_name: Klaas, Alexander last_name: Klaas - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Sven full_name: Kurras, Sven last_name: Kurras - first_name: Marcus full_name: Märtens, Marcus last_name: Märtens - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christoph full_name: Raupach, Christoph last_name: Raupach - first_name: Kamil full_name: Swierkot, Kamil last_name: Swierkot - first_name: Daniel full_name: Warner, Daniel last_name: Warner - first_name: Christoph full_name: Weddemann, Christoph last_name: Weddemann - first_name: Daniel full_name: Wonisch, Daniel last_name: Wonisch citation: ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011). Springer; 2011:178-189. doi:10.1007/978-3-642-18381-2_15' apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011) (pp. 178–189). Springer. https://doi.org/10.1007/978-3-642-18381-2_15 bibtex: '@inproceedings{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, title={Collisionless Gathering of Robots with an Extent}, DOI={10.1007/978-3-642-18381-2_15}, number={6543}, booktitle={37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)}, publisher={Springer}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011}, pages={178–189} }' chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), 178–89. Springer, 2011. https://doi.org/10.1007/978-3-642-18381-2_15. ieee: A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189. mla: Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), no. 6543, Springer, 2011, pp. 178–89, doi:10.1007/978-3-642-18381-2_15. short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011, pp. 178–189.' date_created: 2020-04-06T07:52:42Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-3-642-18381-2_15 issue: '6543' language: - iso: eng page: 178-189 publication: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011) publication_identifier: isbn: - '9783642183805' - '9783642183812' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Collisionless Gathering of Robots with an Extent type: conference user_id: '15415' year: '2011' ... --- _id: '16412' author: - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Gehweiler J, Meyer auf der Heide F. Bin Packing - How Do I Get My Stuff into the Boxes. In: Algorithms Unplugged. Berlin, Heidelberg; 2011:367-374. doi:10.1007/978-3-642-15328-0_38' apa: Gehweiler, J., & Meyer auf der Heide, F. (2011). Bin Packing - How Do I Get My Stuff into the Boxes. In Algorithms Unplugged (pp. 367–374). Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_38 bibtex: '@inbook{Gehweiler_Meyer auf der Heide_2011, place={Berlin, Heidelberg}, title={Bin Packing - How Do I Get My Stuff into the Boxes}, DOI={10.1007/978-3-642-15328-0_38}, booktitle={Algorithms Unplugged}, author={Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2011}, pages={367–374} }' chicago: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” In Algorithms Unplugged, 367–74. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-15328-0_38. ieee: J. Gehweiler and F. Meyer auf der Heide, “Bin Packing - How Do I Get My Stuff into the Boxes,” in Algorithms Unplugged, Berlin, Heidelberg, 2011, pp. 367–374. mla: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” Algorithms Unplugged, 2011, pp. 367–74, doi:10.1007/978-3-642-15328-0_38. short: 'J. Gehweiler, F. Meyer auf der Heide, in: Algorithms Unplugged, Berlin, Heidelberg, 2011, pp. 367–374.' date_created: 2020-04-06T10:10:39Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-3-642-15328-0_38 language: - iso: eng page: 367-374 place: Berlin, Heidelberg publication: Algorithms Unplugged publication_identifier: isbn: - '9783642153273' - '9783642153280' publication_status: published status: public title: Bin Packing - How Do I Get My Stuff into the Boxes type: book_chapter user_id: '15415' year: '2011' ... --- _id: '16428' author: - first_name: Rajmohan full_name: Rajaraman, Rajmohan last_name: Rajaraman - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Rajaraman R, Meyer auf der Heide F. Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. In: ; 2011. doi:10.1145/1989493' apa: Rajaraman, R., & Meyer auf der Heide, F. (2011). Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493 bibtex: '@inproceedings{Rajaraman_Meyer auf der Heide_2011, title={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, DOI={10.1145/1989493}, author={Rajaraman, Rajmohan and Meyer auf der Heide, Friedhelm}, year={2011} }' chicago: Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. “Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11,” 2011. https://doi.org/10.1145/1989493. ieee: R. Rajaraman and F. Meyer auf der Heide, “Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11,” 2011. mla: Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. 2011, doi:10.1145/1989493. short: 'R. Rajaraman, F. Meyer auf der Heide, in: 2011.' date_created: 2020-04-06T13:48:10Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1145/1989493 language: - iso: eng publication_identifier: isbn: - '9781450307437' publication_status: published status: public title: Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11 type: conference user_id: '15415' year: '2011' ... --- _id: '16447' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Sándor P. full_name: Fekete, Sándor P. last_name: Fekete - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Degener B, Fekete SP, Kempkes B, Meyer auf der Heide F. A survey on relay placement with runtime and approximation guarantees. Computer Science Review. 2011:57-68. doi:10.1016/j.cosrev.2010.09.005 apa: Degener, B., Fekete, S. P., Kempkes, B., & Meyer auf der Heide, F. (2011). A survey on relay placement with runtime and approximation guarantees. Computer Science Review, 57–68. https://doi.org/10.1016/j.cosrev.2010.09.005 bibtex: '@article{Degener_Fekete_Kempkes_Meyer auf der Heide_2011, title={A survey on relay placement with runtime and approximation guarantees}, DOI={10.1016/j.cosrev.2010.09.005}, journal={Computer Science Review}, author={Degener, Bastian and Fekete, Sándor P. and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={57–68} }' chicago: Degener, Bastian, Sándor P. Fekete, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” Computer Science Review, 2011, 57–68. https://doi.org/10.1016/j.cosrev.2010.09.005. ieee: B. Degener, S. P. Fekete, B. Kempkes, and F. Meyer auf der Heide, “A survey on relay placement with runtime and approximation guarantees,” Computer Science Review, pp. 57–68, 2011. mla: Degener, Bastian, et al. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” Computer Science Review, 2011, pp. 57–68, doi:10.1016/j.cosrev.2010.09.005. short: B. Degener, S.P. Fekete, B. Kempkes, F. Meyer auf der Heide, Computer Science Review (2011) 57–68. date_created: 2020-04-07T06:46:06Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1016/j.cosrev.2010.09.005 language: - iso: eng page: 57-68 publication: Computer Science Review publication_identifier: issn: - 1574-0137 publication_status: published status: public title: A survey on relay placement with runtime and approximation guarantees type: journal_article user_id: '15415' year: '2011' ... --- _id: '16451' author: - first_name: Philipp full_name: Brandes, Philipp last_name: Brandes - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-efficient strategies for building short chains of mobile robots locally. In: SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity. ; 2011:138-149. doi:10.1016/j.tcs.2012.10.056' apa: 'Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-efficient strategies for building short chains of mobile robots locally. In SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity (pp. 138–149). https://doi.org/10.1016/j.tcs.2012.10.056' bibtex: '@inproceedings{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, title={Energy-efficient strategies for building short chains of mobile robots locally}, DOI={10.1016/j.tcs.2012.10.056}, booktitle={SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={138–149} }' chicago: 'Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” In SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 138–49, 2011. https://doi.org/10.1016/j.tcs.2012.10.056.' ieee: 'P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-efficient strategies for building short chains of mobile robots locally,” in SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–149.' mla: 'Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–49, doi:10.1016/j.tcs.2012.10.056.' short: 'P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–149.' date_created: 2020-04-07T12:12:23Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1016/j.tcs.2012.10.056 language: - iso: eng page: 138-149 publication: 'SIROCCO ''11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity' publication_status: published status: public title: Energy-efficient strategies for building short chains of mobile robots locally type: conference user_id: '15415' year: '2011' ... --- _id: '16453' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Tobias full_name: Langner, Tobias last_name: Langner - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Peter full_name: Pietrzyk, Peter last_name: Pietrzyk - first_name: Roger full_name: Wattenhofer, Roger last_name: Wattenhofer citation: ama: 'Degener B, Kempkes B, Langner T, Meyer auf der Heide F, Pietrzyk P, Wattenhofer R. A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989515' apa: Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., & Wattenhofer, R. (2011). A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989515 bibtex: '@inproceedings{Degener_Kempkes_Langner_Meyer auf der Heide_Pietrzyk_Wattenhofer_2011, title={A tight runtime bound for synchronous gathering of autonomous robots with limited visibility}, DOI={10.1145/1989493.1989515}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Degener, Bastian and Kempkes, Barbara and Langner, Tobias and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Wattenhofer, Roger}, year={2011} }' chicago: Degener, Bastian, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, and Roger Wattenhofer. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011. https://doi.org/10.1145/1989493.1989515. ieee: B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, and R. Wattenhofer, “A tight runtime bound for synchronous gathering of autonomous robots with limited visibility,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011. mla: Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989515. short: 'B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, R. Wattenhofer, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.' date_created: 2020-04-07T12:31:24Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1145/1989493.1989515 language: - iso: eng publication: Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11 publication_identifier: isbn: - '9781450307437' publication_status: published status: public title: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility type: conference user_id: '15415' year: '2011' ... --- _id: '16454' author: - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Kling P, Meyer auf der Heide F. Convergence of local communication chain strategies via linear transformations. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989517' apa: Kling, P., & Meyer auf der Heide, F. (2011). Convergence of local communication chain strategies via linear transformations. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989517 bibtex: '@inproceedings{Kling_Meyer auf der Heide_2011, title={Convergence of local communication chain strategies via linear transformations}, DOI={10.1145/1989493.1989517}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2011} }' chicago: Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication Chain Strategies via Linear Transformations.” In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011. https://doi.org/10.1145/1989493.1989517. ieee: P. Kling and F. Meyer auf der Heide, “Convergence of local communication chain strategies via linear transformations,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011. mla: Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication Chain Strategies via Linear Transformations.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989517. short: 'P. Kling, F. Meyer auf der Heide, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.' date_created: 2020-04-07T12:33:00Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1145/1989493.1989517 language: - iso: eng publication: Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11 publication_identifier: isbn: - '9781450307437' publication_status: published status: public title: Convergence of local communication chain strategies via linear transformations type: conference user_id: '15415' year: '2011' ... --- _id: '16455' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Degener B, Kempkes B, Meyer auf der Heide F. Building Simple Formations in Large Societies of Tiny Mobile Robots. Procedia Computer Science. 2011:153-155. doi:10.1016/j.procs.2011.09.049 apa: Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Building Simple Formations in Large Societies of Tiny Mobile Robots. Procedia Computer Science, 153–155. https://doi.org/10.1016/j.procs.2011.09.049 bibtex: '@article{Degener_Kempkes_Meyer auf der Heide_2011, title={Building Simple Formations in Large Societies of Tiny Mobile Robots}, DOI={10.1016/j.procs.2011.09.049}, journal={Procedia Computer Science}, author={Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={153–155} }' chicago: Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Building Simple Formations in Large Societies of Tiny Mobile Robots.” Procedia Computer Science, 2011, 153–55. https://doi.org/10.1016/j.procs.2011.09.049. ieee: B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building Simple Formations in Large Societies of Tiny Mobile Robots,” Procedia Computer Science, pp. 153–155, 2011. mla: Degener, Bastian, et al. “Building Simple Formations in Large Societies of Tiny Mobile Robots.” Procedia Computer Science, 2011, pp. 153–55, doi:10.1016/j.procs.2011.09.049. short: B. Degener, B. Kempkes, F. Meyer auf der Heide, Procedia Computer Science (2011) 153–155. date_created: 2020-04-07T12:35:11Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1016/j.procs.2011.09.049 language: - iso: eng page: 153-155 publication: Procedia Computer Science publication_identifier: issn: - 1877-0509 publication_status: published status: public title: Building Simple Formations in Large Societies of Tiny Mobile Robots type: journal_article user_id: '15415' year: '2011' ... --- _id: '16456' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Degener B, Kempkes B, Meyer auf der Heide F. Energy-Awareness in Self-organising Robotic Exploration Teams. In: Organic Computing — A Paradigm Shift for Complex Systems. Basel; 2011. doi:10.1007/978-3-0348-0130-0_35' apa: Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-Awareness in Self-organising Robotic Exploration Teams. In Organic Computing — A Paradigm Shift for Complex Systems. Basel. https://doi.org/10.1007/978-3-0348-0130-0_35 bibtex: '@inbook{Degener_Kempkes_Meyer auf der Heide_2011, place={Basel}, title={Energy-Awareness in Self-organising Robotic Exploration Teams}, DOI={10.1007/978-3-0348-0130-0_35}, booktitle={Organic Computing — A Paradigm Shift for Complex Systems}, author={Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011} }' chicago: Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Energy-Awareness in Self-Organising Robotic Exploration Teams.” In Organic Computing — A Paradigm Shift for Complex Systems. Basel, 2011. https://doi.org/10.1007/978-3-0348-0130-0_35. ieee: B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Awareness in Self-organising Robotic Exploration Teams,” in Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011. mla: Degener, Bastian, et al. “Energy-Awareness in Self-Organising Robotic Exploration Teams.” Organic Computing — A Paradigm Shift for Complex Systems, 2011, doi:10.1007/978-3-0348-0130-0_35. short: 'B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011.' date_created: 2020-04-07T12:36:17Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-3-0348-0130-0_35 language: - iso: eng place: Basel publication: Organic Computing — A Paradigm Shift for Complex Systems publication_identifier: isbn: - '9783034801294' - '9783034801300' publication_status: published status: public title: Energy-Awareness in Self-organising Robotic Exploration Teams type: book_chapter user_id: '15415' year: '2011' ... --- _id: '16459' author: - first_name: Philipp full_name: Brandes, Philipp last_name: Brandes - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In: Structural Information and Communication Complexity. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22212-2_13' apa: Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In Structural Information and Communication Complexity. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_13 bibtex: '@inbook{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, place={Berlin, Heidelberg}, title={Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally}, DOI={10.1007/978-3-642-22212-2_13}, booktitle={Structural Information and Communication Complexity}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011} }' chicago: Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” In Structural Information and Communication Complexity. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22212-2_13. ieee: P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2011. mla: Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” Structural Information and Communication Complexity, 2011, doi:10.1007/978-3-642-22212-2_13. short: 'P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.' date_created: 2020-04-08T06:52:53Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-3-642-22212-2_13 language: - iso: eng place: Berlin, Heidelberg publication: Structural Information and Communication Complexity publication_identifier: isbn: - '9783642222115' - '9783642222122' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally type: book_chapter user_id: '15415' year: '2011' ... --- _id: '17009' author: - first_name: D. Frank full_name: Hsu, D. Frank last_name: Hsu - first_name: Bruce M. full_name: Magga, Bruce M. last_name: Magga - first_name: Howard C. T. full_name: Ho, Howard C. T. last_name: Ho - first_name: Juraj full_name: Hromkovic, Juraj last_name: Hromkovic - first_name: Francis C. M. full_name: Lau, Francis C. M. last_name: Lau - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Hsu DF, Magga BM, Ho HCT, Hromkovic J, Lau FCM, Meyer auf der Heide F. EDITORIAL. Journal of Interconnection Networks. 2011:vii-viii. doi:10.1142/s0219265911002885 apa: Hsu, D. F., Magga, B. M., Ho, H. C. T., Hromkovic, J., Lau, F. C. M., & Meyer auf der Heide, F. (2011). EDITORIAL. Journal of Interconnection Networks, vii–viii. https://doi.org/10.1142/s0219265911002885 bibtex: '@article{Hsu_Magga_Ho_Hromkovic_Lau_Meyer auf der Heide_2011, title={EDITORIAL}, DOI={10.1142/s0219265911002885}, journal={Journal of Interconnection Networks}, author={Hsu, D. Frank and Magga, Bruce M. and Ho, Howard C. T. and Hromkovic, Juraj and Lau, Francis C. M. and Meyer auf der Heide, Friedhelm}, year={2011}, pages={vii–viii} }' chicago: Hsu, D. Frank, Bruce M. Magga, Howard C. T. Ho, Juraj Hromkovic, Francis C. M. Lau, and Friedhelm Meyer auf der Heide. “EDITORIAL.” Journal of Interconnection Networks, 2011, vii–viii. https://doi.org/10.1142/s0219265911002885. ieee: D. F. Hsu, B. M. Magga, H. C. T. Ho, J. Hromkovic, F. C. M. Lau, and F. Meyer auf der Heide, “EDITORIAL,” Journal of Interconnection Networks, pp. vii–viii, 2011. mla: Hsu, D. Frank, et al. “EDITORIAL.” Journal of Interconnection Networks, 2011, pp. vii–viii, doi:10.1142/s0219265911002885. short: D.F. Hsu, B.M. Magga, H.C.T. Ho, J. Hromkovic, F.C.M. Lau, F. Meyer auf der Heide, Journal of Interconnection Networks (2011) vii–viii. date_created: 2020-05-18T13:35:10Z date_updated: 2022-01-06T06:53:01Z department: - _id: '63' doi: 10.1142/s0219265911002885 language: - iso: eng page: vii-viii publication: Journal of Interconnection Networks publication_identifier: issn: - 0219-2659 - 1793-6713 publication_status: published status: public title: EDITORIAL type: journal_article user_id: '15415' year: '2011' ... --- _id: '16409' abstract: - lang: eng text: "Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes.\r\n" author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Martina full_name: Hüllmann, Martina last_name: Hüllmann - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Alexander full_name: Klaas, Alexander last_name: Klaas - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Sven full_name: Kurras, Sven last_name: Kurras - first_name: Marcus full_name: Märtens, Marcus last_name: Märtens - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christoph full_name: Raupach, Christoph last_name: Raupach - first_name: Kamil full_name: Swierkot, Kamil last_name: Swierkot - first_name: Daniel full_name: Warner, Daniel last_name: Warner - first_name: Christoph full_name: Weddemann, Christoph last_name: Weddemann - first_name: Daniel full_name: Wonisch, Daniel last_name: Wonisch citation: ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52' apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_52 bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for Analyzing Convergence Algorithms for Mobile Robots}, DOI={10.1007/978-3-642-22012-8_52}, booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }' chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In Automata, Languages and Programming. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52. ieee: A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011. mla: Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52. short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011.' date_created: 2020-04-06T07:47:55Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-3-642-22012-8_52 language: - iso: eng place: Berlin, Heidelberg publication: Automata, Languages and Programming publication_identifier: isbn: - '9783642220111' - '9783642220128' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: A New Approach for Analyzing Convergence Algorithms for Mobile Robots type: book_chapter user_id: '15415' year: '2011' ... --- _id: '19678' author: - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Heiko full_name: Röglin, Heiko last_name: Röglin citation: ama: 'Briest P, Röglin H. The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In: Workshop on Approximation and Online Algorithms (WAOA). Vol 6534. Lecture Notes in Computer Science. Springer; 2010. doi:10.1007/978-3-642-18318-8_5' apa: 'Briest, P., & Röglin, H. (2010). The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In Workshop on Approximation and Online Algorithms (WAOA) (Vol. 6534). Springer. https://doi.org/10.1007/978-3-642-18318-8_5' bibtex: '@inproceedings{Briest_Röglin_2010, series={Lecture Notes in Computer Science}, title={The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers}, volume={6534}, DOI={10.1007/978-3-642-18318-8_5}, booktitle={Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Briest, Patrick and Röglin, Heiko}, year={2010}, collection={Lecture Notes in Computer Science} }' chicago: 'Briest, Patrick, and Heiko Röglin. “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.” In Workshop on Approximation and Online Algorithms (WAOA), Vol. 6534. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-18318-8_5.' ieee: 'P. Briest and H. Röglin, “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers,” in Workshop on Approximation and Online Algorithms (WAOA), 2010, vol. 6534.' mla: 'Briest, Patrick, and Heiko Röglin. “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.” Workshop on Approximation and Online Algorithms (WAOA), vol. 6534, Springer, 2010, doi:10.1007/978-3-642-18318-8_5.' short: 'P. Briest, H. Röglin, in: Workshop on Approximation and Online Algorithms (WAOA), Springer, 2010.' date_created: 2020-09-24T14:13:19Z date_updated: 2022-01-06T06:54:09Z department: - _id: '63' doi: 10.1007/978-3-642-18318-8_5 intvolume: ' 6534' language: - iso: eng publication: Workshop on Approximation and Online Algorithms (WAOA) publisher: Springer series_title: Lecture Notes in Computer Science status: public title: 'The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers' type: conference user_id: '15415' volume: 6534 year: '2010' ... --- _id: '19711' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Peter full_name: Pietrzyk, Peter last_name: Pietrzyk - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes citation: ama: 'Degener B, Pietrzyk P, Kempkes B. A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In: International Parallel & Distributed Processing Symposium (IPDPS). ; 2010. doi:10.1109/IPDPS.2010.5470349' apa: Degener, B., Pietrzyk, P., & Kempkes, B. (2010). A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In International Parallel & Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/IPDPS.2010.5470349 bibtex: '@inproceedings{Degener_Pietrzyk_Kempkes_2010, title={A local, distributed constant-factor approximation algorithm for the dynamic facility location problem }, DOI={10.1109/IPDPS.2010.5470349}, booktitle={International Parallel & Distributed Processing Symposium (IPDPS)}, author={Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}, year={2010} }' chicago: Degener, Bastian, Peter Pietrzyk, and Barbara Kempkes. “A Local, Distributed Constant-Factor Approximation Algorithm for the Dynamic Facility Location Problem .” In International Parallel & Distributed Processing Symposium (IPDPS), 2010. https://doi.org/10.1109/IPDPS.2010.5470349. ieee: B. Degener, P. Pietrzyk, and B. Kempkes, “A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ,” in International Parallel & Distributed Processing Symposium (IPDPS), 2010. mla: Degener, Bastian, et al. “A Local, Distributed Constant-Factor Approximation Algorithm for the Dynamic Facility Location Problem .” International Parallel & Distributed Processing Symposium (IPDPS), 2010, doi:10.1109/IPDPS.2010.5470349. short: 'B. Degener, P. Pietrzyk, B. Kempkes, in: International Parallel & Distributed Processing Symposium (IPDPS), 2010.' date_created: 2020-09-28T08:25:37Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' doi: 10.1109/IPDPS.2010.5470349 language: - iso: eng publication: International Parallel & Distributed Processing Symposium (IPDPS) status: public title: 'A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ' type: conference user_id: '15415' year: '2010' ... --- _id: '19796' abstract: - lang: eng text: "We introduce the Read-Write-Coding-System (RWC) \x96 a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \\leq r,w \\leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\\left(n,k,d\\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data." author: - first_name: Mario full_name: Mense, Mario last_name: Mense - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Mense M, Schindelhauer C. Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems. Vol 5873. Lecture Notes in Computer Science. ; 2010:624--639. doi:10.1007/978-3-642-05118-0_43' apa: 'Mense, M., & Schindelhauer, C. (2010). Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (Vol. 5873, pp. 624--639). https://doi.org/10.1007/978-3-642-05118-0_43' bibtex: '@inproceedings{Mense_Schindelhauer_2010, series={Lecture Notes in Computer Science}, title={Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks}, volume={5873}, DOI={10.1007/978-3-642-05118-0_43}, booktitle={Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems}, author={Mense, Mario and Schindelhauer, Christian}, year={2010}, pages={624--639}, collection={Lecture Notes in Computer Science} }' chicago: 'Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” In Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 5873:624--639. Lecture Notes in Computer Science, 2010. https://doi.org/10.1007/978-3-642-05118-0_43.' ieee: 'M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks,” in Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, vol. 5873, pp. 624--639.' mla: 'Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 5873, 2010, pp. 624--639, doi:10.1007/978-3-642-05118-0_43.' short: 'M. Mense, C. Schindelhauer, in: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, pp. 624--639.' date_created: 2020-09-30T12:12:33Z date_updated: 2022-01-06T06:54:12Z department: - _id: '63' doi: 10.1007/978-3-642-05118-0_43 intvolume: ' 5873' language: - iso: eng page: 624--639 publication: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems publication_identifier: isbn: - '9783642051173' - '9783642051180' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: Lecture Notes in Computer Science status: public title: 'Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks' type: conference user_id: '15415' volume: 5873 year: '2010' ... --- _id: '19824' abstract: - lang: eng text: We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to overcome their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow range queries, and DHTs for load balancing. Simple handshake operations with provable guarantees are used for maintenance and self-stabilization. Efficiency of load balancing, fast data access, and robustness are proven by rigorous analysis. author: - first_name: Thomas full_name: Janson, Thomas last_name: Janson - first_name: Peter full_name: Mahlmann, Peter last_name: Mahlmann - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Janson T, Mahlmann P, Schindelhauer C. A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. In: Proceedings of the 16th International Conference on Parallel and Distributed Systems. ; 2010. doi:10.1109/icpads.2010.42' apa: Janson, T., Mahlmann, P., & Schindelhauer, C. (2010). A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. In Proceedings of the 16th International Conference on Parallel and Distributed Systems. https://doi.org/10.1109/icpads.2010.42 bibtex: '@inproceedings{Janson_Mahlmann_Schindelhauer_2010, title={A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, DOI={10.1109/icpads.2010.42}, booktitle={Proceedings of the 16th International Conference on Parallel and Distributed Systems}, author={Janson, Thomas and Mahlmann, Peter and Schindelhauer, Christian}, year={2010} }' chicago: Janson, Thomas, Peter Mahlmann, and Christian Schindelhauer. “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs.” In Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010. https://doi.org/10.1109/icpads.2010.42. ieee: T. Janson, P. Mahlmann, and C. Schindelhauer, “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs,” in Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010. mla: Janson, Thomas, et al. “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs.” Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010, doi:10.1109/icpads.2010.42. short: 'T. Janson, P. Mahlmann, C. Schindelhauer, in: Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010.' date_created: 2020-10-01T09:39:13Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1109/icpads.2010.42 language: - iso: eng publication: Proceedings of the 16th International Conference on Parallel and Distributed Systems publication_identifier: isbn: - '9781424497270' publication_status: published status: public title: A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs type: conference user_id: '15415' year: '2010' ... --- _id: '19829' author: - first_name: Huawei full_name: Miao, Huawei last_name: Miao - first_name: Chia Ching full_name: Ooi, Chia Ching last_name: Ooi - first_name: Xiaowen full_name: Wu, Xiaowen last_name: Wu - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Miao H, Ooi CC, Wu X, Schindelhauer C. Coverage-hole trap model in target tracking using distributed relay-robot network. In: Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10. ; 2010:1299-1304. doi:10.1145/1774088.1774365' apa: Miao, H., Ooi, C. C., Wu, X., & Schindelhauer, C. (2010). Coverage-hole trap model in target tracking using distributed relay-robot network. In Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10 (pp. 1299–1304). https://doi.org/10.1145/1774088.1774365 bibtex: '@inproceedings{Miao_Ooi_Wu_Schindelhauer_2010, title={Coverage-hole trap model in target tracking using distributed relay-robot network}, DOI={10.1145/1774088.1774365}, booktitle={Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10}, author={Miao, Huawei and Ooi, Chia Ching and Wu, Xiaowen and Schindelhauer, Christian}, year={2010}, pages={1299–1304} }' chicago: Miao, Huawei, Chia Ching Ooi, Xiaowen Wu, and Christian Schindelhauer. “Coverage-Hole Trap Model in Target Tracking Using Distributed Relay-Robot Network.” In Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10, 1299–1304, 2010. https://doi.org/10.1145/1774088.1774365. ieee: H. Miao, C. C. Ooi, X. Wu, and C. Schindelhauer, “Coverage-hole trap model in target tracking using distributed relay-robot network,” in Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10, 2010, pp. 1299–1304. mla: Miao, Huawei, et al. “Coverage-Hole Trap Model in Target Tracking Using Distributed Relay-Robot Network.” Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10, 2010, pp. 1299–304, doi:10.1145/1774088.1774365. short: 'H. Miao, C.C. Ooi, X. Wu, C. Schindelhauer, in: Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10, 2010, pp. 1299–1304.' date_created: 2020-10-01T10:00:25Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1774088.1774365 language: - iso: eng page: 1299-1304 publication: Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10 publication_identifier: isbn: - '9781605586397' publication_status: published status: public title: Coverage-hole trap model in target tracking using distributed relay-robot network type: conference user_id: '15415' year: '2010' ... --- _id: '19933' author: - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker - first_name: Simon full_name: Oberthur, Simon last_name: Oberthur - first_name: Michael full_name: Kortenjan, Michael last_name: Kortenjan citation: ama: 'Schomaker G, Oberthur S, Kortenjan M. Distributed and dynamic resource management for self-optimizing mechatronic systems. In: 8th IEEE International Conference on Industrial Informatics (INDIN’2010). ; 2010. doi:10.1109/indin.2010.5549647' apa: Schomaker, G., Oberthur, S., & Kortenjan, M. (2010). Distributed and dynamic resource management for self-optimizing mechatronic systems. In 8th IEEE International Conference on Industrial Informatics (INDIN’2010). https://doi.org/10.1109/indin.2010.5549647 bibtex: '@inproceedings{Schomaker_Oberthur_Kortenjan_2010, title={Distributed and dynamic resource management for self-optimizing mechatronic systems}, DOI={10.1109/indin.2010.5549647}, booktitle={8th IEEE International Conference on Industrial Informatics (INDIN’2010)}, author={Schomaker, Gunnar and Oberthur, Simon and Kortenjan, Michael}, year={2010} }' chicago: Schomaker, Gunnar, Simon Oberthur, and Michael Kortenjan. “Distributed and Dynamic Resource Management for Self-Optimizing Mechatronic Systems.” In 8th IEEE International Conference on Industrial Informatics (INDIN’2010), 2010. https://doi.org/10.1109/indin.2010.5549647. ieee: G. Schomaker, S. Oberthur, and M. Kortenjan, “Distributed and dynamic resource management for self-optimizing mechatronic systems,” in 8th IEEE International Conference on Industrial Informatics (INDIN’2010), 2010. mla: Schomaker, Gunnar, et al. “Distributed and Dynamic Resource Management for Self-Optimizing Mechatronic Systems.” 8th IEEE International Conference on Industrial Informatics (INDIN’2010), 2010, doi:10.1109/indin.2010.5549647. short: 'G. Schomaker, S. Oberthur, M. Kortenjan, in: 8th IEEE International Conference on Industrial Informatics (INDIN’2010), 2010.' date_created: 2020-10-06T14:01:21Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '70' doi: 10.1109/indin.2010.5549647 language: - iso: eng publication: 8th IEEE International Conference on Industrial Informatics (INDIN'2010) publication_identifier: isbn: - '9781424472987' publication_status: published status: public title: Distributed and dynamic resource management for self-optimizing mechatronic systems type: conference user_id: '15415' year: '2010' ... --- _id: '20182' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Hamann H. Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Berlin, Germany: Springer; 2010. doi:10.1007/978-3-642-13377-0' apa: 'Hamann, H. (2010). Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Berlin, Germany: Springer. https://doi.org/10.1007/978-3-642-13377-0' bibtex: '@book{Hamann_2010, place={Berlin, Germany}, title={Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming}, DOI={10.1007/978-3-642-13377-0}, publisher={Springer}, author={Hamann, Heiko}, year={2010} }' chicago: 'Hamann, Heiko. Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Berlin, Germany: Springer, 2010. https://doi.org/10.1007/978-3-642-13377-0.' ieee: 'H. Hamann, Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Berlin, Germany: Springer, 2010.' mla: 'Hamann, Heiko. Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Springer, 2010, doi:10.1007/978-3-642-13377-0.' short: 'H. Hamann, Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming, Springer, Berlin, Germany, 2010.' date_created: 2020-10-22T12:25:10Z date_updated: 2022-01-06T06:54:21Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-642-13377-0 language: - iso: eng place: Berlin, Germany publisher: Springer status: public title: 'Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming' type: book user_id: '15415' year: '2010' ... --- _id: '20220' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Jürgen full_name: Stradner, Jürgen last_name: Stradner - first_name: Karl full_name: Crailsheim, Karl last_name: Crailsheim citation: ama: 'Hamann H, Schmickl T, Stradner J, Crailsheim K. A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10). ; 2010:244--251. doi:10.1109/CEC.2010.5585994' apa: 'Hamann, H., Schmickl, T., Stradner, J., & Crailsheim, K. (2010). A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10) (pp. 244--251). https://doi.org/10.1109/CEC.2010.5585994' bibtex: '@inproceedings{Hamann_Schmickl_Stradner_Crailsheim_2010, title={A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning}, DOI={10.1109/CEC.2010.5585994}, booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10)}, author={Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl}, year={2010}, pages={244--251} }' chicago: 'Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, and Karl Crailsheim. “A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning.” In Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), 244--251, 2010. https://doi.org/10.1109/CEC.2010.5585994.' ieee: 'H. Hamann, T. Schmickl, J. Stradner, and K. Crailsheim, “A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), 2010, pp. 244--251.' mla: 'Hamann, Heiko, et al. “A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning.” Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), 2010, pp. 244--251, doi:10.1109/CEC.2010.5585994.' short: 'H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), 2010, pp. 244--251.' date_created: 2020-10-28T14:37:09Z date_updated: 2022-01-06T06:54:23Z department: - _id: '63' - _id: '238' doi: 10.1109/CEC.2010.5585994 language: - iso: eng page: 244--251 publication: Proceedings of the IEEE Congress on Evolutionary Computation (CEC'10) status: public title: 'A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning' type: conference user_id: '15415' year: '2010' ... --- _id: '20222' author: - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Jürgen full_name: Stradner, Jürgen last_name: Stradner - first_name: Ralf full_name: Mayet, Ralf last_name: Mayet - first_name: Karl full_name: Crailsheim, Karl last_name: Crailsheim citation: ama: 'Schmickl T, Hamann H, Stradner J, Mayet R, Crailsheim K. Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller. In: Proc. of the ALife XII Conference. MIT Press; 2010:648--655.' apa: Schmickl, T., Hamann, H., Stradner, J., Mayet, R., & Crailsheim, K. (2010). Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller. In Proc. of the ALife XII Conference (pp. 648--655). MIT Press. bibtex: '@inproceedings{Schmickl_Hamann_Stradner_Mayet_Crailsheim_2010, title={Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller}, booktitle={Proc. of the ALife XII Conference}, publisher={MIT Press}, author={Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Mayet, Ralf and Crailsheim, Karl}, year={2010}, pages={648--655} }' chicago: Schmickl, Thomas, Heiko Hamann, Jürgen Stradner, Ralf Mayet, and Karl Crailsheim. “Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller.” In Proc. of the ALife XII Conference, 648--655. MIT Press, 2010. ieee: T. Schmickl, H. Hamann, J. Stradner, R. Mayet, and K. Crailsheim, “Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller,” in Proc. of the ALife XII Conference, 2010, pp. 648--655. mla: Schmickl, Thomas, et al. “Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller.” Proc. of the ALife XII Conference, MIT Press, 2010, pp. 648--655. short: 'T. Schmickl, H. Hamann, J. Stradner, R. Mayet, K. Crailsheim, in: Proc. of the ALife XII Conference, MIT Press, 2010, pp. 648--655.' date_created: 2020-10-29T14:09:39Z date_updated: 2022-01-06T06:54:23Z department: - _id: '63' - _id: '238' language: - iso: eng page: 648--655 publication: Proc. of the ALife XII Conference publisher: MIT Press status: public title: Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller type: conference user_id: '15415' year: '2010' ... --- _id: '20223' abstract: - lang: eng text: "The semi-automatic or automatic synthesis of robot controller software is\r\nboth desirable and challenging. Synthesis of rather simple behaviors such as\r\ncollision avoidance by applying artificial evolution has been shown multiple\r\ntimes. However, the difficulty of this synthesis increases heavily with\r\nincreasing complexity of the task that should be performed by the robot. We try\r\nto tackle this problem of complexity with Artificial Homeostatic Hormone\r\nSystems (AHHS), which provide both intrinsic, homeostatic processes and\r\n(transient) intrinsic, variant behavior. By using AHHS the need for pre-defined\r\ncontroller topologies or information about the field of application is\r\nminimized. We investigate how the principle design of the controller and the\r\nhormone network size affects the overall performance of the artificial\r\nevolution (i.e., evolvability). This is done by comparing two variants of AHHS\r\nthat show different effects when mutated. We evolve a controller for a robot\r\nbuilt from five autonomous, cooperating modules. The desired behavior is a form\r\nof gait resulting in fast locomotion by using the modules' main hinges." author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Jürgen full_name: Stradner, Jürgen last_name: Stradner - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Karl full_name: Crailsheim, Karl last_name: Crailsheim citation: ama: 'Hamann H, Stradner J, Schmickl T, Crailsheim K. Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics. In: Artificial Life XII (ALife XII), Odense, Denmark. MIT  Press; 2010:773-780.' apa: 'Hamann, H., Stradner, J., Schmickl, T., & Crailsheim, K. (2010). Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics. In Artificial Life XII (ALife XII), Odense, Denmark (pp. 773–780). MIT  Press.' bibtex: '@inproceedings{Hamann_Stradner_Schmickl_Crailsheim_2010, title={Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics}, booktitle={Artificial Life XII (ALife XII), Odense, Denmark}, publisher={MIT  Press}, author={Hamann, Heiko and Stradner, Jürgen and Schmickl, Thomas and Crailsheim, Karl}, year={2010}, pages={773–780} }' chicago: 'Hamann, Heiko, Jürgen Stradner, Thomas Schmickl, and Karl Crailsheim. “Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics.” In Artificial Life XII (ALife XII), Odense, Denmark, 773–80. MIT  Press, 2010.' ieee: 'H. Hamann, J. Stradner, T. Schmickl, and K. Crailsheim, “Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics,” in Artificial Life XII (ALife XII), Odense, Denmark, 2010, pp. 773–780.' mla: 'Hamann, Heiko, et al. “Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics.” Artificial Life XII (ALife XII), Odense, Denmark, MIT  Press, 2010, pp. 773–80.' short: 'H. Hamann, J. Stradner, T. Schmickl, K. Crailsheim, in: Artificial Life XII (ALife XII), Odense, Denmark, MIT  Press, 2010, pp. 773–780.' date_created: 2020-10-29T14:11:25Z date_updated: 2022-01-06T06:54:23Z department: - _id: '63' - _id: '238' external_id: arxiv: - '1011.3912' language: - iso: eng page: 773-780 publication: Artificial Life XII (ALife XII), Odense, Denmark publisher: MIT Press status: public title: 'Artificial Hormone Reaction Networks: Towards Higher Evolvability in Evolutionary Multi-Modular Robotics' type: conference user_id: '15415' year: '2010' ... --- _id: '20226' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Bernd full_name: Meyer, Bernd last_name: Meyer - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Karl full_name: Crailsheim, Karl last_name: Crailsheim citation: ama: 'Hamann H, Meyer B, Schmickl T, Crailsheim K. A Model of Symmetry Breaking in Collective Decision-Making. In: From Animals to Animats 11. Vol 6226. Springer; 2010:639-648. doi:10.1007/978-3-642-15193-4_60' apa: Hamann, H., Meyer, B., Schmickl, T., & Crailsheim, K. (2010). A Model of Symmetry Breaking in Collective Decision-Making. In From Animals to Animats 11 (Vol. 6226, pp. 639–648). Springer. https://doi.org/10.1007/978-3-642-15193-4_60 bibtex: '@inproceedings{Hamann_Meyer_Schmickl_Crailsheim_2010, title={A Model of Symmetry Breaking in Collective Decision-Making}, volume={6226}, DOI={10.1007/978-3-642-15193-4_60}, booktitle={From Animals to Animats 11}, publisher={Springer}, author={Hamann, Heiko and Meyer, Bernd and Schmickl, Thomas and Crailsheim, Karl}, year={2010}, pages={639–648} }' chicago: Hamann, Heiko, Bernd Meyer, Thomas Schmickl, and Karl Crailsheim. “A Model of Symmetry Breaking in Collective Decision-Making.” In From Animals to Animats 11, 6226:639–48. Springer, 2010. https://doi.org/10.1007/978-3-642-15193-4_60. ieee: H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry Breaking in Collective Decision-Making,” in From Animals to Animats 11, 2010, vol. 6226, pp. 639–648. mla: Hamann, Heiko, et al. “A Model of Symmetry Breaking in Collective Decision-Making.” From Animals to Animats 11, vol. 6226, Springer, 2010, pp. 639–48, doi:10.1007/978-3-642-15193-4_60. short: 'H. Hamann, B. Meyer, T. Schmickl, K. Crailsheim, in: From Animals to Animats 11, Springer, 2010, pp. 639–648.' date_created: 2020-10-29T14:22:12Z date_updated: 2022-01-06T06:54:24Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-642-15193-4_60 intvolume: ' 6226' language: - iso: eng page: 639-648 publication: From Animals to Animats 11 publication_identifier: isbn: - '9783642151927' - '9783642151934' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: A Model of Symmetry Breaking in Collective Decision-Making type: conference user_id: '15415' volume: 6226 year: '2010' ... --- _id: '20258' abstract: - lang: eng text: Self-organization in natural systems demonstrates very reliable and scalable collective behavior without using any central elements. When providing collective robotic systems with self-organizing principles, we are facing new problems of making self-organization purposeful, self-adapting to changing environments and faster, in order to meet requirements from a technical perspective. This paper describes on-going work of creating such an artificial self-organization within artificial robot organisms, performed in the framework of several European projects. author: - first_name: Serge full_name: Kernbach, Serge last_name: Kernbach - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Jürgen full_name: Stradner, Jürgen last_name: Stradner - first_name: Ronald full_name: Thenius, Ronald last_name: Thenius - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Karl full_name: Crailsheim, Karl last_name: Crailsheim - first_name: A.C. van full_name: Rossum, A.C. van last_name: Rossum - first_name: Michele full_name: Sebag, Michele last_name: Sebag - first_name: Nicolas full_name: Bredeche, Nicolas last_name: Bredeche - first_name: Yao full_name: Yao, Yao last_name: Yao - first_name: Guy full_name: Baele, Guy last_name: Baele - first_name: Yves Van de full_name: Peer, Yves Van de last_name: Peer - first_name: Jon full_name: Timmis, Jon last_name: Timmis - first_name: Maizura full_name: Mohktar, Maizura last_name: Mohktar - first_name: Andy full_name: Tyrrell, Andy last_name: Tyrrell - first_name: A.E. full_name: Eiben, A.E. last_name: Eiben - first_name: S.P. full_name: McKibbin, S.P. last_name: McKibbin - first_name: Wenguo full_name: Liu, Wenguo last_name: Liu - first_name: Alan F.T. full_name: Winfield, Alan F.T. last_name: Winfield citation: ama: 'Kernbach S, Hamann H, Stradner J, et al. On Adaptive Self-Organization in Artificial Robot Organisms. In: 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns. ; 2010. doi:10.1109/computationworld.2009.9' apa: 'Kernbach, S., Hamann, H., Stradner, J., Thenius, R., Schmickl, T., Crailsheim, K., … Winfield, A. F. T. (2010). On Adaptive Self-Organization in Artificial Robot Organisms. In 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns. https://doi.org/10.1109/computationworld.2009.9' bibtex: '@inproceedings{Kernbach_Hamann_Stradner_Thenius_Schmickl_Crailsheim_Rossum_Sebag_Bredeche_Yao_et al._2010, title={On Adaptive Self-Organization in Artificial Robot Organisms}, DOI={10.1109/computationworld.2009.9}, booktitle={2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns}, author={Kernbach, Serge and Hamann, Heiko and Stradner, Jürgen and Thenius, Ronald and Schmickl, Thomas and Crailsheim, Karl and Rossum, A.C. van and Sebag, Michele and Bredeche, Nicolas and Yao, Yao and et al.}, year={2010} }' chicago: 'Kernbach, Serge, Heiko Hamann, Jürgen Stradner, Ronald Thenius, Thomas Schmickl, Karl Crailsheim, A.C. van Rossum, et al. “On Adaptive Self-Organization in Artificial Robot Organisms.” In 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2010. https://doi.org/10.1109/computationworld.2009.9.' ieee: 'S. Kernbach et al., “On Adaptive Self-Organization in Artificial Robot Organisms,” in 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2010.' mla: 'Kernbach, Serge, et al. “On Adaptive Self-Organization in Artificial Robot Organisms.” 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2010, doi:10.1109/computationworld.2009.9.' short: 'S. Kernbach, H. Hamann, J. Stradner, R. Thenius, T. Schmickl, K. Crailsheim, A.C. van Rossum, M. Sebag, N. Bredeche, Y. Yao, G. Baele, Y.V. de Peer, J. Timmis, M. Mohktar, A. Tyrrell, A.E. Eiben, S.P. McKibbin, W. Liu, A.F.T. Winfield, in: 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2010.' date_created: 2020-11-02T14:13:10Z date_updated: 2022-01-06T06:54:25Z department: - _id: '63' - _id: '238' doi: 10.1109/computationworld.2009.9 language: - iso: eng publication: '2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns' publication_identifier: isbn: - '9781424451661' publication_status: published status: public title: On Adaptive Self-Organization in Artificial Robot Organisms type: conference user_id: '15415' year: '2010' ... --- _id: '24282' author: - first_name: Ryszard full_name: Grza̧ślewicz, Ryszard last_name: Grza̧ślewicz - first_name: Jarosław full_name: Kutyłowski, Jarosław last_name: Kutyłowski - first_name: Mirosław full_name: Kutyłowski, Mirosław last_name: Kutyłowski - first_name: Wojciech full_name: Pietkiewicz, Wojciech last_name: Pietkiewicz citation: ama: 'Grza̧ślewicz R, Kutyłowski J, Kutyłowski M, Pietkiewicz W. Robust Undetectable Interference Watermarks. ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications. Published online 2010. doi:10.1007/11424826_55' apa: 'Grza̧ślewicz, R., Kutyłowski, J., Kutyłowski, M., & Pietkiewicz, W. (2010). Robust Undetectable Interference Watermarks. ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications. https://doi.org/10.1007/11424826_55' bibtex: '@article{Grza̧ślewicz_Kutyłowski_Kutyłowski_Pietkiewicz_2010, title={Robust Undetectable Interference Watermarks}, DOI={10.1007/11424826_55}, journal={ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications}, author={Grza̧ślewicz, Ryszard and Kutyłowski, Jarosław and Kutyłowski, Mirosław and Pietkiewicz, Wojciech}, year={2010} }' chicago: 'Grza̧ślewicz, Ryszard, Jarosław Kutyłowski, Mirosław Kutyłowski, and Wojciech Pietkiewicz. “Robust Undetectable Interference Watermarks.” ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications, 2010. https://doi.org/10.1007/11424826_55.' ieee: 'R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, and W. Pietkiewicz, “Robust Undetectable Interference Watermarks,” ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications, 2010, doi: 10.1007/11424826_55.' mla: 'Grza̧ślewicz, Ryszard, et al. “Robust Undetectable Interference Watermarks.” ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications, 2010, doi:10.1007/11424826_55.' short: 'R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, W. Pietkiewicz, ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications (2010).' date_created: 2021-09-13T14:53:37Z date_updated: 2022-01-06T06:56:17Z department: - _id: '63' doi: 10.1007/11424826_55 language: - iso: eng publication: 'ICCSA''05: Proceedings of the 2005 international conference on Computational Science and Its Applications' publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Robust Undetectable Interference Watermarks type: journal_article user_id: '15415' year: '2010' ... --- _id: '27159' author: - first_name: Sufyan full_name: Samara, Sufyan last_name: Samara - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker citation: ama: 'Samara S, Schomaker G. Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip. In: 2010 10th IEEE International Conference on Computer and Information Technology. ; 2010. doi:10.1109/cit.2010.304' apa: Samara, S., & Schomaker, G. (2010). Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip. 2010 10th IEEE International Conference on Computer and Information Technology. https://doi.org/10.1109/cit.2010.304 bibtex: '@inproceedings{Samara_Schomaker_2010, title={Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip}, DOI={10.1109/cit.2010.304}, booktitle={2010 10th IEEE International Conference on Computer and Information Technology}, author={Samara, Sufyan and Schomaker, Gunnar}, year={2010} }' chicago: Samara, Sufyan, and Gunnar Schomaker. “Real-Time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip.” In 2010 10th IEEE International Conference on Computer and Information Technology, 2010. https://doi.org/10.1109/cit.2010.304. ieee: 'S. Samara and G. Schomaker, “Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip,” 2010, doi: 10.1109/cit.2010.304.' mla: Samara, Sufyan, and Gunnar Schomaker. “Real-Time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip.” 2010 10th IEEE International Conference on Computer and Information Technology, 2010, doi:10.1109/cit.2010.304. short: 'S. Samara, G. Schomaker, in: 2010 10th IEEE International Conference on Computer and Information Technology, 2010.' date_created: 2021-11-04T15:53:55Z date_updated: 2022-01-06T06:57:35Z department: - _id: '63' - _id: '26' doi: 10.1109/cit.2010.304 language: - iso: eng publication: 2010 10th IEEE International Conference on Computer and Information Technology publication_status: published status: public title: Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip type: conference user_id: '15415' year: '2010' ... --- _id: '17422' abstract: - lang: eng text: "Commercial software of material flow simulations has the ability to layout the simulated models. Arranged equipment, such as conveyors or machines, includes the need to model and determine motion paths for moving objects like forklifts or automatically guided vehicles, so that the simulation framework is able to navigate all vehicles across those motion paths. After analyzing first scenarios, the user often carries out layout changes in the simulation model, e.g. moving, adding or deleting equipment. However, those changes cause time consuming, additional modeling of the motion paths for the user. Our motion planning algorithm reduces these changes by automatically determining the motion paths for moving objects, depending on an actual model layout without colliding with other objects. The algorithm works on the basis of the virtual scene\x92s 3D-data used for the simulation model\x92s visualization. We demonstrate the technique with a multi-floor building example." author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Hendrik full_name: Renken, Hendrik last_name: Renken - first_name: Christoph full_name: Laroque, Christoph last_name: Laroque - first_name: Guido full_name: Schaumann, Guido last_name: Schaumann - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier citation: ama: 'Fischer M, Renken H, Laroque C, Schaumann G, Dangelmaier W. Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations. In: Proceedings of the 2010 Winter Simulation Conference. ; 2010. doi:10.1109/wsc.2010.5678906' apa: Fischer, M., Renken, H., Laroque, C., Schaumann, G., & Dangelmaier, W. (2010). Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations. In Proceedings of the 2010 Winter Simulation Conference. https://doi.org/10.1109/wsc.2010.5678906 bibtex: '@inproceedings{Fischer_Renken_Laroque_Schaumann_Dangelmaier_2010, title={Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations}, DOI={10.1109/wsc.2010.5678906}, booktitle={Proceedings of the 2010 Winter Simulation Conference}, author={Fischer, Matthias and Renken, Hendrik and Laroque, Christoph and Schaumann, Guido and Dangelmaier, Wilhelm}, year={2010} }' chicago: Fischer, Matthias, Hendrik Renken, Christoph Laroque, Guido Schaumann, and Wilhelm Dangelmaier. “Automated 3D-Motion Planning for Ramps and Stairs in Intra-Logistics Material Flow Simulations.” In Proceedings of the 2010 Winter Simulation Conference, 2010. https://doi.org/10.1109/wsc.2010.5678906. ieee: M. Fischer, H. Renken, C. Laroque, G. Schaumann, and W. Dangelmaier, “Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations,” in Proceedings of the 2010 Winter Simulation Conference, 2010. mla: Fischer, Matthias, et al. “Automated 3D-Motion Planning for Ramps and Stairs in Intra-Logistics Material Flow Simulations.” Proceedings of the 2010 Winter Simulation Conference, 2010, doi:10.1109/wsc.2010.5678906. short: 'M. Fischer, H. Renken, C. Laroque, G. Schaumann, W. Dangelmaier, in: Proceedings of the 2010 Winter Simulation Conference, 2010.' date_created: 2020-07-27T19:33:16Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' doi: 10.1109/wsc.2010.5678906 language: - iso: eng publication: Proceedings of the 2010 Winter Simulation Conference publication_identifier: isbn: - '9781424498666' publication_status: published status: public title: Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations type: conference user_id: '15415' year: '2010' ... --- _id: '17462' author: - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Ulf-Peter full_name: Schroeder, Ulf-Peter id: '477' last_name: Schroeder citation: ama: 'Gehweiler J, Meyer auf der Heide F, Schroeder U-P. A Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf Institut; 2010.' apa: 'Gehweiler, J., Meyer auf der Heide, F., & Schroeder, U.-P. (2010). A Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf Institut.' bibtex: '@book{Gehweiler_Meyer auf der Heide_Schroeder_2010, place={Paderborn}, title={A Large-Scale Distributed Environment for Peer-to-Peer Services}, publisher={Heinz Nixdorf Institut}, author={Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Schroeder, Ulf-Peter}, year={2010} }' chicago: 'Gehweiler, Joachim, Friedhelm Meyer auf der Heide, and Ulf-Peter Schroeder. A Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf Institut, 2010.' ieee: 'J. Gehweiler, F. Meyer auf der Heide, and U.-P. Schroeder, A Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf Institut, 2010.' mla: Gehweiler, Joachim, et al. A Large-Scale Distributed Environment for Peer-to-Peer Services. Heinz Nixdorf Institut, 2010. short: J. Gehweiler, F. Meyer auf der Heide, U.-P. Schroeder, A Large-Scale Distributed Environment for Peer-to-Peer Services, Heinz Nixdorf Institut, Paderborn, 2010. date_created: 2020-07-30T07:25:59Z date_updated: 2022-01-06T06:53:12Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-07-30T07:24:17Z date_updated: 2020-07-30T07:24:17Z file_id: '17463' file_name: tr-ri-10-317.pdf file_size: 468844 relation: main_file success: 1 file_date_updated: 2020-07-30T07:24:17Z has_accepted_license: '1' language: - iso: eng place: Paderborn publisher: Heinz Nixdorf Institut report_number: tr-ri-10-317 status: public title: A Large-Scale Distributed Environment for Peer-to-Peer Services type: report user_id: '15415' year: '2010' ... --- _id: '17464' author: - first_name: Maria J. full_name: Blesa, Maria J. last_name: Blesa - first_name: Christian full_name: Blum, Christian last_name: Blum - first_name: Angelo full_name: de Caro, Angelo last_name: de Caro - first_name: 'Bastian ' full_name: 'Degener, Bastian ' last_name: Degener - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Piere full_name: Leone, Piere last_name: Leone - first_name: Giuseppe full_name: Persiano, Giuseppe last_name: Persiano - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Georgios full_name: Mylonas, Georgios last_name: Mylonas citation: ama: Blesa MJ, Blum C, de Caro A, et al. Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study.; 2010. apa: Blesa, M. J., Blum, C., de Caro, A., Degener, B., Kempkes, B., Leone, P., … Mylonas, G. (2010). Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study. bibtex: '@book{Blesa_Blum_de Caro_Degener_Kempkes_Leone_Persiano_Meyer auf der Heide_Mylonas_2010, title={Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study}, author={Blesa, Maria J. and Blum, Christian and de Caro, Angelo and Degener, Bastian and Kempkes, Barbara and Leone, Piere and Persiano, Giuseppe and Meyer auf der Heide, Friedhelm and Mylonas, Georgios}, year={2010} }' chicago: Blesa, Maria J., Christian Blum, Angelo de Caro, Bastian Degener, Barbara Kempkes, Piere Leone, Giuseppe Persiano, Friedhelm Meyer auf der Heide, and Georgios Mylonas. Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study, 2010. ieee: M. J. Blesa et al., Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study. 2010. mla: Blesa, Maria J., et al. Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study. 2010. short: M.J. Blesa, C. Blum, A. de Caro, B. Degener, B. Kempkes, P. Leone, G. Persiano, F. Meyer auf der Heide, G. Mylonas, Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study, 2010. date_created: 2020-07-30T07:48:53Z date_updated: 2022-01-06T06:53:12Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-07-30T07:48:24Z date_updated: 2020-07-30T07:48:24Z file_id: '17466' file_name: FRONTS-TR-2010-11.pdf file_size: 242286 relation: main_file success: 1 file_date_updated: 2020-07-30T07:48:24Z has_accepted_license: '1' language: - iso: eng report_number: FRONTS-TR-2010-11 status: public title: Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study type: report user_id: '15415' year: '2010' ... --- _id: '17586' abstract: - lang: eng text: 'We are given a winding chain of $n$ mobile robots between two stations in the plane, each of them having a limited viewing range. It is only guaranteed that each robot can see its two neighbors in the chain. We analyze a simple and natural parallel strategy to shorten the chain in a time model where each relay is allowed to move up to a distance of $\delta$ in each time step. This model fills the gap between the previously used discrete time model and the continuous time model which was introduced recently in \cite{sirocco}. We analyze the strategy with respect to two quality measures: the number of time steps and the maximum distance to be traveled by the robots, which are the major energy consumers in this scenario. We provide asymptotically tight or almost tight bounds in this time model for both quality measures and it turns out that the best choice for $\delta$ is $\delta \in \Theta(\frac{1}{n})$, since this minimizes the number of time steps as well as the maximum traveled distance.' author: - first_name: Philipp full_name: Brandes, Philipp last_name: Brandes - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Building short chains of mobile robots locally with a bounded stepwidth. 2010. apa: Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2010). Building short chains of mobile robots locally with a bounded stepwidth. bibtex: '@article{Brandes_Degener_Kempkes_Meyer auf der Heide_2010, title={Building short chains of mobile robots locally with a bounded stepwidth}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2010} }' chicago: Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Building Short Chains of Mobile Robots Locally with a Bounded Stepwidth,” 2010. ieee: P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building short chains of mobile robots locally with a bounded stepwidth.” 2010. mla: Brandes, Philipp, et al. Building Short Chains of Mobile Robots Locally with a Bounded Stepwidth. 2010. short: P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, (2010). date_created: 2020-08-04T12:28:05Z date_updated: 2022-01-06T06:53:15Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-04T12:26:55Z date_updated: 2020-08-04T12:26:55Z file_id: '17587' file_name: BoundedStepwidth.pdf file_size: 476532 relation: main_file success: 1 file_date_updated: 2020-08-04T12:26:55Z has_accepted_license: '1' language: - iso: eng status: public title: Building short chains of mobile robots locally with a bounded stepwidth type: preprint user_id: '15415' year: '2010' ... --- _id: '17665' author: - first_name: Reuven full_name: Bar-Yehuda, Reuven last_name: Bar-Yehuda - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Dror full_name: Rawitz, Dror last_name: Rawitz citation: ama: 'Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. In: DIALM-PODC. ; 2010:33-42.' apa: Bar-Yehuda, R., Polevoy, G., & Rawitz, D. (2010). Bandwidth allocation in cellular networks with multiple interferences. In DIALM-PODC (pp. 33–42). bibtex: '@inproceedings{Bar-Yehuda_Polevoy_Rawitz_2010, title={Bandwidth allocation in cellular networks with multiple interferences}, booktitle={DIALM-PODC}, author={Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2010}, pages={33–42} }' chicago: Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” In DIALM-PODC, 33–42, 2010. ieee: R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” in DIALM-PODC, 2010, pp. 33–42. mla: Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” DIALM-PODC, 2010, pp. 33–42. short: 'R. Bar-Yehuda, G. Polevoy, D. Rawitz, in: DIALM-PODC, 2010, pp. 33–42.' date_created: 2020-08-06T15:22:47Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' language: - iso: eng page: 33-42 publication: DIALM-PODC status: public title: Bandwidth allocation in cellular networks with multiple interferences type: conference user_id: '83983' year: '2010' ... --- _id: '18761' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Jürgen full_name: Stradner, Jürgen last_name: Stradner - first_name: Karl full_name: Crailsheim, Karl last_name: Crailsheim - first_name: Paul full_name: Levi, Paul last_name: Levi - first_name: Serge full_name: Kernbach, Serge last_name: Kernbach citation: ama: 'Hamann H, Schmickl T, Stradner J, Crailsheim K, Levi P, Kernbach S. Hormone-based Control for Multi-modular Robotics. In: Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution. Springer; 2010:240--263.' apa: 'Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., Levi, P., & Kernbach, S. (2010). Hormone-based Control for Multi-modular Robotics. In Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution (pp. 240--263). Springer.' bibtex: '@inbook{Hamann_Schmickl_Stradner_Crailsheim_Levi_Kernbach_2010, title={Hormone-based Control for Multi-modular Robotics}, booktitle={Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution}, publisher={Springer}, author={Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Levi, Paul and Kernbach, Serge}, year={2010}, pages={240--263} }' chicago: 'Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, Paul Levi, and Serge Kernbach. “Hormone-Based Control for Multi-Modular Robotics.” In Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, 240--263. Springer, 2010.' ieee: 'H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Levi, and S. Kernbach, “Hormone-based Control for Multi-modular Robotics,” in Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, Springer, 2010, pp. 240--263.' mla: 'Hamann, Heiko, et al. “Hormone-Based Control for Multi-Modular Robotics.” Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, Springer, 2010, pp. 240--263.' short: 'H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Levi, S. Kernbach, in: Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, Springer, 2010, pp. 240--263.' date_created: 2020-09-01T11:29:17Z date_updated: 2022-01-06T06:53:51Z department: - _id: '63' - _id: '238' language: - iso: eng page: 240--263 publication: 'Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution' publication_status: published publisher: Springer status: public title: Hormone-based Control for Multi-modular Robotics type: book_chapter user_id: '15415' year: '2010' ... --- _id: '18910' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski citation: ama: Bienkowski M. Page Migration in Dynamic Networks. Vol 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010. apa: Bienkowski, M. (2010). Page migration in dynamic networks (Vol. 282). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Bienkowski_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Page migration in dynamic networks}, volume={282}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bienkowski, Marcin}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Bienkowski, Marcin. Page Migration in Dynamic Networks. Vol. 282. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. ieee: M. Bienkowski, Page migration in dynamic networks, vol. 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. mla: Bienkowski, Marcin. Page Migration in Dynamic Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. short: M. Bienkowski, Page Migration in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. date_created: 2020-09-03T07:52:47Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' - _id: '26' intvolume: ' 282' language: - iso: eng publication_identifier: isbn: - 978-3-942647-01-4 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2005010135 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: Page migration in dynamic networks type: dissertation user_id: '5786' volume: 282 year: '2010' ... --- _id: '18927' author: - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia citation: ama: Dynia M. Collective Graph Exploration. Vol 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010. apa: Dynia, M. (2010). Collective graph exploration (Vol. 284). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Dynia_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Collective graph exploration}, volume={284}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dynia, Miroslaw}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Dynia, Miroslaw. Collective Graph Exploration. Vol. 284. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. ieee: M. Dynia, Collective graph exploration, vol. 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. mla: Dynia, Miroslaw. Collective Graph Exploration. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. short: M. Dynia, Collective Graph Exploration, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. date_created: 2020-09-03T10:21:10Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' - _id: '26' intvolume: ' 284' language: - iso: eng publication_identifier: isbn: - 978-3-942647-03-8 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080225031 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: Collective graph exploration type: dissertation user_id: '5786' volume: 284 year: '2010' ... --- _id: '19011' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Christiane full_name: Lammersen, Christiane last_name: Lammersen citation: ama: Degener B, Gehweiler J, Lammersen C. Kinetic Facility Location. Algorithmica. 2010;57(3):562-584. doi:10.1007/s00453-008-9250-7 apa: Degener, B., Gehweiler, J., & Lammersen, C. (2010). Kinetic Facility Location. Algorithmica, 57(3), 562–584. https://doi.org/10.1007/s00453-008-9250-7 bibtex: '@article{Degener_Gehweiler_Lammersen_2010, title={Kinetic Facility Location}, volume={57}, DOI={10.1007/s00453-008-9250-7}, number={3}, journal={Algorithmica}, author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2010}, pages={562–584} }' chicago: 'Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “Kinetic Facility Location.” Algorithmica 57, no. 3 (2010): 562–84. https://doi.org/10.1007/s00453-008-9250-7.' ieee: B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” Algorithmica, vol. 57, no. 3, pp. 562–584, 2010. mla: Degener, Bastian, et al. “Kinetic Facility Location.” Algorithmica, vol. 57, no. 3, 2010, pp. 562–84, doi:10.1007/s00453-008-9250-7. short: B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584. date_created: 2020-09-04T10:35:36Z date_updated: 2022-01-06T06:53:57Z department: - _id: '63' doi: 10.1007/s00453-008-9250-7 intvolume: ' 57' issue: '3' language: - iso: eng page: 562-584 publication: Algorithmica publication_identifier: issn: - 0178-4617 - 1432-0541 publication_status: published status: public title: Kinetic Facility Location type: journal_article user_id: '15415' volume: 57 year: '2010' ... --- _id: '19013' author: - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Henning full_name: Meyerhenke, Henning last_name: Meyerhenke citation: ama: 'Gehweiler J, Meyerhenke H. A distributed diffusive heuristic for clustering a virtual P2P supercomputer. In: Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC). ; 2010. doi:10.1109/ipdpsw.2010.5470922' apa: Gehweiler, J., & Meyerhenke, H. (2010). A distributed diffusive heuristic for clustering a virtual P2P supercomputer. In Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC). https://doi.org/10.1109/ipdpsw.2010.5470922 bibtex: '@inproceedings{Gehweiler_Meyerhenke_2010, title={A distributed diffusive heuristic for clustering a virtual P2P supercomputer}, DOI={10.1109/ipdpsw.2010.5470922}, booktitle={Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)}, author={Gehweiler, Joachim and Meyerhenke, Henning}, year={2010} }' chicago: Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer.” In Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010. https://doi.org/10.1109/ipdpsw.2010.5470922. ieee: J. Gehweiler and H. Meyerhenke, “A distributed diffusive heuristic for clustering a virtual P2P supercomputer,” in Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010. mla: Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer.” Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010, doi:10.1109/ipdpsw.2010.5470922. short: 'J. Gehweiler, H. Meyerhenke, in: Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010.' date_created: 2020-09-04T10:39:37Z date_updated: 2022-01-06T06:53:57Z department: - _id: '63' doi: 10.1109/ipdpsw.2010.5470922 language: - iso: eng publication: Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC) publication_identifier: isbn: - '9781424465330' publication_status: published status: public title: A distributed diffusive heuristic for clustering a virtual P2P supercomputer type: conference user_id: '15415' year: '2010' ... --- _id: '19016' abstract: - lang: eng text: Load balancing is an important requirement for the efficient execu-tion of parallel numerical simulations. In particular when the simulation domainchanges over time, the mapping of computational tasks to processors needs tobe modified accordingly. State-of-the-art libraries for this problem are basedon graph repartitioning. They have a number of drawbacks, including the opti-mized metric and the difficulty of parallelizing the popular repartitioning heuris-tic Kernighan-Lin (KL).Here we further explore the very promising diffusion-based graph partitioningalgorithm DIBAP (Meyerhenke et al., JPDC 69(9):750–761, 2009) by adaptingDIBAP to the related problem of load balancing. Experiments with graph se-quences that imitate adaptive numerical simulations demonstrate the applicabilityand high quality of DIBAP for load balancing by repartitioning. Compared to thefaster state-of-the-art repartitioners PARMETIS and parallel JOSTLE, DIBAP’ssolutions have partitions with significantly fewer external edges and boundarynodes and the resulting average migration volume in the important maximumnorm is also the best in most cases.We also prove that one of DIBAP’s key components optimizes a relaxed versionof the minimum edge cut problem. Moreover, we hint at a distributed algorithmbased on ideas used in DIBAP for clustering a virtual P2P supercomputer. author: - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Henning full_name: Meyerhenke, Henning last_name: Meyerhenke citation: ama: 'Gehweiler J, Meyerhenke H. On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering. ; 2010.' apa: 'Gehweiler, J., & Meyerhenke, H. (2010). On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In Dagstuhl Seminar Proceedings 10261: Algorithm Engineering.' bibtex: '@inproceedings{Gehweiler_Meyerhenke_2010, title={On Dynamic Graph Partitioning and Graph Clustering using Diffusion}, booktitle={Dagstuhl Seminar Proceedings 10261: Algorithm Engineering}, author={Gehweiler, Joachim and Meyerhenke, Henning}, year={2010} }' chicago: 'Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning and Graph Clustering Using Diffusion.” In Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010.' ieee: 'J. Gehweiler and H. Meyerhenke, “On Dynamic Graph Partitioning and Graph Clustering using Diffusion,” in Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010.' mla: 'Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning and Graph Clustering Using Diffusion.” Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010.' short: 'J. Gehweiler, H. Meyerhenke, in: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010.' date_created: 2020-09-04T10:45:47Z date_updated: 2022-01-06T06:53:57Z department: - _id: '63' language: - iso: eng publication: 'Dagstuhl Seminar Proceedings 10261: Algorithm Engineering' related_material: link: - relation: confirmation url: https://drops.dagstuhl.de/opus/volltexte/2010/2798/pdf/10261.MeyerhenkeHenning.Paper.2798.pdf status: public title: On Dynamic Graph Partitioning and Graph Clustering using Diffusion type: conference user_id: '15415' year: '2010' ... --- _id: '19018' author: - first_name: Michael full_name: Thies, Michael last_name: Thies - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler citation: ama: Thies M, Gehweiler J. Thread Migration and Checkpointing in Java.; 2010. apa: Thies, M., & Gehweiler, J. (2010). Thread Migration and Checkpointing in Java. bibtex: '@book{Thies_Gehweiler_2010, title={Thread Migration and Checkpointing in Java}, author={Thies, Michael and Gehweiler, Joachim}, year={2010} }' chicago: Thies, Michael, and Joachim Gehweiler. Thread Migration and Checkpointing in Java, 2010. ieee: M. Thies and J. Gehweiler, Thread Migration and Checkpointing in Java. 2010. mla: Thies, Michael, and Joachim Gehweiler. Thread Migration and Checkpointing in Java. 2010. short: M. Thies, J. Gehweiler, Thread Migration and Checkpointing in Java, 2010. date_created: 2020-09-04T10:54:43Z date_updated: 2022-01-06T06:53:57Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-09-04T10:54:26Z date_updated: 2020-09-04T10:54:26Z file_id: '19020' file_name: tr-ri-10-315.pdf file_size: 240725 relation: main_file success: 1 file_date_updated: 2020-09-04T10:54:26Z has_accepted_license: '1' language: - iso: eng status: public title: Thread Migration and Checkpointing in Java type: report user_id: '15415' year: '2010' ... --- _id: '19023' author: - first_name: Serge full_name: Kernbach, Serge last_name: Kernbach - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Jürgen full_name: Stradner, Jürgen last_name: Stradner - first_name: Florian full_name: Schlachter, Florian last_name: Schlachter - first_name: Christopher s. F. full_name: Schwarzer, Christopher s. F. last_name: Schwarzer - first_name: Alan F. T. full_name: Winfield, Alan F. T. last_name: Winfield - first_name: Rene full_name: Matthias, Rene last_name: Matthias citation: ama: 'Kernbach S, Schmickl T, Hamann H, et al. Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In: Artificial Life XII (ALife XII). MIT Press; 2010:781-788.' apa: Kernbach, S., Schmickl, T., Hamann, H., Stradner, J., Schlachter, F., Schwarzer, C. s. F., … Matthias, R. (2010). Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In Artificial Life XII (ALife XII) (pp. 781–788). MIT Press. bibtex: '@inproceedings{Kernbach_Schmickl_Hamann_Stradner_Schlachter_Schwarzer_Winfield_Matthias_2010, title={Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics}, booktitle={Artificial Life XII (ALife XII)}, publisher={MIT Press}, author={Kernbach, Serge and Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Schlachter, Florian and Schwarzer, Christopher s. F. and Winfield, Alan F. T. and Matthias, Rene}, year={2010}, pages={781–788} }' chicago: Kernbach, Serge, Thomas Schmickl, Heiko Hamann, Jürgen Stradner, Florian Schlachter, Christopher s. F. Schwarzer, Alan F. T. Winfield, and Rene Matthias. “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.” In Artificial Life XII (ALife XII), 781–88. MIT Press, 2010. ieee: S. Kernbach et al., “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics,” in Artificial Life XII (ALife XII), 2010, pp. 781–788. mla: Kernbach, Serge, et al. “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.” Artificial Life XII (ALife XII), MIT Press, 2010, pp. 781–88. short: 'S. Kernbach, T. Schmickl, H. Hamann, J. Stradner, F. Schlachter, C. s. F. Schwarzer, A.F.T. Winfield, R. Matthias, in: Artificial Life XII (ALife XII), MIT Press, 2010, pp. 781–788.' date_created: 2020-09-04T11:53:40Z date_updated: 2022-01-06T06:53:57Z department: - _id: '63' - _id: '238' language: - iso: eng page: 781-788 publication: Artificial Life XII (ALife XII) publication_status: published publisher: MIT Press status: public title: Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics type: conference user_id: '15415' year: '2010' ... --- _id: '19029' author: - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Parinya full_name: Chalermsook, Parinya last_name: Chalermsook - first_name: Sanjeev full_name: Khanna, Sanjeev last_name: Khanna - first_name: Bundit full_name: Laekhanukit, Bundit last_name: Laekhanukit - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: 'Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In: Workshop on Internet and Network Economics (WINE). ; 2010. doi:10.1007/978-3-642-17572-5_37' apa: Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., & Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In Workshop on Internet and Network Economics (WINE). https://doi.org/10.1007/978-3-642-17572-5_37 bibtex: '@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={10.1007/978-3-642-17572-5_37}, booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}, year={2010} }' chicago: Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” In Workshop on Internet and Network Economics (WINE), 2010. https://doi.org/10.1007/978-3-642-17572-5_37. ieee: P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in Workshop on Internet and Network Economics (WINE), 2010. mla: Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” Workshop on Internet and Network Economics (WINE), 2010, doi:10.1007/978-3-642-17572-5_37. short: 'P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in: Workshop on Internet and Network Economics (WINE), 2010.' date_created: 2020-09-04T12:01:18Z date_updated: 2022-01-06T06:53:57Z department: - _id: '63' doi: 10.1007/978-3-642-17572-5_37 language: - iso: eng publication: Workshop on Internet and Network Economics (WINE) publication_identifier: isbn: - '9783642175718' - '9783642175725' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing type: conference user_id: '15415' year: '2010' ... --- _id: '1903' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum. 2010;(5):468--474. doi:10.1007/s00287-010-0470-2 apa: Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2 bibtex: '@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen verteilter Speichersysteme}, DOI={10.1007/s00287-010-0470-2}, number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2010}, pages={468--474} }' chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5 (2010): 468--474. https://doi.org/10.1007/s00287-010-0470-2.' ieee: F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010. mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474, doi:10.1007/s00287-010-0470-2. short: F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474. date_created: 2018-03-28T07:21:50Z date_updated: 2022-01-06T06:53:57Z department: - _id: '79' - _id: '63' doi: 10.1007/s00287-010-0470-2 issue: '5' language: - iso: eng page: 468--474 publication: Informatik Spektrum status: public title: Algorithmische Grundlagen verteilter Speichersysteme type: journal_article user_id: '14955' year: '2010' ... --- _id: '19033' author: - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Shuchi full_name: Chawla, Shuchi last_name: Chawla - first_name: Robert full_name: Kleinberg, Robert last_name: Kleinberg - first_name: S. Matthew full_name: Weinberg, S. Matthew last_name: Weinberg citation: ama: 'Briest P, Chawla S, Kleinberg R, Weinberg SM. Pricing Randomized Allocations. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. ; 2010. doi:10.1137/1.9781611973075.49' apa: Briest, P., Chawla, S., Kleinberg, R., & Weinberg, S. M. (2010). Pricing Randomized Allocations. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. https://doi.org/10.1137/1.9781611973075.49 bibtex: '@inproceedings{Briest_Chawla_Kleinberg_Weinberg_2010, title={Pricing Randomized Allocations}, DOI={10.1137/1.9781611973075.49}, booktitle={Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert and Weinberg, S. Matthew}, year={2010} }' chicago: Briest, Patrick, Shuchi Chawla, Robert Kleinberg, and S. Matthew Weinberg. “Pricing Randomized Allocations.” In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010. https://doi.org/10.1137/1.9781611973075.49. ieee: P. Briest, S. Chawla, R. Kleinberg, and S. M. Weinberg, “Pricing Randomized Allocations,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010. mla: Briest, Patrick, et al. “Pricing Randomized Allocations.” Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010, doi:10.1137/1.9781611973075.49. short: 'P. Briest, S. Chawla, R. Kleinberg, S.M. Weinberg, in: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.' date_created: 2020-09-04T12:15:39Z date_updated: 2022-01-06T06:53:57Z department: - _id: '63' doi: 10.1137/1.9781611973075.49 language: - iso: eng publication: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: isbn: - '9780898717013' - '9781611973075' publication_status: published status: public title: Pricing Randomized Allocations type: conference user_id: '15415' year: '2010' ... --- _id: '19041' author: - first_name: Peter full_name: Mahlmann, Peter last_name: Mahlmann citation: ama: Mahlmann P. Peer-to-Peer Networks Based on Random Graphs. Vol 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010. apa: Mahlmann, P. (2010). Peer-to-peer networks based on random graphs (Vol. 283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Mahlmann_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-peer networks based on random graphs}, volume={283}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mahlmann, Peter}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Vol. 283. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. ieee: P. Mahlmann, Peer-to-peer networks based on random graphs, vol. 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. mla: Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. short: P. Mahlmann, Peer-to-Peer Networks Based on Random Graphs, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. date_created: 2020-09-04T14:05:30Z date_updated: 2022-01-06T06:53:57Z department: - _id: '63' - _id: '26' intvolume: ' 283' language: - iso: eng publication_identifier: isbn: - 978-3-942647-02-1 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100421015 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: Peer-to-peer networks based on random graphs type: dissertation user_id: '5786' volume: 283 year: '2010' ... --- _id: '19042' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener citation: ama: Degener B. Local, Distributed Approximation Algorithms for Geometric Assignment Problems. Vol 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010. apa: Degener, B. (2010). Local, distributed approximation algorithms for geometric assignment problems (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Degener_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local, distributed approximation algorithms for geometric assignment problems}, volume={278}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Degener, Bastian}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric Assignment Problems. Vol. 278. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. ieee: B. Degener, Local, distributed approximation algorithms for geometric assignment problems, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. mla: Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric Assignment Problems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. short: B. Degener, Local, Distributed Approximation Algorithms for Geometric Assignment Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010. date_created: 2020-09-04T14:08:57Z date_updated: 2022-01-06T06:53:57Z department: - _id: '63' - _id: '26' intvolume: ' 278' language: - iso: eng publication_identifier: isbn: - '978-3-939350-97-2 ' publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100429011 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: Local, distributed approximation algorithms for geometric assignment problems type: dissertation user_id: '5786' volume: 278 year: '2010' ... --- _id: '18136' abstract: - lang: eng text: We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality. 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: Tim full_name: Suess, Tim last_name: Suess citation: ama: 'Fischer M, Jähn C, Suess T. Asynchronous Parallel Reliefboard Computation for Scene Object Approximation. In: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV). The Eurographics Association; 2010:43-51. doi:10.2312/EGPGV/EGPGV10/043-051' apa: Fischer, M., Jähn, C., & Suess, T. (2010). Asynchronous Parallel Reliefboard Computation for Scene Object Approximation. Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), 43–51. https://doi.org/10.2312/EGPGV/EGPGV10/043-051 bibtex: '@inproceedings{Fischer_Jähn_Suess_2010, title={Asynchronous Parallel Reliefboard Computation for Scene Object Approximation}, DOI={10.2312/EGPGV/EGPGV10/043-051}, booktitle={Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)}, publisher={The Eurographics Association}, author={Fischer, Matthias and Jähn, Claudius and Suess, Tim}, year={2010}, pages={43–51} }' chicago: Fischer, Matthias, Claudius Jähn, and Tim Suess. “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation.” In Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), 43–51. The Eurographics Association, 2010. https://doi.org/10.2312/EGPGV/EGPGV10/043-051. ieee: 'M. Fischer, C. Jähn, and T. Suess, “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation,” in Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), 2010, pp. 43–51, doi: 10.2312/EGPGV/EGPGV10/043-051.' mla: Fischer, Matthias, et al. “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation.” Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51, doi:10.2312/EGPGV/EGPGV10/043-051. short: 'M. Fischer, C. Jähn, T. Suess, in: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51.' date_created: 2020-08-24T07:07:55Z date_updated: 2022-01-06T06:53:26Z department: - _id: '63' doi: 10.2312/EGPGV/EGPGV10/043-051 language: - iso: eng page: 43-51 publication: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV) publisher: The Eurographics Association status: public title: Asynchronous Parallel Reliefboard Computation for Scene Object Approximation type: conference user_id: '15415' year: '2010' ... --- _id: '18289' abstract: - lang: eng text: Many professional cluster systems consist of nodes with different hardware configurations. Such heterogeneous environments require different load-balancing techniques than homogenous environments. The c-load-collision-protocol is able to achieve good results for data-management purposes. Using this protocol, we propose a way for load-balancing in interactive rendering environments. For this work, we implemented a parallel rendering system and took different picking strategies into account to compare the results. The advantage of our approach compared to other approaches is that we group the available nodes of a cluster into two different categories, based on the hardware abilities. Some nodes are used solely for rendering, while others serve as secondary storage and to assist the former ones by performing auxiliary calculations. author: - first_name: Tim full_name: Suess, Tim last_name: Suess - first_name: Timo full_name: Wiesemann, Timo last_name: Wiesemann - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: 'Suess T, Wiesemann T, Fischer M. Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. In: 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage. ; 2010:448-456. doi:10.1109/nas.2010.52' apa: Suess, T., Wiesemann, T., & Fischer, M. (2010). Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 448–456. https://doi.org/10.1109/nas.2010.52 bibtex: '@inproceedings{Suess_Wiesemann_Fischer_2010, title={Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments}, DOI={10.1109/nas.2010.52}, booktitle={2010 IEEE Fifth International Conference on Networking, Architecture, and Storage}, author={Suess, Tim and Wiesemann, Timo and Fischer, Matthias}, year={2010}, pages={448–456} }' chicago: Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Evaluation of a C-Load-Collision-Protocol for Load-Balancing in Interactive Environments.” In 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 448–56, 2010. https://doi.org/10.1109/nas.2010.52. ieee: 'T. Suess, T. Wiesemann, and M. Fischer, “Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments,” in 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 2010, pp. 448–456, doi: 10.1109/nas.2010.52.' mla: Suess, Tim, et al. “Evaluation of a C-Load-Collision-Protocol for Load-Balancing in Interactive Environments.” 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 2010, pp. 448–56, doi:10.1109/nas.2010.52. short: 'T. Suess, T. Wiesemann, M. Fischer, in: 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 2010, pp. 448–456.' date_created: 2020-08-25T14:04:38Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1109/nas.2010.52 language: - iso: eng page: 448 - 456 publication: 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage publication_identifier: isbn: - '9781424481330' publication_status: published status: public title: Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments type: conference user_id: '15415' year: '2010' ...