[{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642054334","9783642054341"]},"citation":{"ieee":"O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Berlin, Heidelberg: Springer, 2009, pp. 252–262.","chicago":"Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” In <i>Algorithmic Aspects of Wireless Sensor Networks</i>, 252–62. Berlin, Heidelberg: Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>.","ama":"Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: <i>Algorithmic Aspects of Wireless Sensor Networks</i>. Berlin, Heidelberg: Springer; 2009:252-262. doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>","apa":"Bonorden, O., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In <i>Algorithmic Aspects of Wireless Sensor Networks</i> (pp. 252–262). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>","short":"O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.","mla":"Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Springer, 2009, pp. 252–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>.","bibtex":"@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg}, title={Complexity and Approximation of a Geometric Local Robot Assignment Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>}, 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} }"},"page":"252-262","year":"2009","place":"Berlin, Heidelberg","author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"first_name":"Peter","full_name":"Pietrzyk, Peter","last_name":"Pietrzyk"}],"date_created":"2020-09-28T10:25:34Z","publisher":"Springer","date_updated":"2022-01-06T06:54:10Z","doi":"10.1007/978-3-642-05434-1_25","title":"Complexity and Approximation of a Geometric Local Robot Assignment Problem","type":"book_chapter","publication":"Algorithmic Aspects of Wireless Sensor Networks","status":"public","abstract":[{"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.","lang":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"19724","language":[{"iso":"eng"}]},{"type":"report","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"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"19826","file_name":"pub-hni-4130.pdf","file_size":753215,"date_created":"2020-10-01T09:47:33Z","creator":"koala","date_updated":"2020-10-01T09:47:33Z"}],"status":"public","_id":"19825","user_id":"15415","department":[{"_id":"63"}],"ddc":["000"],"file_date_updated":"2020-10-01T09:47:33Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2009","citation":{"apa":"Schindelhauer, C., Mahlmann, P., &#38; Janson, T. (2009). <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany.","mla":"Schindelhauer, Christian, et al. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. 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} }","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.","chicago":"Schindelhauer, Christian, Peter Mahlmann, and Thomas Janson. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.","ieee":"C. Schindelhauer, P. Mahlmann, and T. Janson, <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.","ama":"Schindelhauer C, Mahlmann P, Janson T. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany; 2009."},"publisher":"Paderborn, Germany","date_updated":"2022-01-06T06:54:13Z","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","last_name":"Janson","first_name":"Thomas"}],"date_created":"2020-10-01T09:47:54Z","title":"3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs"},{"language":[{"iso":"eng"}],"_id":"19830","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"journal_article","publication":"Mobile Networks and Applications (MONET)","title":"Minimal Energy Path Planning for Wireless Robots","doi":"10.1007/s11036-008-0150-5","date_updated":"2022-01-06T06:54:13Z","author":[{"full_name":"Ooi, Chia Ching","last_name":"Ooi","first_name":"Chia Ching"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"date_created":"2020-10-01T10:05:47Z","year":"2009","citation":{"bibtex":"@article{Ooi_Schindelhauer_2009, title={Minimal Energy Path Planning for Wireless Robots}, DOI={<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>}, 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.","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” <i>Mobile Networks and Applications (MONET)</i>, 2009, pp. 309–21, doi:<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>.","apa":"Ooi, C. C., &#38; Schindelhauer, C. (2009). Minimal Energy Path Planning for Wireless Robots. <i>Mobile Networks and Applications (MONET)</i>, 309–321. <a href=\"https://doi.org/10.1007/s11036-008-0150-5\">https://doi.org/10.1007/s11036-008-0150-5</a>","ama":"Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots. <i>Mobile Networks and Applications (MONET)</i>. 2009:309-321. doi:<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>","ieee":"C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless Robots,” <i>Mobile Networks and Applications (MONET)</i>, pp. 309–321, 2009.","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” <i>Mobile Networks and Applications (MONET)</i>, 2009, 309–21. <a href=\"https://doi.org/10.1007/s11036-008-0150-5\">https://doi.org/10.1007/s11036-008-0150-5</a>."},"page":"309-321","publication_status":"published","publication_identifier":{"issn":["1383-469X","1572-8153"]}},{"title":"Utilizing detours for energy conservation in mobile wireless networks","doi":"10.1007/s11235-009-9188-3","date_updated":"2022-01-06T06:54:13Z","volume":43,"author":[{"full_name":"Ooi, Chia Ching","last_name":"Ooi","first_name":"Chia Ching"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"date_created":"2020-10-01T10:10:10Z","year":"2009","page":"25-37","intvolume":"        43","citation":{"apa":"Ooi, C. C., &#38; Schindelhauer, C. (2009). Utilizing detours for energy conservation in mobile wireless networks. <i>Telecommunication Systems</i>, <i>43</i>, 25–37. <a href=\"https://doi.org/10.1007/s11235-009-9188-3\">https://doi.org/10.1007/s11235-009-9188-3</a>","bibtex":"@article{Ooi_Schindelhauer_2009, title={Utilizing detours for energy conservation in mobile wireless networks}, volume={43}, DOI={<a href=\"https://doi.org/10.1007/s11235-009-9188-3\">10.1007/s11235-009-9188-3</a>}, 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.” <i>Telecommunication Systems</i>, vol. 43, 2009, pp. 25–37, doi:<a href=\"https://doi.org/10.1007/s11235-009-9188-3\">10.1007/s11235-009-9188-3</a>.","short":"C.C. Ooi, C. Schindelhauer, Telecommunication Systems 43 (2009) 25–37.","ama":"Ooi CC, Schindelhauer C. Utilizing detours for energy conservation in mobile wireless networks. <i>Telecommunication Systems</i>. 2009;43:25-37. doi:<a href=\"https://doi.org/10.1007/s11235-009-9188-3\">10.1007/s11235-009-9188-3</a>","ieee":"C. C. Ooi and C. Schindelhauer, “Utilizing detours for energy conservation in mobile wireless networks,” <i>Telecommunication Systems</i>, vol. 43, pp. 25–37, 2009.","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.” <i>Telecommunication Systems</i> 43 (2009): 25–37. <a href=\"https://doi.org/10.1007/s11235-009-9188-3\">https://doi.org/10.1007/s11235-009-9188-3</a>."},"publication_identifier":{"issn":["1018-4864","1572-9451"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"19831","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Telecommunication Systems","type":"journal_article"},{"publication_status":"published","publication_identifier":{"isbn":["9781493928637","9781493928644"]},"citation":{"ama":"Raptopoulos CL, Nikoletseas SE, Spirakis PG. Colouring Non-sparse Random Intersection Graphs. In: <i>34st International Symposium on Mathematical Foundations of Computer Science</i>. ; 2009:600--611. doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">10.1007/978-1-4939-2864-4_597</a>","chicago":"Raptopoulos, Christoforos L., Sotiris E. Nikoletseas, and Paul G. Spirakis. “Colouring Non-Sparse Random Intersection Graphs.” In <i>34st International Symposium on Mathematical Foundations of Computer Science</i>, 600--611, 2009. <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">https://doi.org/10.1007/978-1-4939-2864-4_597</a>.","ieee":"C. L. Raptopoulos, S. E. Nikoletseas, and P. G. Spirakis, “Colouring Non-sparse Random Intersection Graphs,” in <i>34st International Symposium on Mathematical Foundations of Computer Science</i>, 2009, pp. 600--611.","apa":"Raptopoulos, C. L., Nikoletseas, S. E., &#38; Spirakis, P. G. (2009). Colouring Non-sparse Random Intersection Graphs. In <i>34st International Symposium on Mathematical Foundations of Computer Science</i> (pp. 600--611). <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">https://doi.org/10.1007/978-1-4939-2864-4_597</a>","bibtex":"@inproceedings{Raptopoulos_Nikoletseas_Spirakis_2009, title={Colouring Non-sparse Random Intersection Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">10.1007/978-1-4939-2864-4_597</a>}, 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} }","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.” <i>34st International Symposium on Mathematical Foundations of Computer Science</i>, 2009, pp. 600--611, doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">10.1007/978-1-4939-2864-4_597</a>."},"page":"600--611","year":"2009","author":[{"last_name":"Raptopoulos","full_name":"Raptopoulos, Christoforos L.","first_name":"Christoforos L."},{"full_name":"Nikoletseas, Sotiris E.","last_name":"Nikoletseas","first_name":"Sotiris E."},{"last_name":"Spirakis","full_name":"Spirakis, Paul G.","first_name":"Paul G."}],"date_created":"2020-10-06T10:09:51Z","date_updated":"2022-01-06T06:54:14Z","doi":"10.1007/978-1-4939-2864-4_597","title":"Colouring Non-sparse Random Intersection Graphs","type":"conference","publication":"34st International Symposium on Mathematical Foundations of Computer Science","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"19901","language":[{"iso":"eng"}]},{"status":"public","type":"conference","publication":" Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium","language":[{"iso":"eng"}],"_id":"19904","user_id":"15415","department":[{"_id":"63"}],"year":"2009","citation":{"ama":"Nikoletseas SE, Raptopoulos CL, Spirakis PG. Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In: <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i>. ; 2009:1--11. doi:<a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">10.1109/IPDPS.2009.5161002</a>","ieee":"S. E. Nikoletseas, C. L. Raptopoulos, and P. G. Spirakis, “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions,” in <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i>, 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 <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i>, 1--11, 2009. <a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">https://doi.org/10.1109/IPDPS.2009.5161002</a>.","apa":"Nikoletseas, S. E., Raptopoulos, C. L., &#38; Spirakis, P. G. (2009). Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i> (pp. 1--11). <a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">https://doi.org/10.1109/IPDPS.2009.5161002</a>","bibtex":"@inproceedings{Nikoletseas_Raptopoulos_Spirakis_2009, title={Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">10.1109/IPDPS.2009.5161002</a>}, booktitle={ Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium}, author={Nikoletseas, Sotiris E. and Raptopoulos, Christoforos L. and Spirakis, Paul G.}, year={2009}, pages={1--11} }","short":"S.E. Nikoletseas, C.L. Raptopoulos, P.G. Spirakis, in:  Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium, 2009, pp. 1--11.","mla":"Nikoletseas, Sotiris E., et al. “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions.” <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i>, 2009, pp. 1--11, doi:<a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">10.1109/IPDPS.2009.5161002</a>."},"page":"1--11","title":"Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions","doi":"10.1109/IPDPS.2009.5161002","date_updated":"2022-01-06T06:54:14Z","author":[{"first_name":"Sotiris E.","last_name":"Nikoletseas","full_name":"Nikoletseas, Sotiris E."},{"full_name":"Raptopoulos, Christoforos L.","last_name":"Raptopoulos","first_name":"Christoforos L."},{"full_name":"Spirakis, Paul G.","last_name":"Spirakis","first_name":"Paul G."}],"date_created":"2020-10-06T10:23:53Z"},{"author":[{"last_name":"Deveci","full_name":"Deveci, Deniz","first_name":"Deniz"},{"full_name":"Kortenjan, Michael","last_name":"Kortenjan","first_name":"Michael"},{"first_name":"Gunnar","last_name":"Schomaker","full_name":"Schomaker, Gunnar"}],"date_created":"2020-10-06T14:12:26Z","date_updated":"2022-01-06T06:54:14Z","title":"Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions","citation":{"apa":"Deveci, D., Kortenjan, M., &#38; Schomaker, G. (2009). Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions. In <i> Parallel and Distributed Computing and Systems, Nr. 21</i>.","short":"D. Deveci, M. Kortenjan, G. Schomaker, in:  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} }","mla":"Deveci, Deniz, et al. “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions.” <i> Parallel and Distributed Computing and Systems, Nr. 21</i>, 2009.","ama":"Deveci D, Kortenjan M, Schomaker G. Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions. In: <i> Parallel and Distributed Computing and Systems, Nr. 21</i>. ; 2009.","ieee":"D. Deveci, M. Kortenjan, and G. Schomaker, “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions,” in <i> Parallel and Distributed Computing and Systems, Nr. 21</i>, 2009.","chicago":"Deveci, Deniz, Michael Kortenjan, and Gunnar Schomaker. “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions.” In <i> Parallel and Distributed Computing and Systems, Nr. 21</i>, 2009."},"year":"2009","department":[{"_id":"63"},{"_id":"70"}],"user_id":"15415","_id":"19934","language":[{"iso":"eng"}],"publication":" Parallel and Distributed Computing and Systems, Nr. 21","type":"conference","status":"public"},{"year":"2009","citation":{"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: <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>. ; 2009. doi:<a href=\"https://doi.org/10.1109/iros.2009.5354056\">10.1109/iros.2009.5354056</a>","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 <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>, 2009. <a href=\"https://doi.org/10.1109/iros.2009.5354056\">https://doi.org/10.1109/iros.2009.5354056</a>.","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 <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>, 2009.","mla":"Stradner, Jürgen, et al. “Analysis and Implementation of an Artificial Homeostatic Hormone System: A First Case Study in Robotic Hardware.” <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>, 2009, doi:<a href=\"https://doi.org/10.1109/iros.2009.5354056\">10.1109/iros.2009.5354056</a>.","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={<a href=\"https://doi.org/10.1109/iros.2009.5354056\">10.1109/iros.2009.5354056</a>}, 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} }","short":"J. Stradner, H. Hamann, T. Schmickl, K. Crailsheim, in: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009.","apa":"Stradner, J., Hamann, H., Schmickl, T., &#38; Crailsheim, K. (2009). Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware. In <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>. <a href=\"https://doi.org/10.1109/iros.2009.5354056\">https://doi.org/10.1109/iros.2009.5354056</a>"},"publication_status":"published","publication_identifier":{"isbn":["9781424438037"]},"title":"Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware","doi":"10.1109/iros.2009.5354056","date_updated":"2022-01-06T06:54:25Z","date_created":"2020-11-02T14:04:46Z","author":[{"first_name":"Jürgen","last_name":"Stradner","full_name":"Stradner, Jürgen"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Thomas","last_name":"Schmickl","full_name":"Schmickl, Thomas"},{"first_name":"Karl","last_name":"Crailsheim","full_name":"Crailsheim, Karl"}],"abstract":[{"lang":"eng","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."}],"status":"public","type":"conference","publication":"2009 IEEE/RSJ International Conference on Intelligent Robots and Systems","language":[{"iso":"eng"}],"_id":"20254","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}]},{"user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20255","type":"journal_article","status":"public","author":[{"first_name":"Thomas","last_name":"Schmickl","full_name":"Schmickl, Thomas"},{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"last_name":"Wörn","full_name":"Wörn, Heinz","first_name":"Heinz"},{"last_name":"Crailsheim","full_name":"Crailsheim, Karl","first_name":"Karl"}],"volume":6,"date_updated":"2022-01-06T06:54:25Z","doi":"10.1016/j.robot.2009.06.002","publication_status":"published","publication_identifier":{"issn":["0921-8890"]},"citation":{"ama":"Schmickl T, Hamann H, Wörn H, Crailsheim K. Two different approaches to a macroscopic model of a bio-inspired robotic swarm. <i>Robotics and Autonomous Systems</i>. 2009;6(9):913-921. doi:<a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">10.1016/j.robot.2009.06.002</a>","ieee":"T. Schmickl, H. Hamann, H. Wörn, and K. Crailsheim, “Two different approaches to a macroscopic model of a bio-inspired robotic swarm,” <i>Robotics and Autonomous Systems</i>, vol. 6, no. 9, pp. 913–921, 2009.","chicago":"Schmickl, Thomas, Heiko Hamann, Heinz Wörn, and Karl Crailsheim. “Two Different Approaches to a Macroscopic Model of a Bio-Inspired Robotic Swarm.” <i>Robotics and Autonomous Systems</i> 6, no. 9 (2009): 913–21. <a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">https://doi.org/10.1016/j.robot.2009.06.002</a>.","apa":"Schmickl, T., Hamann, H., Wörn, H., &#38; Crailsheim, K. (2009). Two different approaches to a macroscopic model of a bio-inspired robotic swarm. <i>Robotics and Autonomous Systems</i>, <i>6</i>(9), 913–921. <a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">https://doi.org/10.1016/j.robot.2009.06.002</a>","bibtex":"@article{Schmickl_Hamann_Wörn_Crailsheim_2009, title={Two different approaches to a macroscopic model of a bio-inspired robotic swarm}, volume={6}, DOI={<a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">10.1016/j.robot.2009.06.002</a>}, number={9}, journal={Robotics and Autonomous Systems}, author={Schmickl, Thomas and Hamann, Heiko and Wörn, Heinz and Crailsheim, Karl}, year={2009}, pages={913–921} }","mla":"Schmickl, Thomas, et al. “Two Different Approaches to a Macroscopic Model of a Bio-Inspired Robotic Swarm.” <i>Robotics and Autonomous Systems</i>, vol. 6, no. 9, 2009, pp. 913–21, doi:<a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">10.1016/j.robot.2009.06.002</a>.","short":"T. Schmickl, H. Hamann, H. Wörn, K. Crailsheim, Robotics and Autonomous Systems 6 (2009) 913–921."},"intvolume":"         6","page":"913-921","language":[{"iso":"eng"}],"publication":"Robotics and Autonomous Systems","abstract":[{"lang":"eng","text":"By compiling macroscopic models we analyze the adaptive behavior in a swarm of autonomous robots generated by a bio-inspired, distributed control algorithm. We developed two macroscopic models by taking two different perspectives: A Stock & Flow model, which is simple to implement and fast to simulate, and a spatially resolved model based on diffusion processes. These two models were compared concerning their prediction quality and their analytical power: One model allowed easy identification of the major feedback loops governing the swarm behavior. The other model allowed analysis of the expected shapes and positions of observable robot clusters. We found a high correlation in the challenges posed by both modeling techniques and we highlighted the inherent problems of inferring emergent macroscopic rules from a microscopic description of swarm behavior."}],"date_created":"2020-11-02T14:07:44Z","title":"Two different approaches to a macroscopic model of a bio-inspired robotic swarm","issue":"9","year":"2009"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20259","status":"public","type":"conference","publication":"MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling","title":"Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"last_name":"Troch","full_name":"Troch, Inge","first_name":"Inge"},{"first_name":"F.","last_name":"Breitenecker","full_name":"Breitenecker, F."}],"date_created":"2020-11-02T14:18:27Z","date_updated":"2022-01-06T06:54:25Z","citation":{"chicago":"Hamann, Heiko, Inge Troch, and F. Breitenecker. “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System.” In <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>, 2009.","ieee":"H. Hamann, I. Troch, and F. Breitenecker, “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System,” in <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>, 2009.","ama":"Hamann H, Troch I, Breitenecker F. Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System. In: <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>. ; 2009.","apa":"Hamann, H., Troch, I., &#38; Breitenecker, F. (2009). Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System. In <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>.","mla":"Hamann, Heiko, et al. “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System.” <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>, 2009.","short":"H. Hamann, I. Troch, F. Breitenecker, in: MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.","bibtex":"@inproceedings{Hamann_Troch_Breitenecker_2009, title={Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System}, booktitle={MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling}, author={Hamann, Heiko and Troch, Inge and Breitenecker, F.}, year={2009} }"},"year":"2009"},{"type":"journal_article","publication":"Electr. Notes Theor. Comput. Sci.","status":"public","_id":"3199","user_id":"29719","department":[{"_id":"77"}],"issue":"2","year":"2009","citation":{"bibtex":"@article{Wehrheim_Wonisch_2009, title={Compositional {CSP} Traces Refinement Checking}, DOI={<a href=\"https://doi.org/10.1016/j.entcs.2009.08.022\">10.1016/j.entcs.2009.08.022</a>}, number={2}, journal={Electr. Notes Theor. Comput. Sci.}, author={Wehrheim, Heike and Wonisch, Daniel}, year={2009}, pages={135--151} }","short":"H. Wehrheim, D. Wonisch, Electr. Notes Theor. Comput. Sci. (2009) 135--151.","mla":"Wehrheim, Heike, and Daniel Wonisch. “Compositional {CSP} Traces Refinement Checking.” <i>Electr. Notes Theor. Comput. Sci.</i>, no. 2, 2009, pp. 135--151, doi:<a href=\"https://doi.org/10.1016/j.entcs.2009.08.022\">10.1016/j.entcs.2009.08.022</a>.","apa":"Wehrheim, H., &#38; Wonisch, D. (2009). Compositional {CSP} Traces Refinement Checking. <i>Electr. Notes Theor. Comput. Sci.</i>, (2), 135--151. <a href=\"https://doi.org/10.1016/j.entcs.2009.08.022\">https://doi.org/10.1016/j.entcs.2009.08.022</a>","chicago":"Wehrheim, Heike, and Daniel Wonisch. “Compositional {CSP} Traces Refinement Checking.” <i>Electr. Notes Theor. Comput. Sci.</i>, no. 2 (2009): 135--151. <a href=\"https://doi.org/10.1016/j.entcs.2009.08.022\">https://doi.org/10.1016/j.entcs.2009.08.022</a>.","ieee":"H. Wehrheim and D. Wonisch, “Compositional {CSP} Traces Refinement Checking,” <i>Electr. Notes Theor. Comput. Sci.</i>, no. 2, pp. 135--151, 2009.","ama":"Wehrheim H, Wonisch D. Compositional {CSP} Traces Refinement Checking. <i>Electr Notes Theor Comput Sci</i>. 2009;(2):135--151. doi:<a href=\"https://doi.org/10.1016/j.entcs.2009.08.022\">10.1016/j.entcs.2009.08.022</a>"},"page":"135--151","date_updated":"2022-01-06T06:59:04Z","date_created":"2018-06-13T09:24:52Z","author":[{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"},{"first_name":"Daniel","full_name":"Wonisch, Daniel","last_name":"Wonisch"}],"title":"Compositional {CSP} Traces Refinement Checking","doi":"10.1016/j.entcs.2009.08.022"},{"user_id":"29719","department":[{"_id":"77"}],"_id":"3200","type":"journal_article","publication":"Electr. Notes Theor. Comput. Sci.","status":"public","author":[{"full_name":"Ruhroth, Thomas","last_name":"Ruhroth","first_name":"Thomas"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2018-06-13T09:26:31Z","date_updated":"2022-01-06T06:59:04Z","doi":"10.1016/j.entcs.2009.12.025","title":"Static Class Elements for Object-Z","citation":{"apa":"Ruhroth, T., &#38; Wehrheim, H. (2009). Static Class Elements for Object-Z. <i>Electr. Notes Theor. Comput. Sci.</i>, 193--205. <a href=\"https://doi.org/10.1016/j.entcs.2009.12.025\">https://doi.org/10.1016/j.entcs.2009.12.025</a>","short":"T. Ruhroth, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2009) 193--205.","bibtex":"@article{Ruhroth_Wehrheim_2009, title={Static Class Elements for Object-Z}, DOI={<a href=\"https://doi.org/10.1016/j.entcs.2009.12.025\">10.1016/j.entcs.2009.12.025</a>}, journal={Electr. Notes Theor. Comput. Sci.}, author={Ruhroth, Thomas and Wehrheim, Heike}, year={2009}, pages={193--205} }","mla":"Ruhroth, Thomas, and Heike Wehrheim. “Static Class Elements for Object-Z.” <i>Electr. Notes Theor. Comput. Sci.</i>, 2009, pp. 193--205, doi:<a href=\"https://doi.org/10.1016/j.entcs.2009.12.025\">10.1016/j.entcs.2009.12.025</a>.","ieee":"T. Ruhroth and H. Wehrheim, “Static Class Elements for Object-Z,” <i>Electr. Notes Theor. Comput. Sci.</i>, pp. 193--205, 2009.","chicago":"Ruhroth, Thomas, and Heike Wehrheim. “Static Class Elements for Object-Z.” <i>Electr. Notes Theor. Comput. Sci.</i>, 2009, 193--205. <a href=\"https://doi.org/10.1016/j.entcs.2009.12.025\">https://doi.org/10.1016/j.entcs.2009.12.025</a>.","ama":"Ruhroth T, Wehrheim H. Static Class Elements for Object-Z. <i>Electr Notes Theor Comput Sci</i>. 2009:193--205. doi:<a href=\"https://doi.org/10.1016/j.entcs.2009.12.025\">10.1016/j.entcs.2009.12.025</a>"},"page":"193--205","year":"2009"},{"_id":"3201","user_id":"29719","department":[{"_id":"77"}],"type":"conference","publication":"35th Euromicro Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings","status":"public","date_updated":"2022-01-06T06:59:04Z","date_created":"2018-06-13T09:30:27Z","author":[{"first_name":"Thomas","full_name":"Ruhroth, Thomas","last_name":"Ruhroth"},{"first_name":"Hendrik","last_name":"Voigt","full_name":"Voigt, Hendrik"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"title":"Measure, Diagnose, Refactor: {A} Formal Quality Cycle for Software Models","doi":"10.1109/SEAA.2009.39","year":"2009","citation":{"apa":"Ruhroth, T., Voigt, H., &#38; Wehrheim, H. (2009). Measure, Diagnose, Refactor: {A} Formal Quality Cycle for Software Models. In <i>35th Euromicro Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings</i> (pp. 360--367). <a href=\"https://doi.org/10.1109/SEAA.2009.39\">https://doi.org/10.1109/SEAA.2009.39</a>","bibtex":"@inproceedings{Ruhroth_Voigt_Wehrheim_2009, title={Measure, Diagnose, Refactor: {A} Formal Quality Cycle for Software Models}, DOI={<a href=\"https://doi.org/10.1109/SEAA.2009.39\">10.1109/SEAA.2009.39</a>}, booktitle={35th Euromicro Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings}, author={Ruhroth, Thomas and Voigt, Hendrik and Wehrheim, Heike}, year={2009}, pages={360--367} }","short":"T. Ruhroth, H. Voigt, H. Wehrheim, in: 35th Euromicro Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings, 2009, pp. 360--367.","mla":"Ruhroth, Thomas, et al. “Measure, Diagnose, Refactor: {A} Formal Quality Cycle for Software Models.” <i>35th Euromicro Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings</i>, 2009, pp. 360--367, doi:<a href=\"https://doi.org/10.1109/SEAA.2009.39\">10.1109/SEAA.2009.39</a>.","chicago":"Ruhroth, Thomas, Hendrik Voigt, and Heike Wehrheim. “Measure, Diagnose, Refactor: {A} Formal Quality Cycle for Software Models.” In <i>35th Euromicro Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings</i>, 360--367, 2009. <a href=\"https://doi.org/10.1109/SEAA.2009.39\">https://doi.org/10.1109/SEAA.2009.39</a>.","ieee":"T. Ruhroth, H. Voigt, and H. Wehrheim, “Measure, Diagnose, Refactor: {A} Formal Quality Cycle for Software Models,” in <i>35th Euromicro Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings</i>, 2009, pp. 360--367.","ama":"Ruhroth T, Voigt H, Wehrheim H. Measure, Diagnose, Refactor: {A} Formal Quality Cycle for Software Models. In: <i>35th Euromicro Conference on Software Engineering and Advanced Applications, {SEAA} 2009, Patras, Greece, August 27-29, 2009, Proceedings</i>. ; 2009:360--367. doi:<a href=\"https://doi.org/10.1109/SEAA.2009.39\">10.1109/SEAA.2009.39</a>"},"page":"360--367"},{"department":[{"_id":"77"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science","_id":"3202","type":"conference_editor","status":"public","editor":[{"first_name":"Michael","full_name":"Leuschel, Michael","last_name":"Leuschel"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2018-06-13T09:44:34Z","date_updated":"2022-01-06T06:59:04Z","doi":"10.1007/978-3-642-00255-7","title":"Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\\\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings","publication_identifier":{"isbn":["978-3-642-00254-0"]},"citation":{"apa":"Leuschel, M., &#38; Wehrheim, H. (Eds.). (2009). <i>Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\\\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings</i>. <a href=\"https://doi.org/10.1007/978-3-642-00255-7\">https://doi.org/10.1007/978-3-642-00255-7</a>","bibtex":"@book{Leuschel_Wehrheim_2009, series={Lecture Notes in Computer Science}, title={Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\\\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-00255-7\">10.1007/978-3-642-00255-7</a>}, year={2009}, collection={Lecture Notes in Computer Science} }","mla":"Leuschel, Michael, and Heike Wehrheim, editors. <i>Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\\\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings</i>. 2009, doi:<a href=\"https://doi.org/10.1007/978-3-642-00255-7\">10.1007/978-3-642-00255-7</a>.","short":"M. Leuschel, H. Wehrheim, eds., Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\\\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings, 2009.","ama":"Leuschel M, Wehrheim H, eds. <i>Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\\\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings</i>.; 2009. doi:<a href=\"https://doi.org/10.1007/978-3-642-00255-7\">10.1007/978-3-642-00255-7</a>","ieee":"M. Leuschel and H. Wehrheim, Eds., <i>Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\\\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings</i>. 2009.","chicago":"Leuschel, Michael, and Heike Wehrheim, eds. <i>Integrated Formal Methods, 7th International Conference, {IFM} 2009, D{\\\"{u}}sseldorf, Germany, February 16-19, 2009. Proceedings</i>. Lecture Notes in Computer Science, 2009. <a href=\"https://doi.org/10.1007/978-3-642-00255-7\">https://doi.org/10.1007/978-3-642-00255-7</a>."},"year":"2009"},{"type":"bachelorsthesis","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":626531,"access_level":"closed","file_id":"2881","file_name":"2009_Schroeer_HierarchischesDurchmesserClustering.pdf","date_updated":"2018-05-25T09:07:18Z","date_created":"2018-05-25T09:07:18Z","creator":"feidens"}],"status":"public","user_id":"25078","department":[{"_id":"64"}],"_id":"2880","file_date_updated":"2018-05-25T09:07:18Z","ddc":["000"],"has_accepted_license":"1","citation":{"ieee":"C. Schröer, <i>Hierarchisches Clustering mit minimalen Cluster-Durchmessern</i>. 2009.","chicago":"Schröer, Carsten. <i>Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern</i>, 2009.","ama":"Schröer C. <i>Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern</i>.; 2009.","mla":"Schröer, Carsten. <i>Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern</i>. 2009.","short":"C. Schröer, Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern, 2009.","bibtex":"@book{Schröer_2009, title={Hierarchisches Clustering mit minimalen Cluster-Durchmessern}, author={Schröer, Carsten}, year={2009} }","apa":"Schröer, C. (2009). <i>Hierarchisches Clustering mit minimalen Cluster-Durchmessern</i>."},"year":"2009","author":[{"full_name":"Schröer, Carsten","last_name":"Schröer","first_name":"Carsten"}],"supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_created":"2018-05-25T09:07:25Z","date_updated":"2022-01-06T06:58:25Z","title":"Hierarchisches Clustering mit minimalen Cluster-Durchmessern"},{"_id":"2896","user_id":"25078","department":[{"_id":"64"}],"ddc":["000"],"file_date_updated":"2018-07-12T09:41:46Z","type":"bachelorsthesis","urn":"28960","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-07-12T09:41:46Z","creator":"feidens","date_created":"2018-05-25T09:30:58Z","file_size":1196648,"file_name":"2009_Liske_AnalyseUndEvaluationEinesIdentitaetsbasiertenSigncryptionVerfahrens.pdf","file_id":"2897","access_level":"open_access"}],"status":"public","date_updated":"2022-01-06T06:58:42Z","oa":"1","supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"author":[{"first_name":"Gennadij","full_name":"Liske, Gennadij","last_name":"Liske"}],"date_created":"2018-05-25T09:31:04Z","title":"Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens","has_accepted_license":"1","year":"2009","citation":{"bibtex":"@book{Liske_2009, title={Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens}, author={Liske, Gennadij}, year={2009} }","mla":"Liske, Gennadij. <i>Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens</i>. 2009.","short":"G. Liske, Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens, 2009.","apa":"Liske, G. (2009). <i>Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens</i>.","ieee":"G. Liske, <i>Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens</i>. 2009.","chicago":"Liske, Gennadij. <i>Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens</i>, 2009.","ama":"Liske G. <i>Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens</i>.; 2009."}},{"title":"Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2018-05-25T09:48:17Z","author":[{"first_name":"Christoph","last_name":"Scholz","full_name":"Scholz, Christoph"}],"date_updated":"2022-01-06T06:58:44Z","citation":{"apa":"Scholz, C. (2009). <i>Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen</i>.","bibtex":"@book{Scholz_2009, title={Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen}, author={Scholz, Christoph}, year={2009} }","short":"C. Scholz, Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen, 2009.","mla":"Scholz, Christoph. <i>Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen</i>. 2009.","ama":"Scholz C. <i>Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen</i>.; 2009.","ieee":"C. Scholz, <i>Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen</i>. 2009.","chicago":"Scholz, Christoph. <i>Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen</i>, 2009."},"year":"2009","has_accepted_license":"1","file_date_updated":"2018-05-25T09:48:10Z","ddc":["000"],"department":[{"_id":"64"}],"user_id":"25078","_id":"2904","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"feidens","date_created":"2018-05-25T09:48:10Z","date_updated":"2018-05-25T09:48:10Z","access_level":"closed","file_name":"2009_Scholz_DieSchwierigkeitDesKMedianClusteringsFuerBregmanDivergenzen.pdf","file_id":"2905","file_size":844164}],"type":"mastersthesis"},{"_id":"2911","user_id":"25078","department":[{"_id":"64"}],"type":"dissertation","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:46Z","author":[{"first_name":"Marcel Rudolf","last_name":"Ackermann","full_name":"Ackermann, Marcel Rudolf"}],"supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_created":"2018-05-25T10:48:51Z","title":"Algorithms for the Bregman k-Median Problem","main_file_link":[{"url":"http://digital.ub.uni-paderborn.de/hs/content/titleinfo/1561"}],"year":"2009","citation":{"bibtex":"@book{Ackermann_2009, title={Algorithms for the Bregman k-Median Problem}, publisher={Universität Paderborn}, author={Ackermann, Marcel Rudolf}, year={2009} }","mla":"Ackermann, Marcel Rudolf. <i>Algorithms for the Bregman K-Median Problem</i>. Universität Paderborn, 2009.","short":"M.R. Ackermann, Algorithms for the Bregman K-Median Problem, Universität Paderborn, 2009.","apa":"Ackermann, M. R. (2009). <i>Algorithms for the Bregman k-Median Problem</i>. Universität Paderborn.","chicago":"Ackermann, Marcel Rudolf. <i>Algorithms for the Bregman K-Median Problem</i>. Universität Paderborn, 2009.","ieee":"M. R. Ackermann, <i>Algorithms for the Bregman k-Median Problem</i>. Universität Paderborn, 2009.","ama":"Ackermann MR. <i>Algorithms for the Bregman K-Median Problem</i>. Universität Paderborn; 2009."}},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642040511","9783642040528"]},"publication_status":"published","page":"300-301","citation":{"mla":"Kakvi, Saqib. “Reinforcement Learning for Blackjack.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2009, pp. 300–01, doi:<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>.","bibtex":"@inbook{Kakvi_2009, place={Berlin, Heidelberg}, title={Reinforcement Learning for Blackjack}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Kakvi, Saqib}, year={2009}, pages={300–301} }","short":"S. Kakvi, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 300–301.","apa":"Kakvi, S. (2009). Reinforcement Learning for Blackjack. In <i>Lecture Notes in Computer Science</i> (pp. 300–301). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">https://doi.org/10.1007/978-3-642-04052-8_43</a>","ama":"Kakvi S. Reinforcement Learning for Blackjack. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:300-301. doi:<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>","ieee":"S. Kakvi, “Reinforcement Learning for Blackjack,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 300–301.","chicago":"Kakvi, Saqib. “Reinforcement Learning for Blackjack.” In <i>Lecture Notes in Computer Science</i>, 300–301. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">https://doi.org/10.1007/978-3-642-04052-8_43</a>."},"year":"2009","place":"Berlin, Heidelberg","date_created":"2018-05-25T12:38:01Z","author":[{"last_name":"Kakvi","full_name":"Kakvi, Saqib","first_name":"Saqib"}],"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:47Z","doi":"10.1007/978-3-642-04052-8_43","title":"Reinforcement Learning for Blackjack","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","department":[{"_id":"558"}],"user_id":"25078","_id":"2920","extern":"1"},{"type":"book_chapter","publication":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","status":"public","user_id":"25078","department":[{"_id":"64"}],"_id":"2995","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9780898716801","9781611973068"]},"citation":{"chicago":"Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” In <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1088–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. <a href=\"https://doi.org/10.1137/1.9781611973068.118\">https://doi.org/10.1137/1.9781611973068.118</a>.","ieee":"M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman Divergences,” in <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009, pp. 1088–1097.","ama":"Ackermann MR, Blömer J. Coresets and Approximate Clustering for Bregman Divergences. In: <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Philadelphia, PA: Society for Industrial and Applied Mathematics; 2009:1088-1097. doi:<a href=\"https://doi.org/10.1137/1.9781611973068.118\">10.1137/1.9781611973068.118</a>","bibtex":"@inbook{Ackermann_Blömer_2009, place={Philadelphia, PA}, title={Coresets and Approximate Clustering for Bregman Divergences}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973068.118\">10.1137/1.9781611973068.118</a>}, booktitle={Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms}, publisher={Society for Industrial and Applied Mathematics}, author={Ackermann, Marcel R. and Blömer, Johannes}, year={2009}, pages={1088–1097} }","short":"M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009, pp. 1088–1097.","mla":"Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2009, pp. 1088–97, doi:<a href=\"https://doi.org/10.1137/1.9781611973068.118\">10.1137/1.9781611973068.118</a>.","apa":"Ackermann, M. R., &#38; Blömer, J. (2009). Coresets and Approximate Clustering for Bregman Divergences. In <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1088–1097). Philadelphia, PA: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973068.118\">https://doi.org/10.1137/1.9781611973068.118</a>"},"page":"1088-1097","year":"2009","place":"Philadelphia, PA","date_created":"2018-06-05T08:05:17Z","author":[{"last_name":"Ackermann","full_name":"Ackermann, Marcel R.","first_name":"Marcel R."},{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"date_updated":"2022-01-06T06:58:50Z","publisher":"Society for Industrial and Applied Mathematics","doi":"10.1137/1.9781611973068.118","title":"Coresets and Approximate Clustering for Bregman Divergences"}]