[{"date_created":"2020-10-26T11:17:17Z","status":"public","department":[{"_id":"63"},{"_id":"238"}],"publication":"10th European Conference on Artificial Life (ECAL'09)","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"},{"first_name":"Ronald","full_name":"Thenius, Ronald","last_name":"Thenius"},{"last_name":"Kengyel","first_name":"Daniela","full_name":"Kengyel, Daniela"}],"title":"Embodiment of Honeybee's Thermotaxis in a Mobile Robot Swarm","user_id":"15415","year":"2011","citation":{"ieee":"H. Hamann, T. Schmickl, K. Crailsheim, R. Thenius, and D. Kengyel, “Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm,” in 10th European Conference on Artificial Life (ECAL’09), 2011.","short":"H. Hamann, T. Schmickl, K. Crailsheim, R. Thenius, D. Kengyel, in: 10th European Conference on Artificial Life (ECAL’09), 2011.","mla":"Hamann, Heiko, et al. “Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm.” 10th European Conference on Artificial Life (ECAL’09), 2011, doi:10.1007/978-3-642-21314-4_9.","bibtex":"@inproceedings{Hamann_Schmickl_Crailsheim_Thenius_Kengyel_2011, title={Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm}, DOI={10.1007/978-3-642-21314-4_9}, booktitle={10th European Conference on Artificial Life (ECAL’09)}, author={Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl and Thenius, Ronald and Kengyel, Daniela}, year={2011} }","apa":"Hamann, H., Schmickl, T., Crailsheim, K., Thenius, R., & Kengyel, D. (2011). Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm. In 10th European Conference on Artificial Life (ECAL’09). https://doi.org/10.1007/978-3-642-21314-4_9","ama":"Hamann H, Schmickl T, Crailsheim K, Thenius R, Kengyel D. Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm. In: 10th European Conference on Artificial Life (ECAL’09). ; 2011. doi:10.1007/978-3-642-21314-4_9","chicago":"Hamann, Heiko, Thomas Schmickl, Karl Crailsheim, Ronald Thenius, and Daniela Kengyel. “Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm.” In 10th European Conference on Artificial Life (ECAL’09), 2011. https://doi.org/10.1007/978-3-642-21314-4_9."},"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-21314-4_9","_id":"20195","date_updated":"2022-01-06T06:54:22Z"},{"title":"Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem","user_id":"15415","editor":[{"full_name":"Lenaerts, Tom","first_name":"Tom","last_name":"Lenaerts"},{"last_name":"Giacobini","first_name":"Mario","full_name":"Giacobini, Mario"},{"full_name":"Bersini, Hugues","first_name":"Hugues","last_name":"Bersini"},{"full_name":"Bourgine, Paul","first_name":"Paul","last_name":"Bourgine"},{"last_name":"Dorigo","first_name":"Marco","full_name":"Dorigo, Marco"},{"last_name":"Doursat","first_name":"Rene","full_name":"Doursat, Rene"}],"status":"public","date_created":"2020-10-26T11:42:55Z","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"full_name":"Schmickl, Thomas","first_name":"Thomas","last_name":"Schmickl"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"}],"publisher":"MIT Press","publication":"Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems","department":[{"_id":"63"},{"_id":"238"}],"date_updated":"2022-01-06T06:54:22Z","_id":"20196","type":"book_chapter","citation":{"short":"H. Hamann, T. Schmickl, K. Crailsheim, in: T. Lenaerts, M. Giacobini, H. Bersini, P. Bourgine, M. Dorigo, R. Doursat (Eds.), Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems, MIT Press, 2011, pp. 302--309.","ieee":"H. Hamann, T. Schmickl, and K. Crailsheim, “Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem,” in Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems, T. Lenaerts, M. Giacobini, H. Bersini, P. Bourgine, M. Dorigo, and R. Doursat, Eds. MIT Press, 2011, pp. 302--309.","ama":"Hamann H, Schmickl T, Crailsheim K. Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem. In: Lenaerts T, Giacobini M, Bersini H, Bourgine P, Dorigo M, Doursat R, eds. Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems. MIT Press; 2011:302--309.","apa":"Hamann, H., Schmickl, T., & Crailsheim, K. (2011). Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem. In T. Lenaerts, M. Giacobini, H. Bersini, P. Bourgine, M. Dorigo, & R. Doursat (Eds.), Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems (pp. 302--309). MIT Press.","chicago":"Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem.” In Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems, edited by Tom Lenaerts, Mario Giacobini, Hugues Bersini, Paul Bourgine, Marco Dorigo, and Rene Doursat, 302--309. MIT Press, 2011.","bibtex":"@inbook{Hamann_Schmickl_Crailsheim_2011, title={Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem}, booktitle={Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems}, publisher={MIT Press}, author={Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}, editor={Lenaerts, Tom and Giacobini, Mario and Bersini, Hugues and Bourgine, Paul and Dorigo, Marco and Doursat, ReneEditors}, year={2011}, pages={302--309} }","mla":"Hamann, Heiko, et al. “Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem.” Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems, edited by Tom Lenaerts et al., MIT Press, 2011, pp. 302--309."},"year":"2011","page":"302--309","language":[{"iso":"eng"}]},{"place":"Berlin, Heidelberg","title":"Major Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics","user_id":"15415","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"full_name":"Schmickl, Thomas","first_name":"Thomas","last_name":"Schmickl"},{"full_name":"Stradner, Jürgen","first_name":"Jürgen","last_name":"Stradner"},{"last_name":"Crailsheim","first_name":"Karl","full_name":"Crailsheim, Karl"},{"full_name":"Winkler, Lutz","first_name":"Lutz","last_name":"Winkler"}],"publisher":"Springer","department":[{"_id":"63"},{"_id":"238"}],"publication":"New Horizons in Evolutionary Robotics","status":"public","date_created":"2020-10-27T14:58:41Z","date_updated":"2022-01-06T06:54:23Z","_id":"20214","doi":"10.1007/978-3-642-18272-3_13","citation":{"short":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, L. Winkler, in: New Horizons in Evolutionary Robotics, Springer, Berlin, Heidelberg, 2011.","ieee":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, and L. Winkler, “Major Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics,” in New Horizons in Evolutionary Robotics, Berlin, Heidelberg: Springer, 2011.","chicago":"Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, and Lutz Winkler. “Major Feedback Loops Supporting Artificial Evolution in Multi-Modular Robotics.” In New Horizons in Evolutionary Robotics. Berlin, Heidelberg: Springer, 2011. https://doi.org/10.1007/978-3-642-18272-3_13.","apa":"Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., & Winkler, L. (2011). Major Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics. In New Horizons in Evolutionary Robotics. Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-18272-3_13","ama":"Hamann H, Schmickl T, Stradner J, Crailsheim K, Winkler L. Major Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics. In: New Horizons in Evolutionary Robotics. Berlin, Heidelberg: Springer; 2011. doi:10.1007/978-3-642-18272-3_13","mla":"Hamann, Heiko, et al. “Major Feedback Loops Supporting Artificial Evolution in Multi-Modular Robotics.” New Horizons in Evolutionary Robotics, Springer, 2011, doi:10.1007/978-3-642-18272-3_13.","bibtex":"@inbook{Hamann_Schmickl_Stradner_Crailsheim_Winkler_2011, place={Berlin, Heidelberg}, title={Major Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics}, DOI={10.1007/978-3-642-18272-3_13}, booktitle={New Horizons in Evolutionary Robotics}, publisher={Springer}, author={Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Winkler, Lutz}, year={2011} }"},"year":"2011","type":"book_chapter","language":[{"iso":"eng"}]},{"intvolume":" 17","_id":"20215","issue":"3","citation":{"bibtex":"@article{Schmickl_Hamann_Crailsheim_2011, title={Modelling a hormone-inspired controller for individual- and multi-modular robotic systems}, volume={17}, DOI={10.1080/13873954.2011.557862}, number={3}, journal={Mathematical and Computer Modelling of Dynamical Systems}, author={Schmickl, Thomas and Hamann, Heiko and Crailsheim, Karl}, year={2011}, pages={221–242} }","mla":"Schmickl, Thomas, et al. “Modelling a Hormone-Inspired Controller for Individual- and Multi-Modular Robotic Systems.” Mathematical and Computer Modelling of Dynamical Systems, vol. 17, no. 3, 2011, pp. 221–42, doi:10.1080/13873954.2011.557862.","chicago":"Schmickl, Thomas, Heiko Hamann, and Karl Crailsheim. “Modelling a Hormone-Inspired Controller for Individual- and Multi-Modular Robotic Systems.” Mathematical and Computer Modelling of Dynamical Systems 17, no. 3 (2011): 221–42. https://doi.org/10.1080/13873954.2011.557862.","ama":"Schmickl T, Hamann H, Crailsheim K. Modelling a hormone-inspired controller for individual- and multi-modular robotic systems. Mathematical and Computer Modelling of Dynamical Systems. 2011;17(3):221-242. doi:10.1080/13873954.2011.557862","apa":"Schmickl, T., Hamann, H., & Crailsheim, K. (2011). Modelling a hormone-inspired controller for individual- and multi-modular robotic systems. Mathematical and Computer Modelling of Dynamical Systems, 17(3), 221–242. https://doi.org/10.1080/13873954.2011.557862","ieee":"T. Schmickl, H. Hamann, and K. Crailsheim, “Modelling a hormone-inspired controller for individual- and multi-modular robotic systems,” Mathematical and Computer Modelling of Dynamical Systems, vol. 17, no. 3, pp. 221–242, 2011.","short":"T. Schmickl, H. Hamann, K. Crailsheim, Mathematical and Computer Modelling of Dynamical Systems 17 (2011) 221–242."},"year":"2011","type":"journal_article","page":"221-242","user_id":"15415","author":[{"full_name":"Schmickl, Thomas","first_name":"Thomas","last_name":"Schmickl"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"last_name":"Crailsheim","full_name":"Crailsheim, Karl","first_name":"Karl"}],"publication":"Mathematical and Computer Modelling of Dynamical Systems","volume":17,"status":"public","date_created":"2020-10-27T15:04:15Z","date_updated":"2022-01-06T06:54:23Z","doi":"10.1080/13873954.2011.557862","language":[{"iso":"eng"}],"title":"Modelling a hormone-inspired controller for individual- and multi-modular robotic systems","department":[{"_id":"63"},{"_id":"238"}],"publication_status":"published","publication_identifier":{"issn":["1387-3954","1744-5051"]}},{"language":[{"iso":"eng"}],"page":"79--86","year":"2011","citation":{"short":"T. Suess, C. Koch, C. Jähn, M. Fischer, in: S. Brooks, P. Irani (Eds.), Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, Canadian Human-Computer Communications Society, 2011, pp. 79--86.","ieee":"T. Suess, C. Koch, C. Jähn, and M. Fischer, “Approximative occlusion culling using the hull tree,” in Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, 2011, pp. 79--86.","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, and Matthias Fischer. “Approximative Occlusion Culling Using the Hull Tree.” In Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, edited by Stephen Brooks and Pourang Irani, 79--86. Canadian Human-Computer Communications Society, 2011.","apa":"Suess, T., Koch, C., Jähn, C., & Fischer, M. (2011). Approximative occlusion culling using the hull tree. In S. Brooks & P. Irani (Eds.), Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada (pp. 79--86). Canadian Human-Computer Communications Society.","ama":"Suess T, Koch C, Jähn C, Fischer M. Approximative occlusion culling using the hull tree. In: Brooks S, Irani P, eds. Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada. Canadian Human-Computer Communications Society; 2011:79--86.","bibtex":"@inproceedings{Suess_Koch_Jähn_Fischer_2011, title={Approximative occlusion culling using the hull tree}, booktitle={Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada}, publisher={Canadian Human-Computer Communications Society}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias}, editor={Brooks, Stephen and Irani, Pourang}, year={2011}, pages={79--86} }","mla":"Suess, Tim, et al. “Approximative Occlusion Culling Using the Hull Tree.” Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, edited by Stephen Brooks and Pourang Irani, Canadian Human-Computer Communications Society, 2011, pp. 79--86."},"type":"conference","date_updated":"2022-01-06T06:53:11Z","_id":"17420","department":[{"_id":"63"}],"publication":"Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John's, Newfoundland, Canada","author":[{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"},{"full_name":"Koch, Clemens","first_name":"Clemens","last_name":"Koch"},{"last_name":"Jähn","full_name":"Jähn, Claudius","first_name":"Claudius"},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"}],"publisher":"Canadian Human-Computer Communications Society","date_created":"2020-07-27T19:17:03Z","status":"public","editor":[{"last_name":"Brooks","first_name":"Stephen","full_name":"Brooks, Stephen"},{"full_name":"Irani, Pourang","first_name":"Pourang","last_name":"Irani"}],"abstract":[{"text":"Occlusion culling is a common approach to accelerate real-time rendering of polygonal 3D-scenes by reducing the rendering load. Especially for large scenes, it is necessary to remove occluded objects to achieve a frame rate that provides an interactive environment. In order to benefit from the culling properly, often hierarchical data structures are used. These data structures typically create a spatial subdivision of a given scene into axis-aligned bounding boxes. These boxes can be tested quickly, but they are not very precise. By using these boxes, the included objects are detected as visible, even if other objects occlude them (false-positives). To get perfect results, the models original geometry included in the box has to be tested, but this would require too much computational power. To overcome this problem, original objects approximations could be used, but typical methods for mesh simplification cannot be applied, because they do not create an outer hull for a given object. We present a model simplification algorithm, which generates simple outer hulls, consisting of only few more triangles than a box, while preserving an objects shape better than a corresponding bounding box. This approach is then extended to a hierarchical data structure, the so-called hull tree, that can be generated for a given scene to improve the visibility tests. Next, we present an approximative rendering algorithm, which combines the features of the hull tree with the use of inner hulls for efficient occlusion detection and global state-sorting of the visible objects.\r\n","lang":"eng"}],"user_id":"15415","title":"Approximative occlusion culling using the hull tree"},{"_id":"17421","date_updated":"2022-01-06T06:53:11Z","doi":"10.1109/wsc.2011.6147883","language":[{"iso":"eng"}],"type":"conference","year":"2011","citation":{"mla":"Klaas, Alexander, et al. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse.” Proceedings of the 2011 Winter Simulation Conference (WSC), 2011, doi:10.1109/wsc.2011.6147883.","bibtex":"@inproceedings{Klaas_Laroque_Dangelmaier_Fischer_2011, title={Simulation aided, knowledge based routing for AGVs in a distribution warehouse}, DOI={10.1109/wsc.2011.6147883}, booktitle={Proceedings of the 2011 Winter Simulation Conference (WSC)}, author={Klaas, Alexander and Laroque, Christoph and Dangelmaier, Wilhelm and Fischer, Matthias}, year={2011} }","apa":"Klaas, A., Laroque, C., Dangelmaier, W., & Fischer, M. (2011). Simulation aided, knowledge based routing for AGVs in a distribution warehouse. In Proceedings of the 2011 Winter Simulation Conference (WSC). https://doi.org/10.1109/wsc.2011.6147883","ama":"Klaas A, Laroque C, Dangelmaier W, Fischer M. Simulation aided, knowledge based routing for AGVs in a distribution warehouse. In: Proceedings of the 2011 Winter Simulation Conference (WSC). ; 2011. doi:10.1109/wsc.2011.6147883","chicago":"Klaas, Alexander, Christoph Laroque, Wilhelm Dangelmaier, and Matthias Fischer. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse.” In Proceedings of the 2011 Winter Simulation Conference (WSC), 2011. https://doi.org/10.1109/wsc.2011.6147883.","ieee":"A. Klaas, C. Laroque, W. Dangelmaier, and M. Fischer, “Simulation aided, knowledge based routing for AGVs in a distribution warehouse,” in Proceedings of the 2011 Winter Simulation Conference (WSC), 2011.","short":"A. Klaas, C. Laroque, W. Dangelmaier, M. Fischer, in: Proceedings of the 2011 Winter Simulation Conference (WSC), 2011."},"user_id":"15415","title":"Simulation aided, knowledge based routing for AGVs in a distribution warehouse","author":[{"first_name":"Alexander","full_name":"Klaas, Alexander","last_name":"Klaas"},{"full_name":"Laroque, Christoph","first_name":"Christoph","last_name":"Laroque"},{"last_name":"Dangelmaier","first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 2011 Winter Simulation Conference (WSC)","status":"public","date_created":"2020-07-27T19:21:18Z","publication_identifier":{"isbn":["9781457721090","9781457721083","9781457721069","9781457721076"]},"publication_status":"published"},{"citation":{"mla":"Suess, Tim, et al. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.” Augmented & Virtual Reality in Der Produktentstehung, vol. 295, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2011, pp. 185--197.","bibtex":"@inproceedings{Suess_Jähn_Fischer_Meyer auf der Heide_Koch_2011, place={Paderborn}, title={Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze}, volume={295}, booktitle={Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Suess, Tim and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm and Koch, Clemens}, year={2011}, pages={185--197} }","apa":"Suess, T., Jähn, C., Fischer, M., Meyer auf der Heide, F., & Koch, C. (2011). Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. Augmented & Virtual Reality in Der Produktentstehung, 295, 185--197.","ama":"Suess T, Jähn C, Fischer M, Meyer auf der Heide F, Koch C. Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. In: Augmented & Virtual Reality in Der Produktentstehung. Vol 295. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2011:185--197.","chicago":"Suess, Tim, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide, and Clemens Koch. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.” In Augmented & Virtual Reality in Der Produktentstehung, 295:185--197. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2011.","ieee":"T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, and C. Koch, “Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze,” in Augmented & Virtual Reality in der Produktentstehung, 2011, vol. 295, pp. 185--197.","short":"T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, C. Koch, in: Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011, pp. 185--197."},"year":"2011","type":"conference","page":"185--197","language":[{"iso":"eng"}],"_id":"17450","intvolume":" 295","date_updated":"2022-01-06T06:53:12Z","author":[{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"},{"last_name":"Jähn","full_name":"Jähn, Claudius","first_name":"Claudius"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Koch","first_name":"Clemens","full_name":"Koch, Clemens"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","department":[{"_id":"63"},{"_id":"26"}],"publication":"Augmented & Virtual Reality in der Produktentstehung","volume":295,"status":"public","date_created":"2020-07-29T12:19:22Z","place":"Paderborn","title":"Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze","user_id":"15415"},{"date_updated":"2022-01-06T06:53:12Z","_id":"17454","year":"2011","type":"dissertation","citation":{"ieee":"T. Suess, Parallel Real-Time Rendering using Heterogeneous PC Clusters. Universität Paderborn, 2011.","short":"T. Suess, Parallel Real-Time Rendering Using Heterogeneous PC Clusters, Universität Paderborn, 2011.","bibtex":"@book{Suess_2011, place={Universität Paderborn}, title={Parallel Real-Time Rendering using Heterogeneous PC Clusters}, author={Suess, Tim}, year={2011} }","mla":"Suess, Tim. Parallel Real-Time Rendering Using Heterogeneous PC Clusters. 2011.","ama":"Suess T. Parallel Real-Time Rendering Using Heterogeneous PC Clusters.; 2011.","apa":"Suess, T. (2011). Parallel Real-Time Rendering using Heterogeneous PC Clusters.","chicago":"Suess, Tim. Parallel Real-Time Rendering Using Heterogeneous PC Clusters. Universität Paderborn, 2011."},"language":[{"iso":"eng"}],"place":"Universität Paderborn","title":"Parallel Real-Time Rendering using Heterogeneous PC Clusters","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-8222","relation":"confirmation"}]},"user_id":"15415","author":[{"first_name":"Tim","full_name":"Suess, Tim","last_name":"Suess"}],"department":[{"_id":"63"}],"status":"public","date_created":"2020-07-29T13:57:09Z"},{"date_updated":"2022-01-06T06:53:56Z","_id":"18973","intvolume":" 290","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"citation":{"chicago":"Frahling, Gereon. Algorithms for Dynamic Geometric Data Streams. Vol. 290. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ama":"Frahling G. Algorithms for Dynamic Geometric Data Streams. Vol 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","apa":"Frahling, G. (2011). Algorithms for Dynamic Geometric Data Streams (Vol. 290). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Frahling, Gereon. Algorithms for Dynamic Geometric Data Streams. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","bibtex":"@book{Frahling_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Algorithms for Dynamic Geometric Data Streams}, volume={290}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Frahling, Gereon}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"G. Frahling, Algorithms for Dynamic Geometric Data Streams, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"G. Frahling, Algorithms for Dynamic Geometric Data Streams, vol. 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"year":"2011","type":"dissertation","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301123","relation":"confirmation"}]},"user_id":"5786","title":"Algorithms for Dynamic Geometric Data Streams","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Frahling","full_name":"Frahling, Gereon","first_name":"Gereon"}],"department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-09-04T06:52:56Z","volume":290,"publication_identifier":{"isbn":["978-3-942647-09-0"]}},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"short":"J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","chicago":"Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks. Vol. 287. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ama":"Mehler J. Power-Aware Online File Allocation in Dynamic Networks. Vol 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","apa":"Mehler, J. (2011). Power-Aware Online File Allocation in Dynamic Networks (Vol. 287). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Mehler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Power-Aware Online File Allocation in Dynamic Networks}, volume={287}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mehler, Jan}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"type":"dissertation","year":"2011","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"intvolume":" 287","_id":"18974","date_updated":"2022-01-06T06:53:56Z","department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Mehler","full_name":"Mehler, Jan","first_name":"Jan"}],"volume":287,"publication_identifier":{"isbn":["978-3-942647-06-9"]},"date_created":"2020-09-04T06:58:58Z","status":"public","title":"Power-Aware Online File Allocation in Dynamic Networks","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20101020011"}]},"user_id":"5786"},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","year":"2011","type":"dissertation","citation":{"apa":"Gehweiler, J. (2011). Peer-to-Peer Based Parallel Web Computing (Vol. 298). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Gehweiler J. Peer-to-Peer Based Parallel Web Computing. Vol 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","chicago":"Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Vol. 298. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","bibtex":"@book{Gehweiler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-Peer Based Parallel Web Computing}, volume={298}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Gehweiler, Joachim}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","short":"J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, vol. 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"language":[{"iso":"eng"}],"_id":"18976","date_updated":"2022-01-06T06:53:56Z","intvolume":" 298","author":[{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"volume":298,"publication_identifier":{"isbn":["978-3-942647-17-5"]},"status":"public","date_created":"2020-09-04T07:46:32Z","abstract":[{"text":"Web computing is a variant of parallel computing where the idle times of PCs\r\ndonated by worldwide distributed users are employed to execute parallel\r\nprograms. In this thesis we consider a web computing variant with two\r\nimportant properties: First, we support the execution of coupled, massively\r\nparallel algorithms (rather than distributed data processing). And second,\r\nwe organize the system in peer-to-peer fashion.\r\n\r\nWe present the Paderborn University BSP-based Web Computing (PUB-Web) library,\r\nwhich supports the execution of parallel programs in the bulk-synchronous style\r\n(BSP) in such a web computing setting. In this thesis, we focus on important\r\ntechnical and algorithmic aspects, in particular: In order to schedule\r\nprocesses with respect to the currently available computing power, which\r\ncontinually changes in an unpredictable fashion, we need intelligent load\r\nbalancing algorithms and -- as a basic precondition -- the technical ability\r\nto migrate threads at runtime.\r\n\r\nTo achieve the latter in a way suitable for production use, compatible with\r\nrecent Java versions, available for all important platforms, and easy-to-use\r\nfor developers, we develop the PadMig thread migration and checkpointing\r\nlibrary.\r\n\r\nIn order to tackle the distributed load balancing problem, we present an\r\nalgorithm based on Distributed Heterogeneous Hash-Tables. In order to judge\r\nthe quality of the schedules produced, we perform extensive experiments to\r\ncompare several variants of the DHHT-based load balancer with the well-\r\nestablished Work Stealing algorithm, using realistic input data obtained by\r\nprofiling the utilization of several hundred PCs for a period of several\r\nmonths.\r\n\r\nBeside the available computing power, we finally also consider the network\r\nbandwidth as a secondary criterion for load balancing. For this purpose, we\r\ncluster the PUB-Web network according to bandwidth, employing a novel,\r\nfault-tolerant, adaptive, and scaling distributed clustering algorithm called\r\nDiDiC. In order to judge the quality of the clusterings produces by DiDiC,\r\nwe experimentally compare it to the well-established MCL algorithm using a\r\nsimulator.","lang":"eng"}],"title":"Peer-to-Peer Based Parallel Web Computing","user_id":"5786","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466:2-186","relation":"confirmation"}]}},{"language":[{"iso":"eng"}],"type":"conference","citation":{"ieee":"P. Briest and C. Raupach, “The car sharing problem,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.","short":"P. Briest, C. Raupach, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","mla":"Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989518.","bibtex":"@inproceedings{Briest_Raupach_2011, title={The car sharing problem}, DOI={10.1145/1989493.1989518}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Briest, Patrick and Raupach, Christoph}, year={2011} }","apa":"Briest, P., & Raupach, C. (2011). The car sharing problem. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989518","ama":"Briest P, Raupach C. The car sharing problem. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989518","chicago":"Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011. https://doi.org/10.1145/1989493.1989518."},"year":"2011","_id":"19026","date_updated":"2022-01-06T06:53:57Z","doi":"10.1145/1989493.1989518","author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"},{"last_name":"Raupach","full_name":"Raupach, Christoph","first_name":"Christoph"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","status":"public","date_created":"2020-09-04T11:58:54Z","publication_identifier":{"isbn":["9781450307437"]},"publication_status":"published","user_id":"15415","title":"The car sharing problem"},{"place":"Universität Paderborn","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-385","relation":"confirmation"}]},"user_id":"15415","title":"Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen","department":[{"_id":"63"}],"author":[{"first_name":"Sascha","full_name":"Effert, Sascha","last_name":"Effert"}],"date_created":"2020-09-04T13:31:29Z","status":"public","_id":"19040","date_updated":"2022-01-06T06:53:57Z","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"type":"dissertation","year":"2011","citation":{"bibtex":"@book{Effert_2011, place={Universität Paderborn}, title={Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen}, author={Effert, Sascha}, year={2011} }","mla":"Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. 2011.","chicago":"Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. Universität Paderborn, 2011.","apa":"Effert, S. (2011). Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn.","ama":"Effert S. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. Universität Paderborn; 2011.","ieee":"S. Effert, Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn, 2011.","short":"S. Effert, Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen, Universität Paderborn, 2011."}},{"language":[{"iso":"eng"}],"year":"2011","citation":{"short":"P. Briest, P. Krysta, B. Vöcking, SIAM Journal on Computing (2011) 1587–1622.","ieee":"P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011.","ama":"Briest P, Krysta P, Vöcking B. Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing. 2011:1587-1622. doi:10.1137/090772988","apa":"Briest, P., Krysta, P., & Vöcking, B. (2011). Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing, 1587–1622. https://doi.org/10.1137/090772988","chicago":"Briest, Patrick, Piotr Krysta, and Berthold Vöcking. “Approximation Techniques for Utilitarian Mechanism Design.” SIAM Journal on Computing, 2011, 1587–1622. https://doi.org/10.1137/090772988.","mla":"Briest, Patrick, et al. “Approximation Techniques for Utilitarian Mechanism Design.” SIAM Journal on Computing, 2011, pp. 1587–622, doi:10.1137/090772988.","bibtex":"@article{Briest_Krysta_Vöcking_2011, title={Approximation Techniques for Utilitarian Mechanism Design}, DOI={10.1137/090772988}, journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr and Vöcking, Berthold}, year={2011}, pages={1587–1622} }"},"type":"journal_article","page":"1587-1622","doi":"10.1137/090772988","_id":"23739","date_updated":"2022-01-06T06:55:59Z","status":"public","date_created":"2021-09-03T10:41:04Z","publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","author":[{"first_name":"Patrick","full_name":"Briest, Patrick","last_name":"Briest"},{"full_name":"Krysta, Piotr","first_name":"Piotr","last_name":"Krysta"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"}],"publication":"SIAM Journal on Computing","department":[{"_id":"63"}],"user_id":"15415","title":"Approximation Techniques for Utilitarian Mechanism Design","abstract":[{"text":"This paper deals with the design of efficiently computable incentive-compatible mechanisms for combinatorial optimization problems with single-minded agents each possibly having multiple private parameters. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonicity properties to ensure truthfulness. Since most of the known approximation techniques do not fulfill these properties, we study alternative techniques. Our first contribution is a quite general method to transform a pseudopolynomial algorithm into a monotone fully polynomial time approximation scheme (FPTAS). This can be applied to various problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for single-minded multiunit auctions. The best previous result for such auctions was a 2-appro-xi-ma-tion. In addition, we present a monotone PTAS for the generalized assignment problem with any constant number of private parameters per agent. The most efficient way to solve packing integer programs (PIPs) is linear programming–based randomized rounding, which also is in general not monotone. We show that primal-dual greedy algorithms achieve almost the same approximation ratios for PIPs as randomized rounding. The advantage is that these algorithms are inherently monotone. This way, we can significantly improve the approximation ratios of truthful mechanisms for various fundamental mechanism design problems like single-minded combinatorial auctions (CAs), unsplittable flow routing, and multicast routing. Our primal-dual approximation algorithms can also be used for the winner determination in CAs with general bidders specifying their bids through an oracle.\r\n","lang":"eng"}]},{"doi":"10.1137/090752353","date_updated":"2022-01-06T06:55:59Z","_id":"23740","language":[{"iso":"eng"}],"page":"1554-1586","type":"journal_article","citation":{"chicago":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, 1554–86. https://doi.org/10.1137/090752353.","ama":"Briest P, Krysta P. Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing. 2011:1554-1586. doi:10.1137/090752353","apa":"Briest, P., & Krysta, P. (2011). Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing, 1554–1586. https://doi.org/10.1137/090752353","mla":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, pp. 1554–86, doi:10.1137/090752353.","bibtex":"@article{Briest_Krysta_2011, title={Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems}, DOI={10.1137/090752353}, journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr}, year={2011}, pages={1554–1586} }","short":"P. Briest, P. Krysta, SIAM Journal on Computing (2011) 1554–1586.","ieee":"P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems,” SIAM Journal on Computing, pp. 1554–1586, 2011."},"year":"2011","user_id":"15415","title":"Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems","abstract":[{"lang":"eng","text":"We investigate nonparametric multiproduct pricing problems, in which we want to find revenue maximizing prices for products $\\mathcal{P}$ based on a set of customer samples $\\mathcal{C}$. We mostly focus on the unit-demand case, in which products constitute strict substitutes and each customer aims to purchase a single product. In this setting a customer sample consists of a number of nonzero values for different products and possibly an additional product ranking. Once prices are fixed, each customer chooses to buy one of the products she can afford based on some predefined selection rule. We distinguish between the min-buying, max-buying, and rank-buying models. Some of our results also extend to single-minded pricing, in which case products are strict complements and every customer seeks to buy a single set of products, which she purchases if the sum of prices is below her valuation for that set. For the min-buying model we show that the revenue maximization problem is not approximable within factor $\\mathcal{O}(\\log^{\\varepsilon}|\\mathcal{C}|)$ for some constant $\\varepsilon>0$, unless $\\mathrm{NP}\\subseteq\\mathrm{DTIME}(n^{\\mathcal{O}(\\log\\log n)})$, thereby almost closing the gap between the known algorithmic results and previous lower bounds. We also prove inapproximability within $\\mathcal{O}(\\ell^{\\varepsilon})$, $\\ell$ being an upper bound on the number of nonzero values per customer, and $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ under slightly stronger assumptions and provide matching upper bounds. Surprisingly, these hardness results hold even if a price ladder constraint, i.e., a predefined order on the prices of all products, is given. Without the price ladder constraint we obtain similar hardness results for the special case of uniform valuations, i.e., the case that every customer has identical values for all the products she is interested in, assuming specific hardness of the balanced bipartite independent set problem in constant degree graphs or hardness of refuting random 3CNF formulas. Introducing a slightly more general problem definition in which customers are given as an explicit probability distribution, we obtain inapproximability within $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ assuming $\\mathrm{NP}\\nsubseteq\\bigcap_{\\delta>0}\\mathrm{BPTIME}(2^{\\mathcal{O}(n^{\\delta})})$. These results apply to single-minded pricing as well. For the max-buying model a polynomial-time approximation scheme exists if a price ladder is given. We give a matching lower bound by proving strong NP-hardness. Assuming limited product supply, we analyze a generic local search algorithm and prove that it is 2-approximate. Finally, we discuss implications for the rank-buying model.\r\n"}],"date_created":"2021-09-03T10:48:52Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"department":[{"_id":"63"}],"publication":"SIAM Journal on Computing","author":[{"last_name":"Briest","full_name":"Briest, Patrick","first_name":"Patrick"},{"last_name":"Krysta","first_name":"Piotr","full_name":"Krysta, Piotr"}]},{"author":[{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"full_name":"Hüllmann, Martina","first_name":"Martina","last_name":"Hüllmann"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"first_name":"Alexander","full_name":"Klaas, Alexander","last_name":"Klaas"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Sven","full_name":"Kurras, Sven","last_name":"Kurras"},{"last_name":"Märtens","full_name":"Märtens, Marcus","first_name":"Marcus"},{"last_name":"auf der Heide","first_name":"Friedhelm Meyer","full_name":"auf der Heide, Friedhelm Meyer"},{"first_name":"Christoph","full_name":"Raupach, Christoph","last_name":"Raupach"},{"last_name":"Swierkot","full_name":"Swierkot, Kamil","first_name":"Kamil"},{"last_name":"Warner","id":"3902","first_name":"Daniel","full_name":"Warner, Daniel"},{"last_name":"Weddemann","full_name":"Weddemann, Christoph","first_name":"Christoph"},{"last_name":"Wonisch","full_name":"Wonisch, Daniel","first_name":"Daniel"}],"department":[{"_id":"63"}],"publication":"SOFSEM 2011: Theory and Practice of Computer Science","status":"public","date_created":"2020-12-12T11:15:30Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]},"place":"Berlin, Heidelberg","user_id":"3902","title":"Collisionless Gathering of Robots with an Extent","language":[{"iso":"eng"}],"year":"2011","type":"book_chapter","citation":{"mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={Collisionless Gathering of Robots with an Extent}, DOI={10.1007/978-3-642-18381-2_15}, booktitle={SOFSEM 2011: Theory and Practice of Computer Science}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and auf der Heide, Friedhelm Meyer and et al.}, year={2011} }","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-18381-2_15","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_15","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-18381-2_15.","ieee":"A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011.","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F.M. auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011."},"date_updated":"2022-01-06T06:54:33Z","_id":"20709","doi":"10.1007/978-3-642-18381-2_15"},{"year":"2011","type":"book_chapter","citation":{"short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011.","ieee":"A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In Automata, Languages and Programming. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_52","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for Analyzing Convergence Algorithms for Mobile Robots}, DOI={10.1007/978-3-642-22012-8_52}, booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:33Z","_id":"20710","doi":"10.1007/978-3-642-22012-8_52","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Hüllmann","first_name":"Martina","full_name":"Hüllmann, Martina"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"full_name":"Klaas, Alexander","first_name":"Alexander","last_name":"Klaas"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"last_name":"Märtens","full_name":"Märtens, Marcus","first_name":"Marcus"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Raupach","full_name":"Raupach, Christoph","first_name":"Christoph"},{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"},{"id":"3902","last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"},{"full_name":"Weddemann, Christoph","first_name":"Christoph","last_name":"Weddemann"},{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"}],"department":[{"_id":"63"}],"publication":"Automata, Languages and Programming","publication_status":"published","publication_identifier":{"isbn":["9783642220111","9783642220128"],"issn":["0302-9743","1611-3349"]},"status":"public","date_created":"2020-12-12T12:22:41Z","place":"Berlin, Heidelberg","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","user_id":"3902"},{"author":[{"last_name":"Renken","full_name":"Renken, Hendrik","first_name":"Hendrik"},{"last_name":"Laroque","first_name":"Christoph","full_name":"Laroque, Christoph"},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"}],"publication":"Proceedings of The 25th European Simulation and Modelling Conference - ESM2011","department":[{"_id":"63"}],"status":"public","date_created":"2020-08-24T14:01:49Z","title":"An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization","user_id":"15415","citation":{"bibtex":"@inproceedings{Renken_Laroque_Fischer_2011, title={An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization}, booktitle={Proceedings of The 25th European Simulation and Modelling Conference - ESM2011}, author={Renken, Hendrik and Laroque, Christoph and Fischer, Matthias}, year={2011} }","mla":"Renken, Hendrik, et al. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.","apa":"Renken, H., Laroque, C., & Fischer, M. (2011). An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In Proceedings of The 25th European Simulation and Modelling Conference - ESM2011.","ama":"Renken H, Laroque C, Fischer M. An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In: Proceedings of The 25th European Simulation and Modelling Conference - ESM2011. ; 2011.","chicago":"Renken, Hendrik, Christoph Laroque, and Matthias Fischer. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” In Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.","ieee":"H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization,” in Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.","short":"H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011."},"year":"2011","type":"conference","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:26Z","_id":"18193"},{"date_updated":"2022-01-06T06:53:27Z","_id":"18194","language":[{"iso":"eng"}],"type":"preprint","citation":{"short":"T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, (2011).","ieee":"T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel Out-of-Core Occlusion Culling.” 2011.","ama":"Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Parallel Out-of-Core Occlusion Culling. Published online 2011.","apa":"Suess, T., Koch, C., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2011). Parallel Out-of-Core Occlusion Culling.","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Parallel Out-of-Core Occlusion Culling,” 2011.","mla":"Suess, Tim, et al. Parallel Out-of-Core Occlusion Culling. 2011.","bibtex":"@article{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2011, title={Parallel Out-of-Core Occlusion Culling}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2011} }"},"year":"2011","abstract":[{"lang":"eng","text":"We present a parallel rendering system for PC-Clusters to visualize large 3D scenes. One single visualization node, equipped with a high-end graphics adapter, is supported by a group of backend nodes with weak graphics performance. The objects of the scene are distributed among these backend nodes, they serve two purposes: First, they provide an out-of-core memory system for the visualization node. Second, they assist the visualization node's rendering by performing visibility calculations and only sending visible objects to the visualization node. In order to obtain fast rendering with our system, we have to distribute the objects among the backend nodes in a way that does not only guarantee an even distribution of the objects, but also an even distribution of the visibility calculations and the amount of data send to the visualization node. We identify necessary properties of the distribution and argue that a random distribution is a good candidate. Further, in order to reduce the number of objects sent to the visualization node per frame, we employ an approximate hierarchical occlusion culling in each backend node. For this, they are equipped, in addition to the objects assigned to them, with simplified versions of the other objects of the 3D scene. The visualization node is equipped with 512 MiB video memory and supported by 15 backend nodes. This system is able to render a approx. 350 million polygons (approx. 8.5 GiB) large aircraft model between 20 - 30 fps and thus allows a walkthrough in real-time."}],"user_id":"15415","ddc":["000"],"title":"Parallel Out-of-Core Occlusion Culling","file":[{"access_level":"closed","date_created":"2020-08-24T14:13:46Z","file_name":"pre-03-2011-5220.pdf","success":1,"relation":"main_file","date_updated":"2020-08-24T14:13:46Z","content_type":"application/pdf","creator":"koala","file_id":"18195","file_size":3091853}],"author":[{"last_name":"Suess","full_name":"Suess, Tim","first_name":"Tim"},{"last_name":"Koch","first_name":"Clemens","full_name":"Koch, Clemens"},{"first_name":"Claudius","full_name":"Jähn, Claudius","last_name":"Jähn"},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"file_date_updated":"2020-08-24T14:13:46Z","department":[{"_id":"63"}],"has_accepted_license":"1","status":"public","date_created":"2020-08-24T14:14:10Z"},{"language":[{"iso":"eng"}],"page":"234--239","citation":{"chicago":"Vöcking, Berthold, Martin Hoefer, Alexander Skopalik, Michal Penn, and Maria Polukarov. “Considerate Equilibrium.” In {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 234--239, 2011.","ama":"Vöcking B, Hoefer M, Skopalik A, Penn M, Polukarov M. Considerate Equilibrium. In: {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,. ; 2011:234--239.","apa":"Vöcking, B., Hoefer, M., Skopalik, A., Penn, M., & Polukarov, M. (2011). Considerate Equilibrium. In {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, (pp. 234--239).","mla":"Vöcking, Berthold, et al. “Considerate Equilibrium.” {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239.","bibtex":"@inproceedings{Vöcking_Hoefer_Skopalik_Penn_Polukarov_2011, title={Considerate Equilibrium}, booktitle={{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,}, author={Vöcking, Berthold and Hoefer, Martin and Skopalik, Alexander and Penn, Michal and Polukarov, Maria}, year={2011}, pages={234--239} }","short":"B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, M. Polukarov, in: {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239.","ieee":"B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, and M. Polukarov, “Considerate Equilibrium,” in {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239."},"type":"conference","year":"2011","_id":"18568","date_updated":"2022-01-06T06:53:40Z","date_created":"2020-08-28T12:23:42Z","status":"public","publication":"{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,","department":[{"_id":"63"}],"author":[{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"},{"full_name":"Hoefer, Martin","first_name":"Martin","last_name":"Hoefer"},{"last_name":"Skopalik","first_name":"Alexander ","full_name":"Skopalik, Alexander "},{"first_name":"Michal","full_name":"Penn, Michal","last_name":"Penn"},{"first_name":"Maria","full_name":"Polukarov, Maria","last_name":"Polukarov"}],"user_id":"15415","related_material":{"link":[{"relation":"confirmation","url":"http://ijcai.org/papers11/Papers/IJCAI11-050.pdf"}]},"title":"Considerate Equilibrium"}]