[{"publication":"Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)","type":"conference","status":"public","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278","_id":"2193","project":[{"name":"Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling Models","_id":"30","grant_number":"01|H11004A"}],"language":[{"iso":"eng"}],"quality_controlled":"1","page":"223-226","citation":{"short":"T. Beisel, T. Wiersema, C. Plessl, A. Brinkmann, in: Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP), IEEE Computer Society, 2011, pp. 223–226.","bibtex":"@inproceedings{Beisel_Wiersema_Plessl_Brinkmann_2011, title={Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler}, DOI={<a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">10.1109/ASAP.2011.6043273</a>}, booktitle={Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)}, publisher={IEEE Computer Society}, author={Beisel, Tobias and Wiersema, Tobias and Plessl, Christian and Brinkmann, André}, year={2011}, pages={223–226} }","mla":"Beisel, Tobias, et al. “Cooperative Multitasking for Heterogeneous Accelerators in the Linux Completely Fair Scheduler.” <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, IEEE Computer Society, 2011, pp. 223–26, doi:<a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">10.1109/ASAP.2011.6043273</a>.","apa":"Beisel, T., Wiersema, T., Plessl, C., &#38; Brinkmann, A. (2011). Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler. <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, 223–226. <a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">https://doi.org/10.1109/ASAP.2011.6043273</a>","ama":"Beisel T, Wiersema T, Plessl C, Brinkmann A. Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler. In: <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>. IEEE Computer Society; 2011:223-226. doi:<a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">10.1109/ASAP.2011.6043273</a>","ieee":"T. Beisel, T. Wiersema, C. Plessl, and A. Brinkmann, “Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler,” in <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, 2011, pp. 223–226, doi: <a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">10.1109/ASAP.2011.6043273</a>.","chicago":"Beisel, Tobias, Tobias Wiersema, Christian Plessl, and André Brinkmann. “Cooperative Multitasking for Heterogeneous Accelerators in the Linux Completely Fair Scheduler.” In <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, 223–26. IEEE Computer Society, 2011. <a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">https://doi.org/10.1109/ASAP.2011.6043273</a>."},"year":"2011","author":[{"first_name":"Tobias","full_name":"Beisel, Tobias","last_name":"Beisel"},{"first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118","last_name":"Wiersema"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"}],"date_created":"2018-04-03T14:37:14Z","publisher":"IEEE Computer Society","date_updated":"2023-09-26T13:43:48Z","doi":"10.1109/ASAP.2011.6043273","title":"Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler"},{"project":[{"grant_number":"160364472","name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"257906","_id":"31","name":"Engineering Proprioception in Computing Systems"}],"_id":"656","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"ddc":["040"],"file_date_updated":"2018-03-14T13:49:39Z","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)","abstract":[{"text":"In the next decades, hybrid multi-cores will be the predominant architecture for reconfigurable FPGA-based systems. Temperature-aware thread mapping strategies are key for providing dependability in such systems. These strategies rely on measuring the temperature distribution and redicting the thermal behavior of the system when there are changes to the hardware and software running on the FPGA. While there are a number of tools that use thermal models to predict temperature distributions at design time, these tools lack the flexibility to autonomously adjust to changing FPGA configurations. To address this problem we propose a temperature-aware system that empowers FPGA-based reconfigurable multi-cores to autonomously predict the on-chip temperature distribution for pro-active thread remapping. Our system obtains temperature measurements through a self-calibrating grid of sensors and uses area constrained heat-generating circuits in order to generate spatial and temporal temperature gradients. The generated temperature variations are then used to learn the free parameters of the system's thermal model. The system thus acquires an understanding of its own thermal characteristics. We implemented an FPGA system containing a net of 144 temperature sensors on a Xilinx Virtex-6 LX240T FPGA that is aware of its thermal model. Finally, we show that the temperature predictions vary less than 0.72 degree C on average compared to the measured temperature distributions at run-time.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-14T13:49:39Z","date_updated":"2018-03-14T13:49:39Z","file_name":"656-2011_happe_reconfig.pdf","access_level":"closed","file_id":"1220","file_size":502244}],"status":"public","date_updated":"2023-09-26T13:46:08Z","publisher":"IEEE","author":[{"last_name":"Happe","full_name":"Happe, Markus","first_name":"Markus"},{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"full_name":"Plessl, Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"date_created":"2017-10-17T12:42:59Z","title":"Measuring and Predicting Temperature Distributions on FPGAs at Run-Time","doi":"10.1109/ReConFig.2011.59","has_accepted_license":"1","quality_controlled":"1","year":"2011","citation":{"chicago":"Happe, Markus, Andreas Agne, and Christian Plessl. “Measuring and Predicting Temperature Distributions on FPGAs at Run-Time.” In <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 55–60. IEEE, 2011. <a href=\"https://doi.org/10.1109/ReConFig.2011.59\">https://doi.org/10.1109/ReConFig.2011.59</a>.","ieee":"M. Happe, A. Agne, and C. Plessl, “Measuring and Predicting Temperature Distributions on FPGAs at Run-Time,” in <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 2011, pp. 55–60, doi: <a href=\"https://doi.org/10.1109/ReConFig.2011.59\">10.1109/ReConFig.2011.59</a>.","ama":"Happe M, Agne A, Plessl C. Measuring and Predicting Temperature Distributions on FPGAs at Run-Time. In: <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2011:55-60. doi:<a href=\"https://doi.org/10.1109/ReConFig.2011.59\">10.1109/ReConFig.2011.59</a>","apa":"Happe, M., Agne, A., &#38; Plessl, C. (2011). Measuring and Predicting Temperature Distributions on FPGAs at Run-Time. <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 55–60. <a href=\"https://doi.org/10.1109/ReConFig.2011.59\">https://doi.org/10.1109/ReConFig.2011.59</a>","mla":"Happe, Markus, et al. “Measuring and Predicting Temperature Distributions on FPGAs at Run-Time.” <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2011, pp. 55–60, doi:<a href=\"https://doi.org/10.1109/ReConFig.2011.59\">10.1109/ReConFig.2011.59</a>.","short":"M. Happe, A. Agne, C. Plessl, in: Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig), IEEE, 2011, pp. 55–60.","bibtex":"@inproceedings{Happe_Agne_Plessl_2011, title={Measuring and Predicting Temperature Distributions on FPGAs at Run-Time}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2011.59\">10.1109/ReConFig.2011.59</a>}, booktitle={Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Happe, Markus and Agne, Andreas and Plessl, Christian}, year={2011}, pages={55–60} }"},"page":"55-60"},{"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278","_id":"2200","language":[{"iso":"eng"}],"keyword":["design space exploration","LLVM","partitioning","performance","estimation","funding-intel"],"publication":"Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)","type":"conference","status":"public","author":[{"last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"},{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian"},{"full_name":"Kauschke, Michael","last_name":"Kauschke","first_name":"Michael"}],"date_created":"2018-04-03T15:08:13Z","publisher":"ACM","date_updated":"2023-09-26T13:45:04Z","doi":"10.1145/1950413.1950448","title":"Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures","publication_identifier":{"isbn":["978-1-4503-0554-9"]},"quality_controlled":"1","page":"177-180","citation":{"ama":"Kenter T, Platzner M, Plessl C, Kauschke M. Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures. In: <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>. ACM; 2011:177-180. doi:<a href=\"https://doi.org/10.1145/1950413.1950448\">10.1145/1950413.1950448</a>","ieee":"T. Kenter, M. Platzner, C. Plessl, and M. Kauschke, “Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures,” in <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, 2011, pp. 177–180, doi: <a href=\"https://doi.org/10.1145/1950413.1950448\">10.1145/1950413.1950448</a>.","chicago":"Kenter, Tobias, Marco Platzner, Christian Plessl, and Michael Kauschke. “Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures.” In <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, 177–80. New York, NY, USA: ACM, 2011. <a href=\"https://doi.org/10.1145/1950413.1950448\">https://doi.org/10.1145/1950413.1950448</a>.","apa":"Kenter, T., Platzner, M., Plessl, C., &#38; Kauschke, M. (2011). Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures. <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, 177–180. <a href=\"https://doi.org/10.1145/1950413.1950448\">https://doi.org/10.1145/1950413.1950448</a>","mla":"Kenter, Tobias, et al. “Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures.” <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, ACM, 2011, pp. 177–80, doi:<a href=\"https://doi.org/10.1145/1950413.1950448\">10.1145/1950413.1950448</a>.","bibtex":"@inproceedings{Kenter_Platzner_Plessl_Kauschke_2011, place={New York, NY, USA}, title={Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures}, DOI={<a href=\"https://doi.org/10.1145/1950413.1950448\">10.1145/1950413.1950448</a>}, booktitle={Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)}, publisher={ACM}, author={Kenter, Tobias and Platzner, Marco and Plessl, Christian and Kauschke, Michael}, year={2011}, pages={177–180} }","short":"T. Kenter, M. Platzner, C. Plessl, M. Kauschke, in: Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA), ACM, New York, NY, USA, 2011, pp. 177–180."},"place":"New York, NY, USA","year":"2011"},{"language":[{"iso":"eng"}],"keyword":["funding-altera"],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278","_id":"2201","status":"public","publication":"Int. Journal of Recon- figurable Computing (IJRC)","type":"journal_article","doi":"10.1155/2011/760954","title":"FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study","date_created":"2018-04-03T15:09:49Z","author":[{"first_name":"Tobias","full_name":"Schumacher, Tobias","last_name":"Schumacher"},{"first_name":"Tim","full_name":"Süß, Tim","last_name":"Süß"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"date_updated":"2023-09-26T13:45:46Z","publisher":"Hindawi Publishing Corp.","citation":{"apa":"Schumacher, T., Süß, T., Plessl, C., &#38; Platzner, M. (2011). FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study. <i>Int. Journal of Recon- Figurable Computing (IJRC)</i>. <a href=\"https://doi.org/10.1155/2011/760954\">https://doi.org/10.1155/2011/760954</a>","short":"T. Schumacher, T. Süß, C. Plessl, M. Platzner, Int. Journal of Recon- Figurable Computing (IJRC) (2011).","mla":"Schumacher, Tobias, et al. “FPGA Acceleration of Communication-Bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study.” <i>Int. Journal of Recon- Figurable Computing (IJRC)</i>, Hindawi Publishing Corp., 2011, doi:<a href=\"https://doi.org/10.1155/2011/760954\">10.1155/2011/760954</a>.","bibtex":"@article{Schumacher_Süß_Plessl_Platzner_2011, title={FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study}, DOI={<a href=\"https://doi.org/10.1155/2011/760954\">10.1155/2011/760954</a>}, journal={Int. Journal of Recon- figurable Computing (IJRC)}, publisher={Hindawi Publishing Corp.}, author={Schumacher, Tobias and Süß, Tim and Plessl, Christian and Platzner, Marco}, year={2011} }","ama":"Schumacher T, Süß T, Plessl C, Platzner M. FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study. <i>Int Journal of Recon- figurable Computing (IJRC)</i>. Published online 2011. doi:<a href=\"https://doi.org/10.1155/2011/760954\">10.1155/2011/760954</a>","ieee":"T. Schumacher, T. Süß, C. Plessl, and M. Platzner, “FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study,” <i>Int. Journal of Recon- figurable Computing (IJRC)</i>, 2011, doi: <a href=\"https://doi.org/10.1155/2011/760954\">10.1155/2011/760954</a>.","chicago":"Schumacher, Tobias, Tim Süß, Christian Plessl, and Marco Platzner. “FPGA Acceleration of Communication-Bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study.” <i>Int. Journal of Recon- Figurable Computing (IJRC)</i>, 2011. <a href=\"https://doi.org/10.1155/2011/760954\">https://doi.org/10.1155/2011/760954</a>."},"year":"2011","quality_controlled":"1"},{"language":[{"iso":"eng"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278","_id":"2198","status":"public","publication":"Proc. Reconfigurable Architectures Workshop (RAW)","type":"conference","doi":"10.1109/IPDPS.2011.153","title":"Just-in-time Instruction Set Extension – Feasibility and Limitations for an FPGA-based Reconfigurable ASIP Architecture","date_created":"2018-04-03T15:05:52Z","author":[{"first_name":"Mariusz","full_name":"Grad, Mariusz","last_name":"Grad"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","full_name":"Plessl, Christian"}],"date_updated":"2023-09-26T13:44:39Z","publisher":"IEEE Computer Society","page":"278-285","citation":{"apa":"Grad, M., &#38; Plessl, C. (2011). Just-in-time Instruction Set Extension – Feasibility and Limitations for an FPGA-based Reconfigurable ASIP Architecture. <i>Proc. Reconfigurable Architectures Workshop (RAW)</i>, 278–285. <a href=\"https://doi.org/10.1109/IPDPS.2011.153\">https://doi.org/10.1109/IPDPS.2011.153</a>","mla":"Grad, Mariusz, and Christian Plessl. “Just-in-Time Instruction Set Extension – Feasibility and Limitations for an FPGA-Based Reconfigurable ASIP Architecture.” <i>Proc. Reconfigurable Architectures Workshop (RAW)</i>, IEEE Computer Society, 2011, pp. 278–85, doi:<a href=\"https://doi.org/10.1109/IPDPS.2011.153\">10.1109/IPDPS.2011.153</a>.","bibtex":"@inproceedings{Grad_Plessl_2011, title={Just-in-time Instruction Set Extension – Feasibility and Limitations for an FPGA-based Reconfigurable ASIP Architecture}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2011.153\">10.1109/IPDPS.2011.153</a>}, booktitle={Proc. Reconfigurable Architectures Workshop (RAW)}, publisher={IEEE Computer Society}, author={Grad, Mariusz and Plessl, Christian}, year={2011}, pages={278–285} }","short":"M. Grad, C. Plessl, in: Proc. Reconfigurable Architectures Workshop (RAW), IEEE Computer Society, 2011, pp. 278–285.","chicago":"Grad, Mariusz, and Christian Plessl. “Just-in-Time Instruction Set Extension – Feasibility and Limitations for an FPGA-Based Reconfigurable ASIP Architecture.” In <i>Proc. Reconfigurable Architectures Workshop (RAW)</i>, 278–85. IEEE Computer Society, 2011. <a href=\"https://doi.org/10.1109/IPDPS.2011.153\">https://doi.org/10.1109/IPDPS.2011.153</a>.","ieee":"M. Grad and C. Plessl, “Just-in-time Instruction Set Extension – Feasibility and Limitations for an FPGA-based Reconfigurable ASIP Architecture,” in <i>Proc. Reconfigurable Architectures Workshop (RAW)</i>, 2011, pp. 278–285, doi: <a href=\"https://doi.org/10.1109/IPDPS.2011.153\">10.1109/IPDPS.2011.153</a>.","ama":"Grad M, Plessl C. Just-in-time Instruction Set Extension – Feasibility and Limitations for an FPGA-based Reconfigurable ASIP Architecture. In: <i>Proc. Reconfigurable Architectures Workshop (RAW)</i>. IEEE Computer Society; 2011:278-285. doi:<a href=\"https://doi.org/10.1109/IPDPS.2011.153\">10.1109/IPDPS.2011.153</a>"},"year":"2011","quality_controlled":"1"},{"_id":"37002","department":[{"_id":"672"}],"user_id":"5786","keyword":["Hardware design languages","Cost function","Computational modeling","Fault detection","Data models","Analytical models","Testing"],"language":[{"iso":"eng"}],"publication":"Proceedings of Euromicro DSD 2011","type":"conference","abstract":[{"text":"HDL-mutation based fault injection and analysis is considered as an important coverage metric for measuring the quality of design simulation processes [20, 3, 1, 2]. In this work, we try to solve the problem of automatic simulation data generation targeting HDL mutation faults. We follow a search based approach and eliminate the need for symbolic execution and mathematical constraint solving from existing work. An objective cost function is defined on the test input space and serves the guidance of search for fault-detecting test data. This is done by first mapping the simulation traces under a test onto a control and data flow graph structure which is extracted from the design. Then the progress of fault detection can be measured quantitatively on this graph to be the cost value. By minimizing this cost we approach the target test data. The effectiveness of the cost function is investigated under an example neighborhood search scheme. Case study with a floating point arithmetic IP design has shown that the cost function is able to guide effectively the search procedure towards a fault-detecting test. The cost calculation time as the search overhead was also observed to be minor compared to the actual design simulation time.","lang":"eng"}],"status":"public","publisher":"IEEE","date_updated":"2025-02-26T14:44:15Z","author":[{"first_name":"Tao","last_name":"Xie","full_name":"Xie, Tao"},{"id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang"},{"last_name":"Letombe","full_name":"Letombe, Florian","first_name":"Florian"}],"date_created":"2023-01-17T09:02:48Z","title":"HDL-Mutation Based Simulation Data Generation by Propagation Guided Search","doi":"10.1109/DSD.2011.83","publication_identifier":{"isbn":["978-1-4577-1048-3"]},"place":"Oulu, Finnland","year":"2011","citation":{"apa":"Xie, T., Müller, W., &#38; Letombe, F. (2011). HDL-Mutation Based Simulation Data Generation by Propagation Guided Search. <i>Proceedings of Euromicro DSD 2011</i>. <a href=\"https://doi.org/10.1109/DSD.2011.83\">https://doi.org/10.1109/DSD.2011.83</a>","short":"T. Xie, W. Müller, F. Letombe, in: Proceedings of Euromicro DSD 2011, IEEE, Oulu, Finnland, 2011.","bibtex":"@inproceedings{Xie_Müller_Letombe_2011, place={Oulu, Finnland}, title={HDL-Mutation Based Simulation Data Generation by Propagation Guided Search}, DOI={<a href=\"https://doi.org/10.1109/DSD.2011.83\">10.1109/DSD.2011.83</a>}, booktitle={Proceedings of Euromicro DSD 2011}, publisher={IEEE}, author={Xie, Tao and Müller, Wolfgang and Letombe, Florian}, year={2011} }","mla":"Xie, Tao, et al. “HDL-Mutation Based Simulation Data Generation by Propagation Guided Search.” <i>Proceedings of Euromicro DSD 2011</i>, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/DSD.2011.83\">10.1109/DSD.2011.83</a>.","ieee":"T. Xie, W. Müller, and F. Letombe, “HDL-Mutation Based Simulation Data Generation by Propagation Guided Search,” 2011, doi: <a href=\"https://doi.org/10.1109/DSD.2011.83\">10.1109/DSD.2011.83</a>.","chicago":"Xie, Tao, Wolfgang Müller, and Florian Letombe. “HDL-Mutation Based Simulation Data Generation by Propagation Guided Search.” In <i>Proceedings of Euromicro DSD 2011</i>. Oulu, Finnland: IEEE, 2011. <a href=\"https://doi.org/10.1109/DSD.2011.83\">https://doi.org/10.1109/DSD.2011.83</a>.","ama":"Xie T, Müller W, Letombe F. HDL-Mutation Based Simulation Data Generation by Propagation Guided Search. In: <i>Proceedings of Euromicro DSD 2011</i>. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/DSD.2011.83\">10.1109/DSD.2011.83</a>"}},{"status":"public","type":"journal_article","extern":"1","_id":"60461","department":[{"_id":"969"}],"user_id":"117512","intvolume":"        30","page":"623-632","citation":{"apa":"Campen, M., &#38; Kobbelt, L. (2011). Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations. <i>Computer Graphics Forum</i>, <i>30</i>(2), 623–632. <a href=\"https://doi.org/10.1111/j.1467-8659.2011.01896.x\">https://doi.org/10.1111/j.1467-8659.2011.01896.x</a>","mla":"Campen, Marcel, and Leif Kobbelt. “Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations.” <i>Computer Graphics Forum</i>, vol. 30, no. 2, Wiley, 2011, pp. 623–32, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2011.01896.x\">10.1111/j.1467-8659.2011.01896.x</a>.","short":"M. Campen, L. Kobbelt, Computer Graphics Forum 30 (2011) 623–632.","bibtex":"@article{Campen_Kobbelt_2011, title={Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations}, volume={30}, DOI={<a href=\"https://doi.org/10.1111/j.1467-8659.2011.01896.x\">10.1111/j.1467-8659.2011.01896.x</a>}, number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Campen, Marcel and Kobbelt, Leif}, year={2011}, pages={623–632} }","chicago":"Campen, Marcel, and Leif Kobbelt. “Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations.” <i>Computer Graphics Forum</i> 30, no. 2 (2011): 623–32. <a href=\"https://doi.org/10.1111/j.1467-8659.2011.01896.x\">https://doi.org/10.1111/j.1467-8659.2011.01896.x</a>.","ieee":"M. Campen and L. Kobbelt, “Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations,” <i>Computer Graphics Forum</i>, vol. 30, no. 2, pp. 623–632, 2011, doi: <a href=\"https://doi.org/10.1111/j.1467-8659.2011.01896.x\">10.1111/j.1467-8659.2011.01896.x</a>.","ama":"Campen M, Kobbelt L. Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations. <i>Computer Graphics Forum</i>. 2011;30(2):623-632. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2011.01896.x\">10.1111/j.1467-8659.2011.01896.x</a>"},"publication_identifier":{"issn":["0167-7055","1467-8659"]},"publication_status":"published","doi":"10.1111/j.1467-8659.2011.01896.x","date_updated":"2025-07-14T12:35:50Z","volume":30,"author":[{"first_name":"Marcel","id":"114904","full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","last_name":"Campen"},{"first_name":"Leif","full_name":"Kobbelt, Leif","last_name":"Kobbelt"}],"abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshes are usually assumed to be well‐structured and manifold. In practice, however, they often contain defects like holes, gaps, degeneracies, non‐manifold configurations – or they might even be just a soup of polygons. The task of repairing these defects is computationally complex and in many cases exhibits various ambiguities demanding tedious manual efforts. We present a computational framework that enables the computation of meaningful approximate intrinsic distances and geodesic paths on raw meshes in a way which is tolerant to such defects. Holes and gaps are bridged up to a user‐specified tolerance threshold such that distances can be computed plausibly even across multiple connected components of inconsistent meshes. Further, we show ways to locally parameterize a surface based on geodesic distance fields, easily facilitating the application of textures and decals on raw meshes. We do all this without explicitly repairing the input, thereby avoiding the costly additional efforts. In order to enable broad applicability we provide details on two implementation variants, one optimized for performance, the other optimized for memory efficiency. Using the presented framework many applications can readily be extended to deal with imperfect meshes. Since we abstract from the input applicability is not even limited to meshes, other representations can be handled as well.</jats:p>"}],"publication":"Computer Graphics Forum","language":[{"iso":"eng"}],"year":"2011","issue":"2","title":"Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations","publisher":"Wiley","date_created":"2025-06-30T08:14:56Z"},{"status":"public","type":"journal_article","publication":"Motor control","user_id":"103682","department":[{"_id":"819"}],"_id":"52867","citation":{"ama":"Grimme B, Fuchs S, Perrier P, Schöner G. Limb versus speech motor control: A conceptual review. <i>Motor control</i>. 2011;15(1):5–33.","chicago":"Grimme, Britta, Susanne Fuchs, Pascal Perrier, and Gregor Schöner. “Limb versus Speech Motor Control: A Conceptual Review.” <i>Motor Control</i> 15, no. 1 (2011): 5–33.","ieee":"B. Grimme, S. Fuchs, P. Perrier, and G. Schöner, “Limb versus speech motor control: A conceptual review,” <i>Motor control</i>, vol. 15, no. 1, pp. 5–33, 2011.","bibtex":"@article{Grimme_Fuchs_Perrier_Schöner_2011, title={Limb versus speech motor control: A conceptual review}, volume={15}, number={1}, journal={Motor control}, publisher={Human Kinetics, Inc.}, author={Grimme, Britta and Fuchs, Susanne and Perrier, Pascal and Schöner, Gregor}, year={2011}, pages={5–33} }","mla":"Grimme, Britta, et al. “Limb versus Speech Motor Control: A Conceptual Review.” <i>Motor Control</i>, vol. 15, no. 1, Human Kinetics, Inc., 2011, pp. 5–33.","short":"B. Grimme, S. Fuchs, P. Perrier, G. Schöner, Motor Control 15 (2011) 5–33.","apa":"Grimme, B., Fuchs, S., Perrier, P., &#38; Schöner, G. (2011). Limb versus speech motor control: A conceptual review. <i>Motor Control</i>, <i>15</i>(1), 5–33."},"intvolume":"        15","page":"5–33","year":"2011","issue":"1","title":"Limb versus speech motor control: A conceptual review","author":[{"last_name":"Grimme","full_name":"Grimme, Britta","first_name":"Britta"},{"first_name":"Susanne","last_name":"Fuchs","full_name":"Fuchs, Susanne"},{"first_name":"Pascal","last_name":"Perrier","full_name":"Perrier, Pascal"},{"first_name":"Gregor","full_name":"Schöner, Gregor","last_name":"Schöner"}],"date_created":"2024-03-25T14:55:45Z","volume":15,"publisher":"Human Kinetics, Inc.","date_updated":"2026-03-19T07:49:26Z"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"15415","_id":"19678","status":"public","publication":"Workshop on Approximation and Online Algorithms (WAOA)","type":"conference","doi":"10.1007/978-3-642-18318-8_5","title":"The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers","volume":6534,"date_created":"2020-09-24T14:13:19Z","author":[{"first_name":"Patrick","full_name":"Briest, Patrick","last_name":"Briest"},{"last_name":"Röglin","full_name":"Röglin, Heiko","first_name":"Heiko"}],"publisher":"Springer","date_updated":"2022-01-06T06:54:09Z","intvolume":"      6534","citation":{"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={<a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">10.1007/978-3-642-18318-8_5</a>}, 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.","mla":"Briest, Patrick, and Heiko Röglin. “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.” <i>Workshop on Approximation and Online Algorithms (WAOA)</i>, vol. 6534, Springer, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">10.1007/978-3-642-18318-8_5</a>.","apa":"Briest, P., &#38; Röglin, H. (2010). The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In <i>Workshop on Approximation and Online Algorithms (WAOA)</i> (Vol. 6534). Springer. <a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">https://doi.org/10.1007/978-3-642-18318-8_5</a>","chicago":"Briest, Patrick, and Heiko Röglin. “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.” In <i>Workshop on Approximation and Online Algorithms (WAOA)</i>, Vol. 6534. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">https://doi.org/10.1007/978-3-642-18318-8_5</a>.","ieee":"P. Briest and H. Röglin, “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers,” in <i>Workshop on Approximation and Online Algorithms (WAOA)</i>, 2010, vol. 6534.","ama":"Briest P, Röglin H. The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In: <i>Workshop on Approximation and Online Algorithms (WAOA)</i>. Vol 6534. Lecture Notes in Computer Science. Springer; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">10.1007/978-3-642-18318-8_5</a>"},"year":"2010"},{"year":"2010","citation":{"ama":"Degener B, Pietrzyk P, Kempkes B. A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In: <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">10.1109/IPDPS.2010.5470349</a>","chicago":"Degener, Bastian, Peter Pietrzyk, and Barbara Kempkes. “A Local, Distributed Constant-Factor Approximation Algorithm for the Dynamic Facility Location Problem .” In <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, 2010. <a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">https://doi.org/10.1109/IPDPS.2010.5470349</a>.","ieee":"B. Degener, P. Pietrzyk, and B. Kempkes, “A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ,” in <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, 2010.","short":"B. Degener, P. Pietrzyk, B. Kempkes, in: International Parallel &#38; Distributed Processing Symposium (IPDPS), 2010.","mla":"Degener, Bastian, et al. “A Local, Distributed Constant-Factor Approximation Algorithm for the Dynamic Facility Location Problem .” <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, 2010, doi:<a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">10.1109/IPDPS.2010.5470349</a>.","bibtex":"@inproceedings{Degener_Pietrzyk_Kempkes_2010, title={A local, distributed constant-factor approximation algorithm for the dynamic facility location problem }, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">10.1109/IPDPS.2010.5470349</a>}, booktitle={International Parallel &#38; Distributed Processing Symposium (IPDPS)}, author={Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}, year={2010} }","apa":"Degener, B., Pietrzyk, P., &#38; Kempkes, B. (2010). A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">https://doi.org/10.1109/IPDPS.2010.5470349</a>"},"title":"A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ","doi":"10.1109/IPDPS.2010.5470349","date_updated":"2022-01-06T06:54:10Z","date_created":"2020-09-28T08:25:37Z","author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Peter","full_name":"Pietrzyk, Peter","last_name":"Pietrzyk"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"}],"status":"public","type":"conference","publication":"International Parallel & Distributed Processing Symposium (IPDPS)","language":[{"iso":"eng"}],"_id":"19711","user_id":"15415","department":[{"_id":"63"}]},{"date_updated":"2022-01-06T06:54:12Z","volume":5873,"author":[{"full_name":"Mense, Mario","last_name":"Mense","first_name":"Mario"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"date_created":"2020-09-30T12:12:33Z","title":"Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks","doi":"10.1007/978-3-642-05118-0_43","publication_identifier":{"isbn":["9783642051173","9783642051180"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2010","page":"624--639","intvolume":"      5873","citation":{"chicago":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” In <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 5873:624--639. Lecture Notes in Computer Science, 2010. <a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">https://doi.org/10.1007/978-3-642-05118-0_43</a>.","ieee":"M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks,” in <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2010, vol. 5873, pp. 624--639.","ama":"Mense M, Schindelhauer C. Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In: <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>. Vol 5873. Lecture Notes in Computer Science. ; 2010:624--639. doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>","apa":"Mense, M., &#38; Schindelhauer, C. (2010). Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i> (Vol. 5873, pp. 624--639). <a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">https://doi.org/10.1007/978-3-642-05118-0_43</a>","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={<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>}, 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} }","mla":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, vol. 5873, 2010, pp. 624--639, doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>.","short":"M. Mense, C. Schindelhauer, in: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, pp. 624--639."},"_id":"19796","department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems","type":"conference","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."}],"status":"public"},{"language":[{"iso":"eng"}],"_id":"19824","department":[{"_id":"63"}],"user_id":"15415","abstract":[{"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.","lang":"eng"}],"status":"public","publication":"Proceedings of the 16th International Conference on Parallel and Distributed Systems","type":"conference","title":"A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","doi":"10.1109/icpads.2010.42","date_updated":"2022-01-06T06:54:13Z","author":[{"first_name":"Thomas","last_name":"Janson","full_name":"Janson, Thomas"},{"full_name":"Mahlmann, Peter","last_name":"Mahlmann","first_name":"Peter"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"date_created":"2020-10-01T09:39:13Z","year":"2010","citation":{"apa":"Janson, T., Mahlmann, P., &#38; Schindelhauer, C. (2010). A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. In <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>. <a href=\"https://doi.org/10.1109/icpads.2010.42\">https://doi.org/10.1109/icpads.2010.42</a>","mla":"Janson, Thomas, et al. “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs.” <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>, 2010, doi:<a href=\"https://doi.org/10.1109/icpads.2010.42\">10.1109/icpads.2010.42</a>.","short":"T. Janson, P. Mahlmann, C. Schindelhauer, in: Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010.","bibtex":"@inproceedings{Janson_Mahlmann_Schindelhauer_2010, title={A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, DOI={<a href=\"https://doi.org/10.1109/icpads.2010.42\">10.1109/icpads.2010.42</a>}, booktitle={Proceedings of the 16th International Conference on Parallel and Distributed Systems}, author={Janson, Thomas and Mahlmann, Peter and Schindelhauer, Christian}, year={2010} }","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 <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>, 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 <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>, 2010. <a href=\"https://doi.org/10.1109/icpads.2010.42\">https://doi.org/10.1109/icpads.2010.42</a>.","ama":"Janson T, Mahlmann P, Schindelhauer C. A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. In: <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/icpads.2010.42\">10.1109/icpads.2010.42</a>"},"publication_identifier":{"isbn":["9781424497270"]},"publication_status":"published"},{"type":"conference","publication":"Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10","status":"public","_id":"19829","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781605586397"]},"year":"2010","citation":{"chicago":"Miao, Huawei, Chia Ching Ooi, Xiaowen Wu, and Christian Schindelhauer. “Coverage-Hole Trap Model in Target Tracking Using Distributed Relay-Robot Network.” In <i>Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10</i>, 1299–1304, 2010. <a href=\"https://doi.org/10.1145/1774088.1774365\">https://doi.org/10.1145/1774088.1774365</a>.","ieee":"H. Miao, C. C. Ooi, X. Wu, and C. Schindelhauer, “Coverage-hole trap model in target tracking using distributed relay-robot network,” in <i>Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10</i>, 2010, pp. 1299–1304.","ama":"Miao H, Ooi CC, Wu X, Schindelhauer C. Coverage-hole trap model in target tracking using distributed relay-robot network. In: <i>Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10</i>. ; 2010:1299-1304. doi:<a href=\"https://doi.org/10.1145/1774088.1774365\">10.1145/1774088.1774365</a>","apa":"Miao, H., Ooi, C. C., Wu, X., &#38; Schindelhauer, C. (2010). Coverage-hole trap model in target tracking using distributed relay-robot network. In <i>Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10</i> (pp. 1299–1304). <a href=\"https://doi.org/10.1145/1774088.1774365\">https://doi.org/10.1145/1774088.1774365</a>","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.","bibtex":"@inproceedings{Miao_Ooi_Wu_Schindelhauer_2010, title={Coverage-hole trap model in target tracking using distributed relay-robot network}, DOI={<a href=\"https://doi.org/10.1145/1774088.1774365\">10.1145/1774088.1774365</a>}, 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} }","mla":"Miao, Huawei, et al. “Coverage-Hole Trap Model in Target Tracking Using Distributed Relay-Robot Network.” <i>Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10</i>, 2010, pp. 1299–304, doi:<a href=\"https://doi.org/10.1145/1774088.1774365\">10.1145/1774088.1774365</a>."},"page":"1299-1304","date_updated":"2022-01-06T06:54:13Z","date_created":"2020-10-01T10:00:25Z","author":[{"first_name":"Huawei","full_name":"Miao, Huawei","last_name":"Miao"},{"full_name":"Ooi, Chia Ching","last_name":"Ooi","first_name":"Chia Ching"},{"full_name":"Wu, Xiaowen","last_name":"Wu","first_name":"Xiaowen"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"title":"Coverage-hole trap model in target tracking using distributed relay-robot network","doi":"10.1145/1774088.1774365"},{"status":"public","publication":"8th IEEE International Conference on Industrial Informatics (INDIN'2010)","type":"conference","language":[{"iso":"eng"}],"_id":"19933","department":[{"_id":"63"},{"_id":"70"}],"user_id":"15415","year":"2010","citation":{"apa":"Schomaker, G., Oberthur, S., &#38; Kortenjan, M. (2010). Distributed and dynamic resource management for self-optimizing mechatronic systems. In <i>8th IEEE International Conference on Industrial Informatics (INDIN’2010)</i>. <a href=\"https://doi.org/10.1109/indin.2010.5549647\">https://doi.org/10.1109/indin.2010.5549647</a>","mla":"Schomaker, Gunnar, et al. “Distributed and Dynamic Resource Management for Self-Optimizing Mechatronic Systems.” <i>8th IEEE International Conference on Industrial Informatics (INDIN’2010)</i>, 2010, doi:<a href=\"https://doi.org/10.1109/indin.2010.5549647\">10.1109/indin.2010.5549647</a>.","bibtex":"@inproceedings{Schomaker_Oberthur_Kortenjan_2010, title={Distributed and dynamic resource management for self-optimizing mechatronic systems}, DOI={<a href=\"https://doi.org/10.1109/indin.2010.5549647\">10.1109/indin.2010.5549647</a>}, booktitle={8th IEEE International Conference on Industrial Informatics (INDIN’2010)}, author={Schomaker, Gunnar and Oberthur, Simon and Kortenjan, Michael}, year={2010} }","short":"G. Schomaker, S. Oberthur, M. Kortenjan, in: 8th IEEE International Conference on Industrial Informatics (INDIN’2010), 2010.","ama":"Schomaker G, Oberthur S, Kortenjan M. Distributed and dynamic resource management for self-optimizing mechatronic systems. In: <i>8th IEEE International Conference on Industrial Informatics (INDIN’2010)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/indin.2010.5549647\">10.1109/indin.2010.5549647</a>","ieee":"G. Schomaker, S. Oberthur, and M. Kortenjan, “Distributed and dynamic resource management for self-optimizing mechatronic systems,” in <i>8th IEEE International Conference on Industrial Informatics (INDIN’2010)</i>, 2010.","chicago":"Schomaker, Gunnar, Simon Oberthur, and Michael Kortenjan. “Distributed and Dynamic Resource Management for Self-Optimizing Mechatronic Systems.” In <i>8th IEEE International Conference on Industrial Informatics (INDIN’2010)</i>, 2010. <a href=\"https://doi.org/10.1109/indin.2010.5549647\">https://doi.org/10.1109/indin.2010.5549647</a>."},"publication_identifier":{"isbn":["9781424472987"]},"publication_status":"published","title":"Distributed and dynamic resource management for self-optimizing mechatronic systems","doi":"10.1109/indin.2010.5549647","date_updated":"2022-01-06T06:54:14Z","author":[{"first_name":"Gunnar","full_name":"Schomaker, Gunnar","last_name":"Schomaker"},{"last_name":"Oberthur","full_name":"Oberthur, Simon","first_name":"Simon"},{"full_name":"Kortenjan, Michael","last_name":"Kortenjan","first_name":"Michael"}],"date_created":"2020-10-06T14:01:21Z"},{"language":[{"iso":"eng"}],"_id":"20182","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","status":"public","type":"book","title":"Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming","doi":"10.1007/978-3-642-13377-0","date_updated":"2022-01-06T06:54:21Z","publisher":"Springer","date_created":"2020-10-22T12:25:10Z","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"year":"2010","place":"Berlin, Germany","citation":{"apa":"Hamann, H. (2010). <i>Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming</i>. Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-642-13377-0\">https://doi.org/10.1007/978-3-642-13377-0</a>","mla":"Hamann, Heiko. <i>Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming</i>. Springer, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-13377-0\">10.1007/978-3-642-13377-0</a>.","short":"H. Hamann, Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming, Springer, Berlin, Germany, 2010.","bibtex":"@book{Hamann_2010, place={Berlin, Germany}, title={Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-13377-0\">10.1007/978-3-642-13377-0</a>}, publisher={Springer}, author={Hamann, Heiko}, year={2010} }","ieee":"H. Hamann, <i>Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming</i>. Berlin, Germany: Springer, 2010.","chicago":"Hamann, Heiko. <i>Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming</i>. Berlin, Germany: Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13377-0\">https://doi.org/10.1007/978-3-642-13377-0</a>.","ama":"Hamann H. <i>Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming</i>. Berlin, Germany: Springer; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-13377-0\">10.1007/978-3-642-13377-0</a>"}},{"date_updated":"2022-01-06T06:54:23Z","date_created":"2020-10-28T14:37:09Z","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Thomas","last_name":"Schmickl","full_name":"Schmickl, Thomas"},{"first_name":"Jürgen","last_name":"Stradner","full_name":"Stradner, Jürgen"},{"first_name":"Karl","full_name":"Crailsheim, Karl","last_name":"Crailsheim"}],"title":"A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning","doi":"10.1109/CEC.2010.5585994","year":"2010","page":"244--251","citation":{"ama":"Hamann H, Schmickl T, Stradner J, Crailsheim K. A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning. In: <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10)</i>. ; 2010:244--251. doi:<a href=\"https://doi.org/10.1109/CEC.2010.5585994\">10.1109/CEC.2010.5585994</a>","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 <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10)</i>, 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 <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10)</i>, 244--251, 2010. <a href=\"https://doi.org/10.1109/CEC.2010.5585994\">https://doi.org/10.1109/CEC.2010.5585994</a>.","apa":"Hamann, H., Schmickl, T., Stradner, J., &#38; Crailsheim, K. (2010). A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning. In <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10)</i> (pp. 244--251). <a href=\"https://doi.org/10.1109/CEC.2010.5585994\">https://doi.org/10.1109/CEC.2010.5585994</a>","mla":"Hamann, Heiko, et al. “A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning.” <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10)</i>, 2010, pp. 244--251, doi:<a href=\"https://doi.org/10.1109/CEC.2010.5585994\">10.1109/CEC.2010.5585994</a>.","bibtex":"@inproceedings{Hamann_Schmickl_Stradner_Crailsheim_2010, title={A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning}, DOI={<a href=\"https://doi.org/10.1109/CEC.2010.5585994\">10.1109/CEC.2010.5585994</a>}, 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} }","short":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), 2010, pp. 244--251."},"_id":"20220","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC'10)","type":"conference","status":"public"},{"year":"2010","citation":{"ama":"Schmickl T, Hamann H, Stradner J, Mayet R, Crailsheim K. Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller. In: <i>Proc. of the ALife XII Conference</i>. MIT Press; 2010: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 <i>Proc. of the ALife XII Conference</i>, 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 <i>Proc. of the ALife XII Conference</i>, 648--655. MIT Press, 2010.","apa":"Schmickl, T., Hamann, H., Stradner, J., Mayet, R., &#38; Crailsheim, K. (2010). Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller. In <i>Proc. of the ALife XII Conference</i> (pp. 648--655). MIT Press.","mla":"Schmickl, Thomas, et al. “Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller.” <i>Proc. of the ALife XII Conference</i>, MIT Press, 2010, pp. 648--655.","short":"T. Schmickl, H. Hamann, J. Stradner, R. Mayet, K. Crailsheim, in: Proc. of the ALife XII Conference, MIT Press, 2010, pp. 648--655.","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","publisher":"MIT Press","date_updated":"2022-01-06T06:54:23Z","date_created":"2020-10-29T14:09:39Z","author":[{"full_name":"Schmickl, Thomas","last_name":"Schmickl","first_name":"Thomas"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Jürgen","full_name":"Stradner, Jürgen","last_name":"Stradner"},{"last_name":"Mayet","full_name":"Mayet, Ralf","first_name":"Ralf"},{"first_name":"Karl","last_name":"Crailsheim","full_name":"Crailsheim, Karl"}],"title":"Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller","type":"conference","publication":"Proc. of the ALife XII Conference","status":"public","_id":"20222","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"language":[{"iso":"eng"}]},{"publisher":"MIT  Press","date_updated":"2022-01-06T06:54:23Z","date_created":"2020-10-29T14:11:25Z","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"full_name":"Stradner, Jürgen","last_name":"Stradner","first_name":"Jürgen"},{"first_name":"Thomas","last_name":"Schmickl","full_name":"Schmickl, Thomas"},{"last_name":"Crailsheim","full_name":"Crailsheim, Karl","first_name":"Karl"}],"title":"Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics","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: <i>Artificial Life XII (ALife XII), Odense, Denmark</i>. MIT  Press; 2010:773-780.","chicago":"Hamann, Heiko, Jürgen Stradner, Thomas Schmickl, and Karl Crailsheim. “Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics.” In <i>Artificial Life XII (ALife XII), Odense, Denmark</i>, 773–80. MIT  Press, 2010.","ieee":"H. Hamann, J. Stradner, T. Schmickl, and K. Crailsheim, “Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics,” in <i>Artificial Life XII (ALife XII), Odense, Denmark</i>, 2010, pp. 773–780.","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} }","mla":"Hamann, Heiko, et al. “Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics.” <i>Artificial Life XII (ALife XII), Odense, Denmark</i>, MIT  Press, 2010, pp. 773–80.","short":"H. Hamann, J. Stradner, T. Schmickl, K. Crailsheim, in: Artificial Life XII (ALife XII), Odense, Denmark, MIT  Press, 2010, pp. 773–780.","apa":"Hamann, H., Stradner, J., Schmickl, T., &#38; Crailsheim, K. (2010). Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics. In <i>Artificial Life XII (ALife XII), Odense, Denmark</i> (pp. 773–780). MIT  Press."},"page":"773-780","external_id":{"arxiv":["1011.3912"]},"_id":"20223","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Artificial Life XII (ALife XII), Odense, Denmark","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"}],"status":"public"},{"type":"conference","publication":"From Animals to Animats 11","status":"public","_id":"20226","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783642151927","9783642151934"],"issn":["0302-9743","1611-3349"]},"year":"2010","citation":{"ama":"Hamann H, Meyer B, Schmickl T, Crailsheim K. A Model of Symmetry Breaking in Collective Decision-Making. In: <i>From Animals to Animats 11</i>. Vol 6226. Springer; 2010:639-648. doi:<a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">10.1007/978-3-642-15193-4_60</a>","ieee":"H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry Breaking in Collective Decision-Making,” in <i>From Animals to Animats 11</i>, 2010, vol. 6226, pp. 639–648.","chicago":"Hamann, Heiko, Bernd Meyer, Thomas Schmickl, and Karl Crailsheim. “A Model of Symmetry Breaking in Collective Decision-Making.” In <i>From Animals to Animats 11</i>, 6226:639–48. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">https://doi.org/10.1007/978-3-642-15193-4_60</a>.","apa":"Hamann, H., Meyer, B., Schmickl, T., &#38; Crailsheim, K. (2010). A Model of Symmetry Breaking in Collective Decision-Making. In <i>From Animals to Animats 11</i> (Vol. 6226, pp. 639–648). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">https://doi.org/10.1007/978-3-642-15193-4_60</a>","mla":"Hamann, Heiko, et al. “A Model of Symmetry Breaking in Collective Decision-Making.” <i>From Animals to Animats 11</i>, vol. 6226, Springer, 2010, pp. 639–48, doi:<a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">10.1007/978-3-642-15193-4_60</a>.","bibtex":"@inproceedings{Hamann_Meyer_Schmickl_Crailsheim_2010, title={A Model of Symmetry Breaking in Collective Decision-Making}, volume={6226}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">10.1007/978-3-642-15193-4_60</a>}, 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} }","short":"H. Hamann, B. Meyer, T. Schmickl, K. Crailsheim, in: From Animals to Animats 11, Springer, 2010, pp. 639–648."},"intvolume":"      6226","page":"639-648","publisher":"Springer","date_updated":"2022-01-06T06:54:24Z","date_created":"2020-10-29T14:22:12Z","author":[{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"first_name":"Bernd","full_name":"Meyer, Bernd","last_name":"Meyer"},{"full_name":"Schmickl, Thomas","last_name":"Schmickl","first_name":"Thomas"},{"last_name":"Crailsheim","full_name":"Crailsheim, Karl","first_name":"Karl"}],"volume":6226,"title":"A Model of Symmetry Breaking in Collective Decision-Making","doi":"10.1007/978-3-642-15193-4_60"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20258","status":"public","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"}],"type":"conference","publication":"2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns","doi":"10.1109/computationworld.2009.9","title":"On Adaptive Self-Organization in Artificial Robot Organisms","author":[{"last_name":"Kernbach","full_name":"Kernbach, Serge","first_name":"Serge"},{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"first_name":"Jürgen","full_name":"Stradner, Jürgen","last_name":"Stradner"},{"last_name":"Thenius","full_name":"Thenius, Ronald","first_name":"Ronald"},{"last_name":"Schmickl","full_name":"Schmickl, Thomas","first_name":"Thomas"},{"full_name":"Crailsheim, Karl","last_name":"Crailsheim","first_name":"Karl"},{"last_name":"Rossum","full_name":"Rossum, A.C. van","first_name":"A.C. van"},{"last_name":"Sebag","full_name":"Sebag, Michele","first_name":"Michele"},{"full_name":"Bredeche, Nicolas","last_name":"Bredeche","first_name":"Nicolas"},{"last_name":"Yao","full_name":"Yao, Yao","first_name":"Yao"},{"last_name":"Baele","full_name":"Baele, Guy","first_name":"Guy"},{"first_name":"Yves Van de","last_name":"Peer","full_name":"Peer, Yves Van de"},{"first_name":"Jon","full_name":"Timmis, Jon","last_name":"Timmis"},{"first_name":"Maizura","last_name":"Mohktar","full_name":"Mohktar, Maizura"},{"last_name":"Tyrrell","full_name":"Tyrrell, Andy","first_name":"Andy"},{"last_name":"Eiben","full_name":"Eiben, A.E.","first_name":"A.E."},{"first_name":"S.P.","last_name":"McKibbin","full_name":"McKibbin, S.P."},{"last_name":"Liu","full_name":"Liu, Wenguo","first_name":"Wenguo"},{"first_name":"Alan F.T.","full_name":"Winfield, Alan F.T.","last_name":"Winfield"}],"date_created":"2020-11-02T14:13:10Z","date_updated":"2022-01-06T06:54:25Z","citation":{"ieee":"S. Kernbach <i>et al.</i>, “On Adaptive Self-Organization in Artificial Robot Organisms,” in <i>2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns</i>, 2010.","chicago":"Kernbach, Serge, Heiko Hamann, Jürgen Stradner, Ronald Thenius, Thomas Schmickl, Karl Crailsheim, A.C. van Rossum, et al. “On Adaptive Self-Organization in Artificial Robot Organisms.” In <i>2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns</i>, 2010. <a href=\"https://doi.org/10.1109/computationworld.2009.9\">https://doi.org/10.1109/computationworld.2009.9</a>.","ama":"Kernbach S, Hamann H, Stradner J, et al. On Adaptive Self-Organization in Artificial Robot Organisms. In: <i>2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/computationworld.2009.9\">10.1109/computationworld.2009.9</a>","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={<a href=\"https://doi.org/10.1109/computationworld.2009.9\">10.1109/computationworld.2009.9</a>}, 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} }","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.","mla":"Kernbach, Serge, et al. “On Adaptive Self-Organization in Artificial Robot Organisms.” <i>2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns</i>, 2010, doi:<a href=\"https://doi.org/10.1109/computationworld.2009.9\">10.1109/computationworld.2009.9</a>.","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 <i>2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns</i>. <a href=\"https://doi.org/10.1109/computationworld.2009.9\">https://doi.org/10.1109/computationworld.2009.9</a>"},"year":"2010","publication_status":"published","publication_identifier":{"isbn":["9781424451661"]}}]