[{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"citation":{"chicago":"Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Vol. 298. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","apa":"Gehweiler, J. (2011). Peer-to-Peer Based Parallel Web Computing (Vol. 298). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Gehweiler J. Peer-to-Peer Based Parallel Web Computing. Vol 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","mla":"Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","bibtex":"@book{Gehweiler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-Peer Based Parallel Web Computing}, volume={298}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Gehweiler, Joachim}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, vol. 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"year":"2011","type":"dissertation","intvolume":" 298","_id":"18976","date_updated":"2022-01-06T06:53:56Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"}],"department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-09-04T07:46:32Z","volume":298,"publication_identifier":{"isbn":["978-3-942647-17-5"]},"abstract":[{"text":"Web computing is a variant of parallel computing where the idle times of PCs\r\ndonated by worldwide distributed users are employed to execute parallel\r\nprograms. In this thesis we consider a web computing variant with two\r\nimportant properties: First, we support the execution of coupled, massively\r\nparallel algorithms (rather than distributed data processing). And second,\r\nwe organize the system in peer-to-peer fashion.\r\n\r\nWe present the Paderborn University BSP-based Web Computing (PUB-Web) library,\r\nwhich supports the execution of parallel programs in the bulk-synchronous style\r\n(BSP) in such a web computing setting. In this thesis, we focus on important\r\ntechnical and algorithmic aspects, in particular: In order to schedule\r\nprocesses with respect to the currently available computing power, which\r\ncontinually changes in an unpredictable fashion, we need intelligent load\r\nbalancing algorithms and -- as a basic precondition -- the technical ability\r\nto migrate threads at runtime.\r\n\r\nTo achieve the latter in a way suitable for production use, compatible with\r\nrecent Java versions, available for all important platforms, and easy-to-use\r\nfor developers, we develop the PadMig thread migration and checkpointing\r\nlibrary.\r\n\r\nIn order to tackle the distributed load balancing problem, we present an\r\nalgorithm based on Distributed Heterogeneous Hash-Tables. In order to judge\r\nthe quality of the schedules produced, we perform extensive experiments to\r\ncompare several variants of the DHHT-based load balancer with the well-\r\nestablished Work Stealing algorithm, using realistic input data obtained by\r\nprofiling the utilization of several hundred PCs for a period of several\r\nmonths.\r\n\r\nBeside the available computing power, we finally also consider the network\r\nbandwidth as a secondary criterion for load balancing. For this purpose, we\r\ncluster the PUB-Web network according to bandwidth, employing a novel,\r\nfault-tolerant, adaptive, and scaling distributed clustering algorithm called\r\nDiDiC. In order to judge the quality of the clusterings produces by DiDiC,\r\nwe experimentally compare it to the well-established MCL algorithm using a\r\nsimulator.","lang":"eng"}],"user_id":"5786","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466:2-186"}]},"title":"Peer-to-Peer Based Parallel Web Computing"},{"doi":"10.1145/1989493.1989518","date_updated":"2022-01-06T06:53:57Z","_id":"19026","language":[{"iso":"eng"}],"citation":{"chicago":"Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011. https://doi.org/10.1145/1989493.1989518.","apa":"Briest, P., & Raupach, C. (2011). The car sharing problem. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989518","ama":"Briest P, Raupach C. The car sharing problem. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989518","mla":"Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989518.","bibtex":"@inproceedings{Briest_Raupach_2011, title={The car sharing problem}, DOI={10.1145/1989493.1989518}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Briest, Patrick and Raupach, Christoph}, year={2011} }","short":"P. Briest, C. Raupach, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","ieee":"P. Briest and C. Raupach, “The car sharing problem,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011."},"type":"conference","year":"2011","user_id":"15415","title":"The car sharing problem","date_created":"2020-09-04T11:58:54Z","status":"public","publication_identifier":{"isbn":["9781450307437"]},"publication_status":"published","publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","department":[{"_id":"63"}],"author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"},{"first_name":"Christoph","full_name":"Raupach, Christoph","last_name":"Raupach"}]},{"status":"public","date_created":"2020-09-04T13:31:29Z","author":[{"full_name":"Effert, Sascha","first_name":"Sascha","last_name":"Effert"}],"department":[{"_id":"63"}],"user_id":"15415","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-385","relation":"confirmation"}]},"title":"Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen","place":"Universität Paderborn","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"type":"dissertation","year":"2011","citation":{"chicago":"Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. Universität Paderborn, 2011.","apa":"Effert, S. (2011). Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn.","ama":"Effert S. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. Universität Paderborn; 2011.","bibtex":"@book{Effert_2011, place={Universität Paderborn}, title={Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen}, author={Effert, Sascha}, year={2011} }","mla":"Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. 2011.","short":"S. Effert, Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen, Universität Paderborn, 2011.","ieee":"S. Effert, Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn, 2011."},"date_updated":"2022-01-06T06:53:57Z","_id":"19040"},{"user_id":"15415","title":"Approximation Techniques for Utilitarian Mechanism Design","abstract":[{"lang":"eng","text":"This paper deals with the design of efficiently computable incentive-compatible mechanisms for combinatorial optimization problems with single-minded agents each possibly having multiple private parameters. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonicity properties to ensure truthfulness. Since most of the known approximation techniques do not fulfill these properties, we study alternative techniques. Our first contribution is a quite general method to transform a pseudopolynomial algorithm into a monotone fully polynomial time approximation scheme (FPTAS). This can be applied to various problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for single-minded multiunit auctions. The best previous result for such auctions was a 2-appro-xi-ma-tion. In addition, we present a monotone PTAS for the generalized assignment problem with any constant number of private parameters per agent. The most efficient way to solve packing integer programs (PIPs) is linear programming–based randomized rounding, which also is in general not monotone. We show that primal-dual greedy algorithms achieve almost the same approximation ratios for PIPs as randomized rounding. The advantage is that these algorithms are inherently monotone. This way, we can significantly improve the approximation ratios of truthful mechanisms for various fundamental mechanism design problems like single-minded combinatorial auctions (CAs), unsplittable flow routing, and multicast routing. Our primal-dual approximation algorithms can also be used for the winner determination in CAs with general bidders specifying their bids through an oracle.\r\n"}],"date_created":"2021-09-03T10:41:04Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"department":[{"_id":"63"}],"publication":"SIAM Journal on Computing","author":[{"last_name":"Briest","full_name":"Briest, Patrick","first_name":"Patrick"},{"first_name":"Piotr","full_name":"Krysta, Piotr","last_name":"Krysta"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"doi":"10.1137/090772988","date_updated":"2022-01-06T06:55:59Z","_id":"23739","language":[{"iso":"eng"}],"page":"1587-1622","citation":{"chicago":"Briest, Patrick, Piotr Krysta, and Berthold Vöcking. “Approximation Techniques for Utilitarian Mechanism Design.” SIAM Journal on Computing, 2011, 1587–1622. https://doi.org/10.1137/090772988.","apa":"Briest, P., Krysta, P., & Vöcking, B. (2011). Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing, 1587–1622. https://doi.org/10.1137/090772988","ama":"Briest P, Krysta P, Vöcking B. Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing. 2011:1587-1622. doi:10.1137/090772988","bibtex":"@article{Briest_Krysta_Vöcking_2011, title={Approximation Techniques for Utilitarian Mechanism Design}, DOI={10.1137/090772988}, journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr and Vöcking, Berthold}, year={2011}, pages={1587–1622} }","mla":"Briest, Patrick, et al. “Approximation Techniques for Utilitarian Mechanism Design.” SIAM Journal on Computing, 2011, pp. 1587–622, doi:10.1137/090772988.","short":"P. Briest, P. Krysta, B. Vöcking, SIAM Journal on Computing (2011) 1587–1622.","ieee":"P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011."},"year":"2011","type":"journal_article"},{"title":"Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems","user_id":"15415","abstract":[{"lang":"eng","text":"We investigate nonparametric multiproduct pricing problems, in which we want to find revenue maximizing prices for products $\\mathcal{P}$ based on a set of customer samples $\\mathcal{C}$. We mostly focus on the unit-demand case, in which products constitute strict substitutes and each customer aims to purchase a single product. In this setting a customer sample consists of a number of nonzero values for different products and possibly an additional product ranking. Once prices are fixed, each customer chooses to buy one of the products she can afford based on some predefined selection rule. We distinguish between the min-buying, max-buying, and rank-buying models. Some of our results also extend to single-minded pricing, in which case products are strict complements and every customer seeks to buy a single set of products, which she purchases if the sum of prices is below her valuation for that set. For the min-buying model we show that the revenue maximization problem is not approximable within factor $\\mathcal{O}(\\log^{\\varepsilon}|\\mathcal{C}|)$ for some constant $\\varepsilon>0$, unless $\\mathrm{NP}\\subseteq\\mathrm{DTIME}(n^{\\mathcal{O}(\\log\\log n)})$, thereby almost closing the gap between the known algorithmic results and previous lower bounds. We also prove inapproximability within $\\mathcal{O}(\\ell^{\\varepsilon})$, $\\ell$ being an upper bound on the number of nonzero values per customer, and $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ under slightly stronger assumptions and provide matching upper bounds. Surprisingly, these hardness results hold even if a price ladder constraint, i.e., a predefined order on the prices of all products, is given. Without the price ladder constraint we obtain similar hardness results for the special case of uniform valuations, i.e., the case that every customer has identical values for all the products she is interested in, assuming specific hardness of the balanced bipartite independent set problem in constant degree graphs or hardness of refuting random 3CNF formulas. Introducing a slightly more general problem definition in which customers are given as an explicit probability distribution, we obtain inapproximability within $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ assuming $\\mathrm{NP}\\nsubseteq\\bigcap_{\\delta>0}\\mathrm{BPTIME}(2^{\\mathcal{O}(n^{\\delta})})$. These results apply to single-minded pricing as well. For the max-buying model a polynomial-time approximation scheme exists if a price ladder is given. We give a matching lower bound by proving strong NP-hardness. Assuming limited product supply, we analyze a generic local search algorithm and prove that it is 2-approximate. Finally, we discuss implications for the rank-buying model.\r\n"}],"publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"status":"public","date_created":"2021-09-03T10:48:52Z","author":[{"first_name":"Patrick","full_name":"Briest, Patrick","last_name":"Briest"},{"last_name":"Krysta","full_name":"Krysta, Piotr","first_name":"Piotr"}],"department":[{"_id":"63"}],"publication":"SIAM Journal on Computing","doi":"10.1137/090752353","date_updated":"2022-01-06T06:55:59Z","_id":"23740","type":"journal_article","citation":{"ama":"Briest P, Krysta P. Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing. 2011:1554-1586. doi:10.1137/090752353","apa":"Briest, P., & Krysta, P. (2011). Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing, 1554–1586. https://doi.org/10.1137/090752353","chicago":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, 1554–86. https://doi.org/10.1137/090752353.","mla":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, pp. 1554–86, doi:10.1137/090752353.","bibtex":"@article{Briest_Krysta_2011, title={Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems}, DOI={10.1137/090752353}, journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr}, year={2011}, pages={1554–1586} }","short":"P. Briest, P. Krysta, SIAM Journal on Computing (2011) 1554–1586.","ieee":"P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems,” SIAM Journal on Computing, pp. 1554–1586, 2011."},"year":"2011","page":"1554-1586","language":[{"iso":"eng"}]},{"doi":"10.1007/978-3-642-18381-2_15","_id":"20709","date_updated":"2022-01-06T06:54:33Z","year":"2011","type":"book_chapter","citation":{"mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={Collisionless Gathering of Robots with an Extent}, DOI={10.1007/978-3-642-18381-2_15}, booktitle={SOFSEM 2011: Theory and Practice of Computer Science}, 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 auf der Heide, Friedhelm Meyer and et al.}, year={2011} }","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 SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-18381-2_15.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg; 2011. 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 SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg. 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 SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011.","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F.M. auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011."},"language":[{"iso":"eng"}],"title":"Collisionless Gathering of Robots with an Extent","user_id":"3902","place":"Berlin, Heidelberg","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]},"publication_status":"published","status":"public","date_created":"2020-12-12T11:15:30Z","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer"},{"full_name":"Hüllmann, Martina","first_name":"Martina","last_name":"Hüllmann"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"last_name":"Klaas","first_name":"Alexander","full_name":"Klaas, Alexander"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"first_name":"Marcus","full_name":"Märtens, Marcus","last_name":"Märtens"},{"last_name":"auf der Heide","first_name":"Friedhelm Meyer","full_name":"auf der Heide, Friedhelm Meyer"},{"last_name":"Raupach","first_name":"Christoph","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"},{"id":"3902","last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"},{"first_name":"Christoph","full_name":"Weddemann, Christoph","last_name":"Weddemann"},{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"}],"publication":"SOFSEM 2011: Theory and Practice of Computer Science","department":[{"_id":"63"}]},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642220111","9783642220128"]},"date_created":"2020-12-12T12:22:41Z","status":"public","department":[{"_id":"63"}],"publication":"Automata, Languages and Programming","author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"first_name":"Martina","full_name":"Hüllmann, Martina","last_name":"Hüllmann"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"full_name":"Klaas, Alexander","first_name":"Alexander","last_name":"Klaas"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"last_name":"Kurras","first_name":"Sven","full_name":"Kurras, Sven"},{"full_name":"Märtens, Marcus","first_name":"Marcus","last_name":"Märtens"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Christoph","full_name":"Raupach, Christoph","last_name":"Raupach"},{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"},{"id":"3902","last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"},{"full_name":"Weddemann, Christoph","first_name":"Christoph","last_name":"Weddemann"},{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"}],"title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","user_id":"3902","place":"Berlin, Heidelberg","year":"2011","type":"book_chapter","citation":{"ieee":"A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.","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.","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.","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.","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","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"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-22012-8_52","_id":"20710","date_updated":"2022-01-06T06:54:33Z"},{"date_created":"2020-08-24T14:01:49Z","status":"public","department":[{"_id":"63"}],"publication":"Proceedings of The 25th European Simulation and Modelling Conference - ESM2011","author":[{"last_name":"Renken","first_name":"Hendrik","full_name":"Renken, Hendrik"},{"first_name":"Christoph","full_name":"Laroque, Christoph","last_name":"Laroque"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"}],"user_id":"15415","title":"An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization","language":[{"iso":"eng"}],"year":"2011","type":"conference","citation":{"ieee":"H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization,” in Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.","short":"H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.","mla":"Renken, Hendrik, et al. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.","bibtex":"@inproceedings{Renken_Laroque_Fischer_2011, title={An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization}, booktitle={Proceedings of The 25th European Simulation and Modelling Conference - ESM2011}, author={Renken, Hendrik and Laroque, Christoph and Fischer, Matthias}, year={2011} }","ama":"Renken H, Laroque C, Fischer M. An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In: Proceedings of The 25th European Simulation and Modelling Conference - ESM2011. ; 2011.","apa":"Renken, H., Laroque, C., & Fischer, M. (2011). An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In Proceedings of The 25th European Simulation and Modelling Conference - ESM2011.","chicago":"Renken, Hendrik, Christoph Laroque, and Matthias Fischer. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” In Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011."},"_id":"18193","date_updated":"2022-01-06T06:53:26Z"},{"status":"public","has_accepted_license":"1","date_created":"2020-08-24T14:14:10Z","file":[{"access_level":"closed","date_created":"2020-08-24T14:13:46Z","file_name":"pre-03-2011-5220.pdf","content_type":"application/pdf","date_updated":"2020-08-24T14:13:46Z","success":1,"relation":"main_file","file_size":3091853,"creator":"koala","file_id":"18195"}],"author":[{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"},{"first_name":"Clemens","full_name":"Koch, Clemens","last_name":"Koch"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"file_date_updated":"2020-08-24T14:13:46Z","department":[{"_id":"63"}],"user_id":"15415","title":"Parallel Out-of-Core Occlusion Culling","ddc":["000"],"abstract":[{"text":"We present a parallel rendering system for PC-Clusters to visualize large 3D scenes. One single visualization node, equipped with a high-end graphics adapter, is supported by a group of backend nodes with weak graphics performance. The objects of the scene are distributed among these backend nodes, they serve two purposes: First, they provide an out-of-core memory system for the visualization node. Second, they assist the visualization node's rendering by performing visibility calculations and only sending visible objects to the visualization node. In order to obtain fast rendering with our system, we have to distribute the objects among the backend nodes in a way that does not only guarantee an even distribution of the objects, but also an even distribution of the visibility calculations and the amount of data send to the visualization node. We identify necessary properties of the distribution and argue that a random distribution is a good candidate. Further, in order to reduce the number of objects sent to the visualization node per frame, we employ an approximate hierarchical occlusion culling in each backend node. For this, they are equipped, in addition to the objects assigned to them, with simplified versions of the other objects of the 3D scene. The visualization node is equipped with 512 MiB video memory and supported by 15 backend nodes. This system is able to render a approx. 350 million polygons (approx. 8.5 GiB) large aircraft model between 20 - 30 fps and thus allows a walkthrough in real-time.","lang":"eng"}],"language":[{"iso":"eng"}],"citation":{"apa":"Suess, T., Koch, C., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2011). Parallel Out-of-Core Occlusion Culling.","ama":"Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Parallel Out-of-Core Occlusion Culling. Published online 2011.","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Parallel Out-of-Core Occlusion Culling,” 2011.","bibtex":"@article{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2011, title={Parallel Out-of-Core Occlusion Culling}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2011} }","mla":"Suess, Tim, et al. Parallel Out-of-Core Occlusion Culling. 2011.","short":"T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, (2011).","ieee":"T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel Out-of-Core Occlusion Culling.” 2011."},"type":"preprint","year":"2011","_id":"18194","date_updated":"2022-01-06T06:53:27Z"},{"type":"conference","citation":{"short":"B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, M. Polukarov, in: {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239.","ieee":"B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, and M. Polukarov, “Considerate Equilibrium,” in {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239.","chicago":"Vöcking, Berthold, Martin Hoefer, Alexander Skopalik, Michal Penn, and Maria Polukarov. “Considerate Equilibrium.” In {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 234--239, 2011.","ama":"Vöcking B, Hoefer M, Skopalik A, Penn M, Polukarov M. Considerate Equilibrium. In: {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,. ; 2011:234--239.","apa":"Vöcking, B., Hoefer, M., Skopalik, A., Penn, M., & Polukarov, M. (2011). Considerate Equilibrium. In {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, (pp. 234--239).","mla":"Vöcking, Berthold, et al. “Considerate Equilibrium.” {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239.","bibtex":"@inproceedings{Vöcking_Hoefer_Skopalik_Penn_Polukarov_2011, title={Considerate Equilibrium}, booktitle={{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,}, author={Vöcking, Berthold and Hoefer, Martin and Skopalik, Alexander and Penn, Michal and Polukarov, Maria}, year={2011}, pages={234--239} }"},"year":"2011","page":"234--239","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:40Z","_id":"18568","author":[{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"},{"last_name":"Hoefer","first_name":"Martin","full_name":"Hoefer, Martin"},{"first_name":"Alexander ","full_name":"Skopalik, Alexander ","last_name":"Skopalik"},{"last_name":"Penn","first_name":"Michal","full_name":"Penn, Michal"},{"full_name":"Polukarov, Maria","first_name":"Maria","last_name":"Polukarov"}],"publication":"{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,","department":[{"_id":"63"}],"status":"public","date_created":"2020-08-28T12:23:42Z","title":"Considerate Equilibrium","user_id":"15415","related_material":{"link":[{"relation":"confirmation","url":"http://ijcai.org/papers11/Papers/IJCAI11-050.pdf"}]}},{"author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastan","first_name":"Sebastan"},{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara ","first_name":"Barbara "},{"full_name":"Pietrzyk, Peter","first_name":"Peter","last_name":"Pietrzyk"}],"file_date_updated":"2018-03-14T13:48:21Z","publication":"Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-14T13:48:21Z","file_id":"1219","creator":"florida","file_size":454740,"access_level":"closed","date_created":"2018-03-14T13:48:21Z","file_name":"657-flp_algosensors2011-Cord-Landwehr.pdf"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:43:00Z","abstract":[{"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.","lang":"eng"}],"ddc":["040"],"user_id":"477","type":"conference","citation":{"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} }","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.","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","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","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.","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."},"year":"2011","page":"13-27","_id":"657","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:12Z","doi":"10.1007/978-3-642-28209-6_3"},{"department":[{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"}],"date_created":"2017-10-17T12:43:01Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","user_id":"477","title":"Complexity Classes for Local Computation","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"mla":"Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011.","bibtex":"@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }","ama":"Swierkot K. Complexity Classes for Local Computation. Universität Paderborn; 2011.","apa":"Swierkot, K. (2011). Complexity Classes for Local Computation. Universität Paderborn.","chicago":"Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011.","ieee":"K. Swierkot, Complexity Classes for Local Computation. Universität Paderborn, 2011.","short":"K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011."},"year":"2011","type":"mastersthesis","_id":"663","date_updated":"2022-01-06T07:03:13Z"},{"page":"31--40","type":"conference","citation":{"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.","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} }","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","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.","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."},"year":"2011","_id":"664","file":[{"file_id":"1216","creator":"florida","file_size":333335,"relation":"main_file","success":1,"date_updated":"2018-03-14T13:45:57Z","content_type":"application/pdf","file_name":"664-PPAM11GKM_01.pdf","date_created":"2018-03-14T13:45:57Z","access_level":"closed"}],"publication":"Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)","file_date_updated":"2018-03-14T13:45:57Z","author":[{"last_name":"Gehweiler","full_name":"Gehweiler, Joachim","first_name":"Joachim"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2017-10-17T12:43:01Z","status":"public","has_accepted_license":"1","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."}],"user_id":"15504","ddc":["040"],"series_title":"LNCS","date_updated":"2022-01-06T07:03:14Z","doi":"10.1007/978-3-642-31500-8_4","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment"},{"year":"2011","citation":{"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","ama":"Meyer auf der Heide F, Rajaraman R, eds. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures.; 2011. doi:10.1145/1989493","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.","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} }","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.","ieee":"F. Meyer auf der Heide and R. Rajaraman, Eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011."},"type":"conference_editor","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:14Z","_id":"667","doi":"10.1145/1989493","department":[{"_id":"63"}],"editor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Rajaraman","first_name":"Rajmohan ","full_name":"Rajaraman, Rajmohan "}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:43:02Z","title":"23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures","user_id":"477"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]},"department":[{"_id":"63"}],"title":"Collisionless Gathering of Robots with an Extent","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-18381-2_15","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-06T07:52:42Z","status":"public","publication":"37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)","publisher":"Springer","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"last_name":"Hüllmann","first_name":"Martina","full_name":"Hüllmann, Martina"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Klaas, Alexander","first_name":"Alexander","last_name":"Klaas"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"last_name":"Kurras","first_name":"Sven","full_name":"Kurras, Sven"},{"last_name":"Märtens","full_name":"Märtens, Marcus","first_name":"Marcus"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"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"},{"last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"},{"full_name":"Weddemann, Christoph","first_name":"Christoph","last_name":"Weddemann"},{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"}],"user_id":"15415","abstract":[{"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.","lang":"eng"}],"page":"178-189","year":"2011","citation":{"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.","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.","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","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.","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."},"type":"conference","issue":"6543","_id":"16410"},{"language":[{"iso":"eng"}],"page":"367-374","type":"book_chapter","year":"2011","citation":{"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.","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} }","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","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.","short":"J. Gehweiler, F. Meyer auf der Heide, in: Algorithms Unplugged, Berlin, Heidelberg, 2011, pp. 367–374."},"_id":"16412","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/978-3-642-15328-0_38","publication":"Algorithms Unplugged","department":[{"_id":"63"}],"author":[{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-06T10:10:39Z","status":"public","publication_identifier":{"isbn":["9783642153273","9783642153280"]},"publication_status":"published","place":"Berlin, Heidelberg","user_id":"15415","title":"Bin Packing - How Do I Get My Stuff into the Boxes"},{"language":[{"iso":"eng"}],"type":"conference","citation":{"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.","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.","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","ieee":"R. Rajaraman and F. Meyer auf der Heide, “Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11,” 2011.","short":"R. Rajaraman, F. Meyer auf der Heide, in: 2011."},"year":"2011","doi":"10.1145/1989493","_id":"16428","date_updated":"2022-01-06T06:52:50Z","status":"public","date_created":"2020-04-06T13:48:10Z","publication_identifier":{"isbn":["9781450307437"]},"publication_status":"published","author":[{"last_name":"Rajaraman","full_name":"Rajaraman, Rajmohan","first_name":"Rajmohan"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"user_id":"15415","title":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11"},{"department":[{"_id":"63"}],"publication":"Computer Science Review","author":[{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"last_name":"Fekete","full_name":"Fekete, Sándor P.","first_name":"Sándor P."},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publication_identifier":{"issn":["1574-0137"]},"publication_status":"published","date_created":"2020-04-07T06:46:06Z","status":"public","title":"A survey on relay placement with runtime and approximation guarantees","user_id":"15415","page":"57-68","type":"journal_article","citation":{"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.","short":"B. Degener, S.P. Fekete, B. Kempkes, F. Meyer auf der Heide, Computer Science Review (2011) 57–68.","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.","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} }","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","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."},"year":"2011","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","_id":"16447","doi":"10.1016/j.cosrev.2010.09.005"},{"page":"138-149","citation":{"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} }","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.","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.","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","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.","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."},"type":"conference","year":"2011","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","_id":"16451","doi":"10.1016/j.tcs.2012.10.056","department":[{"_id":"63"}],"publication":"SIROCCO '11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity","author":[{"first_name":"Philipp","full_name":"Brandes, Philipp","last_name":"Brandes"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publication_status":"published","date_created":"2020-04-07T12:12:23Z","status":"public","title":"Energy-efficient strategies for building short chains of mobile robots locally","user_id":"15415"},{"status":"public","date_created":"2020-04-07T12:31:24Z","publication_identifier":{"isbn":["9781450307437"]},"publication_status":"published","author":[{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"last_name":"Langner","first_name":"Tobias","full_name":"Langner, Tobias"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Pietrzyk","full_name":"Pietrzyk, Peter","first_name":"Peter"},{"last_name":"Wattenhofer","first_name":"Roger","full_name":"Wattenhofer, Roger"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","user_id":"15415","title":"A tight runtime bound for synchronous gathering of autonomous robots with limited visibility","language":[{"iso":"eng"}],"type":"conference","year":"2011","citation":{"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.","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","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.","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} }","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.","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."},"doi":"10.1145/1989493.1989515","_id":"16453","date_updated":"2022-01-06T06:52:50Z"},{"language":[{"iso":"eng"}],"year":"2011","citation":{"short":"P. Kling, F. Meyer auf der Heide, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","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.","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.","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} }","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."},"type":"conference","doi":"10.1145/1989493.1989517","date_updated":"2022-01-06T06:52:50Z","_id":"16454","date_created":"2020-04-07T12:33:00Z","status":"public","publication_identifier":{"isbn":["9781450307437"]},"publication_status":"published","publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","department":[{"_id":"63"}],"author":[{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"user_id":"15415","title":"Convergence of local communication chain strategies via linear transformations"},{"doi":"10.1016/j.procs.2011.09.049","date_updated":"2022-01-06T06:52:50Z","_id":"16455","language":[{"iso":"eng"}],"page":"153-155","type":"journal_article","citation":{"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.","short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, Procedia Computer Science (2011) 153–155.","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} }","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.","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","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","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."},"year":"2011","user_id":"15415","title":"Building Simple Formations in Large Societies of Tiny Mobile Robots","date_created":"2020-04-07T12:35:11Z","status":"public","publication_identifier":{"issn":["1877-0509"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"Procedia Computer Science","author":[{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}]},{"author":[{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publication":"Organic Computing — A Paradigm Shift for Complex Systems","department":[{"_id":"63"}],"publication_identifier":{"isbn":["9783034801294","9783034801300"]},"publication_status":"published","status":"public","date_created":"2020-04-07T12:36:17Z","place":"Basel","title":"Energy-Awareness in Self-organising Robotic Exploration Teams","user_id":"15415","type":"book_chapter","citation":{"short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011.","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.","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.","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","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.","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} }"},"year":"2011","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","_id":"16456","doi":"10.1007/978-3-0348-0130-0_35"},{"title":"Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally","user_id":"15415","place":"Berlin, Heidelberg","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642222115","9783642222122"]},"publication_status":"published","date_created":"2020-04-08T06:52:53Z","status":"public","department":[{"_id":"63"}],"publication":"Structural Information and Communication Complexity","author":[{"last_name":"Brandes","first_name":"Philipp","full_name":"Brandes, Philipp"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"doi":"10.1007/978-3-642-22212-2_13","_id":"16459","date_updated":"2022-01-06T06:52:50Z","type":"book_chapter","year":"2011","citation":{"short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.","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.","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.","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} }","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."},"language":[{"iso":"eng"}]},{"_id":"17009","date_updated":"2022-01-06T06:53:01Z","doi":"10.1142/s0219265911002885","page":"vii-viii","type":"journal_article","citation":{"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.","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.","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","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","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.","mla":"Hsu, D. Frank, et al. “EDITORIAL.” Journal of Interconnection Networks, 2011, pp. vii–viii, doi: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} }"},"year":"2011","language":[{"iso":"eng"}],"title":"EDITORIAL","user_id":"15415","publication":"Journal of Interconnection Networks","department":[{"_id":"63"}],"author":[{"full_name":"Hsu, D. Frank","first_name":"D. Frank","last_name":"Hsu"},{"last_name":"Magga","full_name":"Magga, Bruce M.","first_name":"Bruce M."},{"first_name":"Howard C. T.","full_name":"Ho, Howard C. T.","last_name":"Ho"},{"full_name":"Hromkovic, Juraj","first_name":"Juraj","last_name":"Hromkovic"},{"last_name":"Lau","full_name":"Lau, Francis C. M.","first_name":"Francis C. M."},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication_identifier":{"issn":["0219-2659","1793-6713"]},"publication_status":"published","date_created":"2020-05-18T13:35:10Z","status":"public"},{"citation":{"ieee":"A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.","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.","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} }","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.","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","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","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."},"year":"2011","type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-22012-8_52","_id":"16409","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","publication_identifier":{"isbn":["9783642220111","9783642220128"],"issn":["0302-9743","1611-3349"]},"date_created":"2020-04-06T07:47:55Z","status":"public","publication":"Automata, Languages and Programming","department":[{"_id":"63"}],"author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"first_name":"Martina","full_name":"Hüllmann, Martina","last_name":"Hüllmann"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"full_name":"Klaas, Alexander","first_name":"Alexander","last_name":"Klaas"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"last_name":"Märtens","first_name":"Marcus","full_name":"Märtens, Marcus"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Raupach","first_name":"Christoph","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"},{"full_name":"Warner, Daniel","first_name":"Daniel","last_name":"Warner"},{"full_name":"Weddemann, Christoph","first_name":"Christoph","last_name":"Weddemann"},{"first_name":"Daniel","full_name":"Wonisch, Daniel","last_name":"Wonisch"}],"title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","user_id":"15415","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"}],"place":"Berlin, Heidelberg"},{"intvolume":" 6534","_id":"19678","date_updated":"2022-01-06T06:54:09Z","doi":"10.1007/978-3-642-18318-8_5","series_title":"Lecture Notes in Computer Science","type":"conference","year":"2010","citation":{"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","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","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.","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.","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} }","short":"P. Briest, H. Röglin, in: Workshop on Approximation and Online Algorithms (WAOA), Springer, 2010.","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."},"language":[{"iso":"eng"}],"title":"The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers","user_id":"15415","publisher":"Springer","author":[{"last_name":"Briest","full_name":"Briest, Patrick","first_name":"Patrick"},{"first_name":"Heiko","full_name":"Röglin, Heiko","last_name":"Röglin"}],"publication":"Workshop on Approximation and Online Algorithms (WAOA)","department":[{"_id":"63"}],"volume":6534,"status":"public","date_created":"2020-09-24T14:13:19Z"},{"title":"A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ","user_id":"15415","department":[{"_id":"63"}],"publication":"International Parallel & Distributed Processing Symposium (IPDPS)","author":[{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"last_name":"Pietrzyk","full_name":"Pietrzyk, Peter","first_name":"Peter"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"}],"date_created":"2020-09-28T08:25:37Z","status":"public","_id":"19711","date_updated":"2022-01-06T06:54:10Z","doi":"10.1109/IPDPS.2010.5470349","year":"2010","type":"conference","citation":{"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","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","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.","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} }","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.","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."},"language":[{"iso":"eng"}]},{"doi":"10.1007/978-3-642-05118-0_43","date_updated":"2022-01-06T06:54:12Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642051173","9783642051180"]},"publication_status":"published","department":[{"_id":"63"}],"intvolume":" 5873","_id":"19796","page":"624--639","type":"conference","year":"2010","citation":{"short":"M. Mense, C. Schindelhauer, in: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, pp. 624--639.","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.","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","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","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.","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.","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} }"},"user_id":"15415","abstract":[{"lang":"eng","text":"We introduce the Read-Write-Coding-System (RWC) 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."}],"volume":5873,"date_created":"2020-09-30T12:12:33Z","status":"public","publication":"Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems","author":[{"last_name":"Mense","full_name":"Mense, Mario","first_name":"Mario"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}]},{"language":[{"iso":"eng"}],"year":"2010","citation":{"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.","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.","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","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.","short":"T. Janson, P. Mahlmann, C. Schindelhauer, in: Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010."},"type":"conference","doi":"10.1109/icpads.2010.42","_id":"19824","date_updated":"2022-01-06T06:54:13Z","date_created":"2020-10-01T09:39:13Z","status":"public","publication_identifier":{"isbn":["9781424497270"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"Proceedings of the 16th International Conference on Parallel and Distributed Systems","author":[{"full_name":"Janson, Thomas","first_name":"Thomas","last_name":"Janson"},{"last_name":"Mahlmann","full_name":"Mahlmann, Peter","first_name":"Peter"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"}],"user_id":"15415","title":"A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","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."}]},{"title":"Coverage-hole trap model in target tracking using distributed relay-robot network","user_id":"15415","publication":"Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10","department":[{"_id":"63"}],"author":[{"full_name":"Miao, Huawei","first_name":"Huawei","last_name":"Miao"},{"last_name":"Ooi","full_name":"Ooi, Chia Ching","first_name":"Chia Ching"},{"full_name":"Wu, Xiaowen","first_name":"Xiaowen","last_name":"Wu"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"}],"publication_identifier":{"isbn":["9781605586397"]},"publication_status":"published","date_created":"2020-10-01T10:00:25Z","status":"public","_id":"19829","date_updated":"2022-01-06T06:54:13Z","doi":"10.1145/1774088.1774365","page":"1299-1304","year":"2010","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","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.","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.","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} }","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.","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."},"type":"conference","language":[{"iso":"eng"}]},{"year":"2010","type":"conference","citation":{"short":"G. Schomaker, S. Oberthur, M. Kortenjan, in: 8th IEEE International Conference on Industrial Informatics (INDIN’2010), 2010.","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.","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","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","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.","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.","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} }"},"language":[{"iso":"eng"}],"doi":"10.1109/indin.2010.5549647","date_updated":"2022-01-06T06:54:14Z","_id":"19933","publication_identifier":{"isbn":["9781424472987"]},"publication_status":"published","date_created":"2020-10-06T14:01:21Z","status":"public","publication":"8th IEEE International Conference on Industrial Informatics (INDIN'2010)","department":[{"_id":"63"},{"_id":"70"}],"author":[{"full_name":"Schomaker, Gunnar","first_name":"Gunnar","last_name":"Schomaker"},{"full_name":"Oberthur, Simon","first_name":"Simon","last_name":"Oberthur"},{"full_name":"Kortenjan, Michael","first_name":"Michael","last_name":"Kortenjan"}],"title":"Distributed and dynamic resource management for self-optimizing mechatronic systems","user_id":"15415"},{"citation":{"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.","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","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","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} }","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.","ieee":"H. Hamann, Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Berlin, Germany: Springer, 2010."},"type":"book","year":"2010","language":[{"iso":"eng"}],"_id":"20182","date_updated":"2022-01-06T06:54:21Z","doi":"10.1007/978-3-642-13377-0","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"}],"publisher":"Springer","department":[{"_id":"63"},{"_id":"238"}],"status":"public","date_created":"2020-10-22T12:25:10Z","place":"Berlin, Germany","title":"Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming","user_id":"15415"},{"title":"A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning","user_id":"15415","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"last_name":"Stradner","first_name":"Jürgen","full_name":"Stradner, Jürgen"},{"first_name":"Karl","full_name":"Crailsheim, Karl","last_name":"Crailsheim"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC'10)","status":"public","date_created":"2020-10-28T14:37:09Z","_id":"20220","date_updated":"2022-01-06T06:54:23Z","doi":"10.1109/CEC.2010.5585994","citation":{"short":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), 2010, pp. 244--251.","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.","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.","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","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","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.","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} }"},"type":"conference","year":"2010","page":"244--251","language":[{"iso":"eng"}]},{"user_id":"15415","title":"Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller","publisher":"MIT Press","author":[{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"first_name":"Jürgen","full_name":"Stradner, Jürgen","last_name":"Stradner"},{"first_name":"Ralf","full_name":"Mayet, Ralf","last_name":"Mayet"},{"last_name":"Crailsheim","full_name":"Crailsheim, Karl","first_name":"Karl"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Proc. of the ALife XII Conference","status":"public","date_created":"2020-10-29T14:09:39Z","date_updated":"2022-01-06T06:54:23Z","_id":"20222","language":[{"iso":"eng"}],"type":"conference","year":"2010","citation":{"short":"T. Schmickl, H. Hamann, J. Stradner, R. Mayet, K. Crailsheim, in: Proc. of the ALife XII Conference, MIT Press, 2010, pp. 648--655.","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.","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.","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.","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.","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} }"},"page":"648--655"},{"date_updated":"2022-01-06T06:54:23Z","_id":"20223","page":"773-780","type":"conference","year":"2010","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.","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.","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.","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} }","short":"H. Hamann, J. Stradner, T. Schmickl, K. Crailsheim, in: Artificial Life XII (ALife XII), Odense, Denmark, MIT Press, 2010, pp. 773–780.","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."},"language":[{"iso":"eng"}],"title":"Artificial Hormone Reaction Networks: Towards Higher Evolvability in Evolutionary Multi-Modular Robotics","user_id":"15415","abstract":[{"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.","lang":"eng"}],"external_id":{"arxiv":["1011.3912"]},"date_created":"2020-10-29T14:11:25Z","status":"public","publication":"Artificial Life XII (ALife XII), Odense, Denmark","department":[{"_id":"63"},{"_id":"238"}],"publisher":"MIT Press","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"last_name":"Stradner","full_name":"Stradner, Jürgen","first_name":"Jürgen"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"last_name":"Crailsheim","full_name":"Crailsheim, Karl","first_name":"Karl"}]},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642151927","9783642151934"]},"publication_status":"published","department":[{"_id":"63"},{"_id":"238"}],"title":"A Model of Symmetry Breaking in Collective Decision-Making","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-15193-4_60","date_updated":"2022-01-06T06:54:24Z","volume":6226,"date_created":"2020-10-29T14:22:12Z","status":"public","publication":"From Animals to Animats 11","publisher":"Springer","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Meyer","first_name":"Bernd","full_name":"Meyer, Bernd"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"}],"user_id":"15415","page":"639-648","citation":{"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.","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","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","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} }","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.","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."},"type":"conference","year":"2010","intvolume":" 6226","_id":"20226"},{"date_created":"2020-11-02T14:13:10Z","status":"public","publication_identifier":{"isbn":["9781424451661"]},"publication_status":"published","publication":"2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Kernbach","full_name":"Kernbach, Serge","first_name":"Serge"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Stradner","first_name":"Jürgen","full_name":"Stradner, Jürgen"},{"first_name":"Ronald","full_name":"Thenius, Ronald","last_name":"Thenius"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"last_name":"Crailsheim","full_name":"Crailsheim, Karl","first_name":"Karl"},{"last_name":"Rossum","full_name":"Rossum, A.C. van","first_name":"A.C. van"},{"last_name":"Sebag","first_name":"Michele","full_name":"Sebag, Michele"},{"first_name":"Nicolas","full_name":"Bredeche, Nicolas","last_name":"Bredeche"},{"last_name":"Yao","full_name":"Yao, Yao","first_name":"Yao"},{"last_name":"Baele","first_name":"Guy","full_name":"Baele, Guy"},{"last_name":"Peer","first_name":"Yves Van de","full_name":"Peer, Yves Van de"},{"first_name":"Jon","full_name":"Timmis, Jon","last_name":"Timmis"},{"last_name":"Mohktar","first_name":"Maizura","full_name":"Mohktar, Maizura"},{"last_name":"Tyrrell","first_name":"Andy","full_name":"Tyrrell, Andy"},{"last_name":"Eiben","first_name":"A.E.","full_name":"Eiben, A.E."},{"last_name":"McKibbin","full_name":"McKibbin, S.P.","first_name":"S.P."},{"last_name":"Liu","first_name":"Wenguo","full_name":"Liu, Wenguo"},{"first_name":"Alan F.T.","full_name":"Winfield, Alan F.T.","last_name":"Winfield"}],"user_id":"15415","title":"On Adaptive Self-Organization in Artificial Robot Organisms","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"citation":{"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.","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} }","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.","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."},"year":"2010","type":"conference","doi":"10.1109/computationworld.2009.9","_id":"20258","date_updated":"2022-01-06T06:54:25Z"},{"citation":{"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.","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).","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.","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} }","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","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."},"type":"journal_article","year":"2010","language":[{"iso":"eng"}],"_id":"24282","date_updated":"2022-01-06T06:56:17Z","doi":"10.1007/11424826_55","publication":"ICCSA'05: Proceedings of the 2005 international conference on Computational Science and Its Applications","department":[{"_id":"63"}],"author":[{"last_name":"Grza̧ślewicz","first_name":"Ryszard","full_name":"Grza̧ślewicz, Ryszard"},{"first_name":"Jarosław","full_name":"Kutyłowski, Jarosław","last_name":"Kutyłowski"},{"last_name":"Kutyłowski","full_name":"Kutyłowski, Mirosław","first_name":"Mirosław"},{"last_name":"Pietkiewicz","first_name":"Wojciech","full_name":"Pietkiewicz, Wojciech"}],"publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_created":"2021-09-13T14:53:37Z","status":"public","title":"Robust Undetectable Interference Watermarks","user_id":"15415"},{"citation":{"short":"S. Samara, G. Schomaker, in: 2010 10th IEEE International Conference on Computer and Information Technology, 2010.","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.","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.","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","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.","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} }"},"type":"conference","year":"2010","language":[{"iso":"eng"}],"doi":"10.1109/cit.2010.304","_id":"27159","date_updated":"2022-01-06T06:57:35Z","publication_status":"published","status":"public","date_created":"2021-11-04T15:53:55Z","author":[{"last_name":"Samara","first_name":"Sufyan","full_name":"Samara, Sufyan"},{"last_name":"Schomaker","full_name":"Schomaker, Gunnar","first_name":"Gunnar"}],"publication":"2010 10th IEEE International Conference on Computer and Information Technology","department":[{"_id":"63"},{"_id":"26"}],"title":"Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip","user_id":"15415"},{"user_id":"15415","title":"Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations","abstract":[{"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 scenes 3D-data used for the simulation models visualization. We demonstrate the technique with a multi-floor building example.","lang":"eng"}],"status":"public","date_created":"2020-07-27T19:33:16Z","publication_identifier":{"isbn":["9781424498666"]},"publication_status":"published","author":[{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Renken","first_name":"Hendrik","full_name":"Renken, Hendrik"},{"first_name":"Christoph","full_name":"Laroque, Christoph","last_name":"Laroque"},{"last_name":"Schaumann","full_name":"Schaumann, Guido","first_name":"Guido"},{"last_name":"Dangelmaier","first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm"}],"publication":"Proceedings of the 2010 Winter Simulation Conference","department":[{"_id":"63"}],"doi":"10.1109/wsc.2010.5678906","_id":"17422","date_updated":"2022-01-06T06:53:11Z","language":[{"iso":"eng"}],"citation":{"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.","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","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","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} }","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.","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."},"type":"conference","year":"2010"},{"date_updated":"2022-01-06T06:53:12Z","_id":"17462","type":"report","year":"2010","citation":{"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.","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.","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.","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.","mla":"Gehweiler, Joachim, et al. A Large-Scale Distributed Environment for Peer-to-Peer Services. Heinz Nixdorf Institut, 2010.","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} }"},"report_number":"tr-ri-10-317","language":[{"iso":"eng"}],"ddc":["000"],"title":"A Large-Scale Distributed Environment for Peer-to-Peer Services","user_id":"15415","place":"Paderborn","date_created":"2020-07-30T07:25:59Z","has_accepted_license":"1","status":"public","department":[{"_id":"63"}],"file_date_updated":"2020-07-30T07:24:17Z","publisher":"Heinz Nixdorf Institut","author":[{"last_name":"Gehweiler","full_name":"Gehweiler, Joachim","first_name":"Joachim"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Schroeder, Ulf-Peter","first_name":"Ulf-Peter","id":"477","last_name":"Schroeder"}],"file":[{"date_created":"2020-07-30T07:24:17Z","file_name":"tr-ri-10-317.pdf","access_level":"closed","file_size":468844,"creator":"koala","file_id":"17463","date_updated":"2020-07-30T07:24:17Z","content_type":"application/pdf","relation":"main_file","success":1}]},{"year":"2010","type":"report","citation":{"ieee":"M. J. Blesa 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.","mla":"Blesa, Maria J., et al. Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study. 2010.","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} }","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.","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.","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."},"report_number":"FRONTS-TR-2010-11","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:12Z","_id":"17464","date_created":"2020-07-30T07:48:53Z","has_accepted_license":"1","status":"public","file_date_updated":"2020-07-30T07:48:24Z","department":[{"_id":"63"}],"author":[{"last_name":"Blesa","full_name":"Blesa, Maria J.","first_name":"Maria J."},{"first_name":"Christian","full_name":"Blum, Christian","last_name":"Blum"},{"first_name":"Angelo","full_name":"de Caro, Angelo","last_name":"de Caro"},{"full_name":"Degener, Bastian ","first_name":"Bastian ","last_name":"Degener"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Leone, Piere","first_name":"Piere","last_name":"Leone"},{"full_name":"Persiano, Giuseppe","first_name":"Giuseppe","last_name":"Persiano"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Mylonas","full_name":"Mylonas, Georgios","first_name":"Georgios"}],"file":[{"file_size":242286,"file_id":"17466","creator":"koala","date_updated":"2020-07-30T07:48:24Z","content_type":"application/pdf","success":1,"relation":"main_file","date_created":"2020-07-30T07:48:24Z","file_name":"FRONTS-TR-2010-11.pdf","access_level":"closed"}],"ddc":["000"],"title":"Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study","user_id":"15415"},{"language":[{"iso":"eng"}],"year":"2010","type":"preprint","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.","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.","mla":"Brandes, Philipp, et al. Building Short Chains of Mobile Robots Locally with a Bounded Stepwidth. 2010.","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} }","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, (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."},"_id":"17586","date_updated":"2022-01-06T06:53:15Z","file":[{"date_updated":"2020-08-04T12:26:55Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":476532,"file_id":"17587","creator":"koala","access_level":"closed","date_created":"2020-08-04T12:26:55Z","file_name":"BoundedStepwidth.pdf"}],"department":[{"_id":"63"}],"file_date_updated":"2020-08-04T12:26:55Z","author":[{"last_name":"Brandes","first_name":"Philipp","full_name":"Brandes, Philipp"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-08-04T12:28:05Z","status":"public","has_accepted_license":"1","abstract":[{"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.","lang":"eng"}],"user_id":"15415","ddc":["000"],"title":"Building short chains of mobile robots locally with a bounded stepwidth"},{"date_updated":"2022-01-06T06:53:16Z","_id":"17665","page":"33-42","citation":{"short":"R. Bar-Yehuda, G. Polevoy, D. Rawitz, in: DIALM-PODC, 2010, pp. 33–42.","ieee":"R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” in DIALM-PODC, 2010, pp. 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.","apa":"Bar-Yehuda, R., Polevoy, G., & Rawitz, D. (2010). Bandwidth allocation in cellular networks with multiple interferences. In DIALM-PODC (pp. 33–42).","ama":"Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. In: DIALM-PODC. ; 2010: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} }","mla":"Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” DIALM-PODC, 2010, pp. 33–42."},"type":"conference","year":"2010","language":[{"iso":"eng"}],"extern":"1","title":"Bandwidth allocation in cellular networks with multiple interferences","user_id":"83983","publication":"DIALM-PODC","department":[{"_id":"63"},{"_id":"541"}],"author":[{"full_name":"Bar-Yehuda, Reuven","first_name":"Reuven","last_name":"Bar-Yehuda"},{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"Rawitz","full_name":"Rawitz, Dror","first_name":"Dror"}],"date_created":"2020-08-06T15:22:47Z","status":"public"},{"department":[{"_id":"63"},{"_id":"238"}],"publication":"Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Schmickl","full_name":"Schmickl, Thomas","first_name":"Thomas"},{"last_name":"Stradner","full_name":"Stradner, Jürgen","first_name":"Jürgen"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"},{"last_name":"Levi","full_name":"Levi, Paul","first_name":"Paul"},{"last_name":"Kernbach","first_name":"Serge","full_name":"Kernbach, Serge"}],"publisher":"Springer","publication_status":"published","date_created":"2020-09-01T11:29:17Z","status":"public","title":"Hormone-based Control for Multi-modular Robotics","user_id":"15415","page":"240--263","type":"book_chapter","year":"2010","citation":{"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} }","mla":"Hamann, Heiko, et al. “Hormone-Based Control for Multi-Modular Robotics.” Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, Springer, 2010, pp. 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.","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.","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.","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."},"language":[{"iso":"eng"}],"_id":"18761","date_updated":"2022-01-06T06:53:51Z"},{"user_id":"5786","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2005010135"}]},"title":"Page migration in dynamic networks","status":"public","date_created":"2020-09-03T07:52:47Z","publication_identifier":{"isbn":["978-3-942647-01-4"]},"volume":282,"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"}],"department":[{"_id":"63"},{"_id":"26"}],"date_updated":"2022-01-06T06:53:54Z","_id":"18910","intvolume":" 282","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"year":"2010","type":"dissertation","citation":{"short":"M. Bienkowski, Page Migration in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ieee":"M. Bienkowski, Page migration in dynamic networks, vol. 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","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.","chicago":"Bienkowski, Marcin. Page Migration in Dynamic Networks. Vol. 282. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","mla":"Bienkowski, Marcin. Page Migration in Dynamic Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","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} }"},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"user_id":"5786","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080225031","relation":"confirmation"}]},"title":"Collective graph exploration","status":"public","date_created":"2020-09-03T10:21:10Z","volume":284,"publication_identifier":{"isbn":["978-3-942647-03-8"]},"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Dynia, Miroslaw","first_name":"Miroslaw","last_name":"Dynia"}],"department":[{"_id":"63"},{"_id":"26"}],"intvolume":" 284","_id":"18927","date_updated":"2022-01-06T06:53:54Z","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"ieee":"M. Dynia, Collective graph exploration, vol. 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"M. Dynia, Collective Graph Exploration, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","mla":"Dynia, Miroslaw. Collective Graph Exploration. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","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} }","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.","chicago":"Dynia, Miroslaw. Collective Graph Exploration. Vol. 284. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010."},"year":"2010","type":"dissertation","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"title":"Kinetic Facility Location","department":[{"_id":"63"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","date_updated":"2022-01-06T06:53:57Z","doi":"10.1007/s00453-008-9250-7","language":[{"iso":"eng"}],"user_id":"15415","publication":"Algorithmica","author":[{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"last_name":"Gehweiler","first_name":"Joachim","full_name":"Gehweiler, Joachim"},{"first_name":"Christiane","full_name":"Lammersen, Christiane","last_name":"Lammersen"}],"date_created":"2020-09-04T10:35:36Z","status":"public","volume":57,"_id":"19011","intvolume":" 57","issue":"3","page":"562-584","type":"journal_article","year":"2010","citation":{"mla":"Degener, Bastian, et al. “Kinetic Facility Location.” Algorithmica, vol. 57, no. 3, 2010, pp. 562–84, doi: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.","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","ama":"Degener B, Gehweiler J, Lammersen C. Kinetic Facility Location. Algorithmica. 2010;57(3):562-584. doi: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.","short":"B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584."}},{"language":[{"iso":"eng"}],"citation":{"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.","short":"J. Gehweiler, H. Meyerhenke, in: Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010.","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} }","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.","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.","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","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"},"year":"2010","type":"conference","_id":"19013","date_updated":"2022-01-06T06:53:57Z","doi":"10.1109/ipdpsw.2010.5470922","department":[{"_id":"63"}],"publication":"Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)","author":[{"first_name":"Joachim","full_name":"Gehweiler, Joachim","last_name":"Gehweiler"},{"full_name":"Meyerhenke, Henning","first_name":"Henning","last_name":"Meyerhenke"}],"date_created":"2020-09-04T10:39:37Z","status":"public","publication_identifier":{"isbn":["9781424465330"]},"publication_status":"published","user_id":"15415","title":"A distributed diffusive heuristic for clustering a virtual P2P supercomputer"}]