[{"title":"Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip","user_id":"5786","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080623016","relation":"confirmation"}]},"department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Bonorden","full_name":"Bonorden, Olaf","first_name":"Olaf"}],"volume":257,"publication_identifier":{"isbn":["978-3-939350-76-7"]},"date_created":"2020-09-22T08:44:45Z","status":"public","_id":"19618","intvolume":" 257","date_updated":"2022-01-06T06:54:08Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"ieee":"O. Bonorden, Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip, vol. 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"O. Bonorden, Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","bibtex":"@book{Bonorden_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip}, volume={257}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bonorden, Olaf}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Bonorden, Olaf. Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Bonorden, Olaf. Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip. Vol. 257. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Bonorden, O. (2009). Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip (Vol. 257). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Bonorden O. Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip. Vol 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009."},"year":"2009","type":"dissertation","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}]},{"date_created":"2020-09-28T10:19:43Z","status":"public","has_accepted_license":"1","department":[{"_id":"63"}],"file_date_updated":"2020-09-28T10:19:26Z","author":[{"last_name":"Bonorden","full_name":"Bonorden, Olaf","first_name":"Olaf"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"last_name":"Pietrzyk","first_name":"Peter","full_name":"Pietrzyk, Peter"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"}],"file":[{"relation":"main_file","success":1,"date_updated":"2020-09-28T10:19:26Z","content_type":"application/pdf","creator":"koala","file_id":"19723","file_size":258114,"access_level":"closed","file_name":"pub-hni-3956.pdf","date_created":"2020-09-28T10:19:26Z"}],"ddc":["000"],"title":"Complexity and approximation of a geometric local robot assignment problem","user_id":"15415","year":"2009","type":"report","citation":{"bibtex":"@book{Bonorden_Degener_Pietrzyk_Kempkes_2009, title={Complexity and approximation of a geometric local robot assignment problem}, author={Bonorden, Olaf and Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}, year={2009} }","mla":"Bonorden, Olaf, et al. Complexity and Approximation of a Geometric Local Robot Assignment Problem. 2009.","apa":"Bonorden, O., Degener, B., Pietrzyk, P., & Kempkes, B. (2009). Complexity and approximation of a geometric local robot assignment problem.","ama":"Bonorden O, Degener B, Pietrzyk P, Kempkes B. Complexity and Approximation of a Geometric Local Robot Assignment Problem.; 2009.","chicago":"Bonorden, Olaf, Bastian Degener, Peter Pietrzyk, and Barbara Kempkes. Complexity and Approximation of a Geometric Local Robot Assignment Problem, 2009.","ieee":"O. Bonorden, B. Degener, P. Pietrzyk, and B. Kempkes, Complexity and approximation of a geometric local robot assignment problem. 2009.","short":"O. Bonorden, B. Degener, P. Pietrzyk, B. Kempkes, Complexity and Approximation of a Geometric Local Robot Assignment Problem, 2009."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:10Z","_id":"19722"},{"_id":"19724","type":"book_chapter","year":"2009","citation":{"ama":"Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: Algorithmic Aspects of Wireless Sensor Networks. Berlin, Heidelberg: Springer; 2009:252-262. doi:10.1007/978-3-642-05434-1_25","apa":"Bonorden, O., Degener, B., Kempkes, B., & Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In Algorithmic Aspects of Wireless Sensor Networks (pp. 252–262). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-05434-1_25","chicago":"Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” In Algorithmic Aspects of Wireless Sensor Networks, 252–62. Berlin, Heidelberg: Springer, 2009. https://doi.org/10.1007/978-3-642-05434-1_25.","mla":"Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” Algorithmic Aspects of Wireless Sensor Networks, Springer, 2009, pp. 252–62, doi:10.1007/978-3-642-05434-1_25.","bibtex":"@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg}, title={Complexity and Approximation of a Geometric Local Robot Assignment Problem}, DOI={10.1007/978-3-642-05434-1_25}, booktitle={Algorithmic Aspects of Wireless Sensor Networks}, publisher={Springer}, author={Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}, year={2009}, pages={252–262} }","short":"O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.","ieee":"O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in Algorithmic Aspects of Wireless Sensor Networks, Berlin, Heidelberg: Springer, 2009, pp. 252–262."},"page":"252-262","abstract":[{"lang":"eng","text":"We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\\classP$ or are $\\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\\bigO(\\log^*n)$ communication rounds."}],"user_id":"15415","publisher":"Springer","author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"last_name":"Pietrzyk","full_name":"Pietrzyk, Peter","first_name":"Peter"}],"publication":"Algorithmic Aspects of Wireless Sensor Networks","status":"public","date_created":"2020-09-28T10:25:34Z","date_updated":"2022-01-06T06:54:10Z","doi":"10.1007/978-3-642-05434-1_25","language":[{"iso":"eng"}],"place":"Berlin, Heidelberg","title":"Complexity and Approximation of a Geometric Local Robot Assignment Problem","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642054334","9783642054341"]}},{"abstract":[{"text":"Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks feature efficient lookup algorithms with typically logarithmic hop distance and provide simple and efficient load balancing. Yet, they are limited to exact match queries and in many cases hard to maintain under churn.","lang":"eng"}],"ddc":["000"],"title":"3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","user_id":"15415","author":[{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"},{"first_name":"Peter","full_name":"Mahlmann, Peter","last_name":"Mahlmann"},{"full_name":"Janson, Thomas","first_name":"Thomas","last_name":"Janson"}],"publisher":"Paderborn, Germany","file_date_updated":"2020-10-01T09:47:33Z","department":[{"_id":"63"}],"file":[{"access_level":"closed","date_created":"2020-10-01T09:47:33Z","file_name":"pub-hni-4130.pdf","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-10-01T09:47:33Z","file_id":"19826","creator":"koala","file_size":753215}],"has_accepted_license":"1","status":"public","date_created":"2020-10-01T09:47:54Z","date_updated":"2022-01-06T06:54:13Z","_id":"19825","type":"report","citation":{"mla":"Schindelhauer, Christian, et al. 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany, 2009.","bibtex":"@book{Schindelhauer_Mahlmann_Janson_2009, title={3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, publisher={Paderborn, Germany}, author={Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas}, year={2009} }","ama":"Schindelhauer C, Mahlmann P, Janson T. 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany; 2009.","apa":"Schindelhauer, C., Mahlmann, P., & Janson, T. (2009). 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany.","chicago":"Schindelhauer, Christian, Peter Mahlmann, and Thomas Janson. 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany, 2009.","ieee":"C. Schindelhauer, P. Mahlmann, and T. Janson, 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany, 2009.","short":"C. Schindelhauer, P. Mahlmann, T. Janson, 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs, Paderborn, Germany, 2009."},"year":"2009","language":[{"iso":"eng"}]},{"title":"Minimal Energy Path Planning for Wireless Robots","user_id":"15415","publication":"Mobile Networks and Applications (MONET)","department":[{"_id":"63"}],"author":[{"last_name":"Ooi","first_name":"Chia Ching","full_name":"Ooi, Chia Ching"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"publication_identifier":{"issn":["1383-469X","1572-8153"]},"publication_status":"published","date_created":"2020-10-01T10:05:47Z","status":"public","_id":"19830","date_updated":"2022-01-06T06:54:13Z","doi":"10.1007/s11036-008-0150-5","page":"309-321","year":"2009","type":"journal_article","citation":{"ama":"Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots. Mobile Networks and Applications (MONET). 2009:309-321. doi:10.1007/s11036-008-0150-5","apa":"Ooi, C. C., & Schindelhauer, C. (2009). Minimal Energy Path Planning for Wireless Robots. Mobile Networks and Applications (MONET), 309–321. https://doi.org/10.1007/s11036-008-0150-5","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” Mobile Networks and Applications (MONET), 2009, 309–21. https://doi.org/10.1007/s11036-008-0150-5.","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” Mobile Networks and Applications (MONET), 2009, pp. 309–21, doi:10.1007/s11036-008-0150-5.","bibtex":"@article{Ooi_Schindelhauer_2009, title={Minimal Energy Path Planning for Wireless Robots}, DOI={10.1007/s11036-008-0150-5}, journal={Mobile Networks and Applications (MONET)}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2009}, pages={309–321} }","short":"C.C. Ooi, C. Schindelhauer, Mobile Networks and Applications (MONET) (2009) 309–321.","ieee":"C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless Robots,” Mobile Networks and Applications (MONET), pp. 309–321, 2009."},"language":[{"iso":"eng"}]},{"user_id":"15415","title":"Utilizing detours for energy conservation in mobile wireless networks","date_created":"2020-10-01T10:10:10Z","status":"public","publication_identifier":{"issn":["1018-4864","1572-9451"]},"publication_status":"published","volume":43,"publication":"Telecommunication Systems","department":[{"_id":"63"}],"author":[{"last_name":"Ooi","first_name":"Chia Ching","full_name":"Ooi, Chia Ching"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"doi":"10.1007/s11235-009-9188-3","date_updated":"2022-01-06T06:54:13Z","_id":"19831","intvolume":" 43","language":[{"iso":"eng"}],"page":"25-37","type":"journal_article","citation":{"ama":"Ooi CC, Schindelhauer C. Utilizing detours for energy conservation in mobile wireless networks. Telecommunication Systems. 2009;43:25-37. doi:10.1007/s11235-009-9188-3","apa":"Ooi, C. C., & Schindelhauer, C. (2009). Utilizing detours for energy conservation in mobile wireless networks. Telecommunication Systems, 43, 25–37. https://doi.org/10.1007/s11235-009-9188-3","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.” Telecommunication Systems 43 (2009): 25–37. https://doi.org/10.1007/s11235-009-9188-3.","bibtex":"@article{Ooi_Schindelhauer_2009, title={Utilizing detours for energy conservation in mobile wireless networks}, volume={43}, DOI={10.1007/s11235-009-9188-3}, journal={Telecommunication Systems}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2009}, pages={25–37} }","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.” Telecommunication Systems, vol. 43, 2009, pp. 25–37, doi:10.1007/s11235-009-9188-3.","short":"C.C. Ooi, C. Schindelhauer, Telecommunication Systems 43 (2009) 25–37.","ieee":"C. C. Ooi and C. Schindelhauer, “Utilizing detours for energy conservation in mobile wireless networks,” Telecommunication Systems, vol. 43, pp. 25–37, 2009."},"year":"2009"},{"user_id":"15415","title":"Colouring Non-sparse Random Intersection Graphs","date_created":"2020-10-06T10:09:51Z","status":"public","publication_identifier":{"isbn":["9781493928637","9781493928644"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"34st International Symposium on Mathematical Foundations of Computer Science","author":[{"first_name":"Christoforos L.","full_name":"Raptopoulos, Christoforos L.","last_name":"Raptopoulos"},{"last_name":"Nikoletseas","full_name":"Nikoletseas, Sotiris E.","first_name":"Sotiris E."},{"last_name":"Spirakis","full_name":"Spirakis, Paul G.","first_name":"Paul G."}],"doi":"10.1007/978-1-4939-2864-4_597","_id":"19901","date_updated":"2022-01-06T06:54:14Z","language":[{"iso":"eng"}],"page":"600--611","year":"2009","citation":{"ieee":"C. L. Raptopoulos, S. E. Nikoletseas, and P. G. Spirakis, “Colouring Non-sparse Random Intersection Graphs,” in 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611.","short":"C.L. Raptopoulos, S.E. Nikoletseas, P.G. Spirakis, in: 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611.","mla":"Raptopoulos, Christoforos L., et al. “Colouring Non-Sparse Random Intersection Graphs.” 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611, doi:10.1007/978-1-4939-2864-4_597.","bibtex":"@inproceedings{Raptopoulos_Nikoletseas_Spirakis_2009, title={Colouring Non-sparse Random Intersection Graphs}, DOI={10.1007/978-1-4939-2864-4_597}, booktitle={34st International Symposium on Mathematical Foundations of Computer Science}, author={Raptopoulos, Christoforos L. and Nikoletseas, Sotiris E. and Spirakis, Paul G.}, year={2009}, pages={600--611} }","chicago":"Raptopoulos, Christoforos L., Sotiris E. Nikoletseas, and Paul G. Spirakis. “Colouring Non-Sparse Random Intersection Graphs.” In 34st International Symposium on Mathematical Foundations of Computer Science, 600--611, 2009. https://doi.org/10.1007/978-1-4939-2864-4_597.","apa":"Raptopoulos, C. L., Nikoletseas, S. E., & Spirakis, P. G. (2009). Colouring Non-sparse Random Intersection Graphs. In 34st International Symposium on Mathematical Foundations of Computer Science (pp. 600--611). https://doi.org/10.1007/978-1-4939-2864-4_597","ama":"Raptopoulos CL, Nikoletseas SE, Spirakis PG. Colouring Non-sparse Random Intersection Graphs. In: 34st International Symposium on Mathematical Foundations of Computer Science. ; 2009:600--611. doi:10.1007/978-1-4939-2864-4_597"},"type":"conference"},{"department":[{"_id":"63"}],"publication":" Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium","author":[{"last_name":"Nikoletseas","full_name":"Nikoletseas, Sotiris E.","first_name":"Sotiris E."},{"full_name":"Raptopoulos, Christoforos L.","first_name":"Christoforos L.","last_name":"Raptopoulos"},{"first_name":"Paul G.","full_name":"Spirakis, Paul G.","last_name":"Spirakis"}],"date_created":"2020-10-06T10:23:53Z","status":"public","title":"Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions","user_id":"15415","page":"1--11","citation":{"short":"S.E. Nikoletseas, C.L. Raptopoulos, P.G. Spirakis, in: Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium, 2009, pp. 1--11.","ieee":"S. E. Nikoletseas, C. L. Raptopoulos, and P. G. Spirakis, “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions,” in Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium, 2009, pp. 1--11.","chicago":"Nikoletseas, Sotiris E., Christoforos L. Raptopoulos, and Paul G. Spirakis. “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions.” In Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium, 1--11, 2009. https://doi.org/10.1109/IPDPS.2009.5161002.","apa":"Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2009). Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium (pp. 1--11). https://doi.org/10.1109/IPDPS.2009.5161002","ama":"Nikoletseas SE, Raptopoulos CL, Spirakis PG. Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In: Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium. ; 2009:1--11. doi:10.1109/IPDPS.2009.5161002","mla":"Nikoletseas, Sotiris E., et al. “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions.” Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium, 2009, pp. 1--11, doi:10.1109/IPDPS.2009.5161002.","bibtex":"@inproceedings{Nikoletseas_Raptopoulos_Spirakis_2009, title={Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions}, DOI={10.1109/IPDPS.2009.5161002}, booktitle={ Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium}, author={Nikoletseas, Sotiris E. and Raptopoulos, Christoforos L. and Spirakis, Paul G.}, year={2009}, pages={1--11} }"},"type":"conference","year":"2009","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:14Z","_id":"19904","doi":"10.1109/IPDPS.2009.5161002"},{"_id":"19934","date_updated":"2022-01-06T06:54:14Z","year":"2009","type":"conference","citation":{"short":"D. Deveci, M. Kortenjan, G. Schomaker, in: Parallel and Distributed Computing and Systems, Nr. 21, 2009.","ieee":"D. Deveci, M. Kortenjan, and G. Schomaker, “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions,” in Parallel and Distributed Computing and Systems, Nr. 21, 2009.","chicago":"Deveci, Deniz, Michael Kortenjan, and Gunnar Schomaker. “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions.” In Parallel and Distributed Computing and Systems, Nr. 21, 2009.","ama":"Deveci D, Kortenjan M, Schomaker G. Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions. In: Parallel and Distributed Computing and Systems, Nr. 21. ; 2009.","apa":"Deveci, D., Kortenjan, M., & Schomaker, G. (2009). Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions. In Parallel and Distributed Computing and Systems, Nr. 21.","mla":"Deveci, Deniz, et al. “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions.” Parallel and Distributed Computing and Systems, Nr. 21, 2009.","bibtex":"@inproceedings{Deveci_Kortenjan_Schomaker_2009, title={Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions}, booktitle={ Parallel and Distributed Computing and Systems, Nr. 21}, author={Deveci, Deniz and Kortenjan, Michael and Schomaker, Gunnar}, year={2009} }"},"language":[{"iso":"eng"}],"title":"Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions","user_id":"15415","status":"public","date_created":"2020-10-06T14:12:26Z","author":[{"last_name":"Deveci","first_name":"Deniz","full_name":"Deveci, Deniz"},{"last_name":"Kortenjan","first_name":"Michael","full_name":"Kortenjan, Michael"},{"last_name":"Schomaker","first_name":"Gunnar","full_name":"Schomaker, Gunnar"}],"publication":" Parallel and Distributed Computing and Systems, Nr. 21","department":[{"_id":"63"},{"_id":"70"}]},{"year":"2009","citation":{"ieee":"J. Stradner, H. Hamann, T. Schmickl, and K. Crailsheim, “Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware,” in 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009.","short":"J. Stradner, H. Hamann, T. Schmickl, K. Crailsheim, in: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009.","mla":"Stradner, Jürgen, et al. “Analysis and Implementation of an Artificial Homeostatic Hormone System: A First Case Study in Robotic Hardware.” 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009, doi:10.1109/iros.2009.5354056.","bibtex":"@inproceedings{Stradner_Hamann_Schmickl_Crailsheim_2009, title={Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware}, DOI={10.1109/iros.2009.5354056}, booktitle={2009 IEEE/RSJ International Conference on Intelligent Robots and Systems}, author={Stradner, Jürgen and Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2009} }","chicago":"Stradner, Jürgen, Heiko Hamann, Thomas Schmickl, and Karl Crailsheim. “Analysis and Implementation of an Artificial Homeostatic Hormone System: A First Case Study in Robotic Hardware.” In 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009. https://doi.org/10.1109/iros.2009.5354056.","ama":"Stradner J, Hamann H, Schmickl T, Crailsheim K. Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware. In: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems. ; 2009. doi:10.1109/iros.2009.5354056","apa":"Stradner, J., Hamann, H., Schmickl, T., & Crailsheim, K. (2009). Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware. In 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2009.5354056"},"type":"conference","language":[{"iso":"eng"}],"doi":"10.1109/iros.2009.5354056","_id":"20254","date_updated":"2022-01-06T06:54:25Z","publication_status":"published","publication_identifier":{"isbn":["9781424438037"]},"status":"public","date_created":"2020-11-02T14:04:46Z","author":[{"first_name":"Jürgen","full_name":"Stradner, Jürgen","last_name":"Stradner"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"full_name":"Schmickl, Thomas","first_name":"Thomas","last_name":"Schmickl"},{"last_name":"Crailsheim","first_name":"Karl","full_name":"Crailsheim, Karl"}],"publication":"2009 IEEE/RSJ International Conference on Intelligent Robots and Systems","department":[{"_id":"63"},{"_id":"238"}],"title":"Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware","user_id":"15415","abstract":[{"text":"One of the prominent challenges in mobile robotics is to develop control methodologies that allow the adaptation to dynamic and unforeseen environments. The classic approach of hand-coded controllers is very efficient for well-defined tasks and specific environments but poor in adapting to changing environmental conditions. One alternative approach is the application of evolutionary algorithms which need, in turn, easily evolvable representations of controllers. In this paper, we investigate one promising approach of an artificial hormone system as a control paradigm which is believed to be easily optimized by evolutionary processes. In a first step of this research, we focus on the simple task of collision avoidance. We present a brief mathematical analysis of this controller approach and an implementation of the controller on a mobile robot to check the feasibility in principle of our approach. The task is successfully accomplished and we conclude with a discussion of the hormone dynamics in the robot.","lang":"eng"}]}]