[{"_id":"16409","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Automata, Languages and Programming","abstract":[{"lang":"eng","text":"Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes.\r\n"}],"status":"public","date_updated":"2022-01-06T06:52:50Z","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Hüllmann, Martina","last_name":"Hüllmann","first_name":"Martina"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"first_name":"Alexander","last_name":"Klaas","full_name":"Klaas, Alexander"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Sven","full_name":"Kurras, Sven","last_name":"Kurras"},{"first_name":"Marcus","full_name":"Märtens, Marcus","last_name":"Märtens"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christoph","last_name":"Raupach","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","last_name":"Swierkot","first_name":"Kamil"},{"last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"},{"first_name":"Christoph","last_name":"Weddemann","full_name":"Weddemann, Christoph"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"date_created":"2020-04-06T07:47:55Z","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","doi":"10.1007/978-3-642-22012-8_52","publication_status":"published","publication_identifier":{"isbn":["9783642220111","9783642220128"],"issn":["0302-9743","1611-3349"]},"year":"2011","place":"Berlin, Heidelberg","citation":{"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 <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>","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={<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>}, 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} }","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011.","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” <i>Automata, Languages and Programming</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>","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 <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>.","ieee":"A. Cord-Landwehr <i>et al.</i>, “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 2011."}},{"date_updated":"2022-01-06T06:51:30Z","_id":"13194","date_created":"2019-09-12T14:45:38Z","author":[{"last_name":"Dembczynski","full_name":"Dembczynski, K.","first_name":"K."},{"first_name":"W.","last_name":"Waegeman","full_name":"Waegeman, W."},{"first_name":"W.","full_name":"Cheng, W.","last_name":"Cheng"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"}],"user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"title":"An exact algorithm for F-measure maximization","language":[{"iso":"eng"}],"type":"conference","publication":"In Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada, Spain","year":"2011","citation":{"ama":"Dembczynski K, Waegeman W, Cheng W, Hüllermeier E. An exact algorithm for F-measure maximization. In: <i>In Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada, Spain</i>. ; 2011.","chicago":"Dembczynski, K., W. Waegeman, W. Cheng, and Eyke Hüllermeier. “An Exact Algorithm for F-Measure Maximization.” In <i>In Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada, Spain</i>, 2011.","ieee":"K. Dembczynski, W. Waegeman, W. Cheng, and E. Hüllermeier, “An exact algorithm for F-measure maximization,” in <i>In Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada, Spain</i>, 2011.","bibtex":"@inproceedings{Dembczynski_Waegeman_Cheng_Hüllermeier_2011, title={An exact algorithm for F-measure maximization}, booktitle={In Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada, Spain}, author={Dembczynski, K. and Waegeman, W. and Cheng, W. and Hüllermeier, Eyke}, year={2011} }","short":"K. Dembczynski, W. Waegeman, W. Cheng, E. Hüllermeier, in: In Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada, Spain, 2011.","mla":"Dembczynski, K., et al. “An Exact Algorithm for F-Measure Maximization.” <i>In Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada, Spain</i>, 2011.","apa":"Dembczynski, K., Waegeman, W., Cheng, W., &#38; Hüllermeier, E. (2011). An exact algorithm for F-measure maximization. In <i>In Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada, Spain</i>."},"status":"public"},{"_id":"13196","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"user_id":"49109","language":[{"iso":"eng"}],"publication":"in Proceedings DS-2011, 14th International  Conference on Discovery Science, number 6926 in LNAI","type":"conference","editor":[{"first_name":"T.","last_name":"Elomaa","full_name":"Elomaa, T."},{"last_name":"Hollmen","full_name":"Hollmen, J.","first_name":"J."},{"first_name":"H.","full_name":"Mannila, H.","last_name":"Mannila"}],"status":"public","date_updated":"2022-01-06T06:51:30Z","publisher":"Springer","date_created":"2019-09-12T15:00:59Z","author":[{"first_name":"J.","full_name":"Fürnkranz, J.","last_name":"Fürnkranz"},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"title":"Learning from label preferences","year":"2011","page":"2-17","citation":{"ama":"Fürnkranz J, Hüllermeier E. Learning from label preferences. In: Elomaa T, Hollmen J, Mannila H, eds. <i>In Proceedings DS-2011, 14th International  Conference on Discovery Science, Number 6926 in LNAI</i>. Springer; 2011:2-17.","chicago":"Fürnkranz, J., and Eyke Hüllermeier. “Learning from Label Preferences.” In <i>In Proceedings DS-2011, 14th International  Conference on Discovery Science, Number 6926 in LNAI</i>, edited by T. Elomaa, J. Hollmen, and H. Mannila, 2–17. Springer, 2011.","ieee":"J. Fürnkranz and E. Hüllermeier, “Learning from label preferences,” in <i>in Proceedings DS-2011, 14th International  Conference on Discovery Science, number 6926 in LNAI</i>, 2011, pp. 2–17.","bibtex":"@inproceedings{Fürnkranz_Hüllermeier_2011, title={Learning from label preferences}, booktitle={in Proceedings DS-2011, 14th International  Conference on Discovery Science, number 6926 in LNAI}, publisher={Springer}, author={Fürnkranz, J. and Hüllermeier, Eyke}, editor={Elomaa, T. and Hollmen, J. and Mannila, H.Editors}, year={2011}, pages={2–17} }","short":"J. Fürnkranz, E. Hüllermeier, in: T. Elomaa, J. Hollmen, H. Mannila (Eds.), In Proceedings DS-2011, 14th International  Conference on Discovery Science, Number 6926 in LNAI, Springer, 2011, pp. 2–17.","mla":"Fürnkranz, J., and Eyke Hüllermeier. “Learning from Label Preferences.” <i>In Proceedings DS-2011, 14th International  Conference on Discovery Science, Number 6926 in LNAI</i>, edited by T. Elomaa et al., Springer, 2011, pp. 2–17.","apa":"Fürnkranz, J., &#38; Hüllermeier, E. (2011). Learning from label preferences. In T. Elomaa, J. Hollmen, &#38; H. Mannila (Eds.), <i>in Proceedings DS-2011, 14th International  Conference on Discovery Science, number 6926 in LNAI</i> (pp. 2–17). Springer."}},{"title":"Learning  monotone nonlinear models using the Choquet integral","date_created":"2019-09-12T15:04:58Z","author":[{"first_name":"A.","full_name":"Fallah Tehrani, A.","last_name":"Fallah Tehrani"},{"first_name":"W.","last_name":"Cheng","full_name":"Cheng, W."},{"first_name":"K.","full_name":"Dembczynski, K.","last_name":"Dembczynski"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"}],"date_updated":"2022-01-06T06:51:30Z","citation":{"bibtex":"@inproceedings{Fallah Tehrani_Cheng_Dembczynski_Hüllermeier_2011, title={Learning  monotone nonlinear models using the Choquet integral}, booktitle={In Proceedings ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,}, author={Fallah Tehrani, A. and Cheng, W. and Dembczynski, K. and Hüllermeier, Eyke}, year={2011} }","mla":"Fallah Tehrani, A., et al. “Learning  Monotone Nonlinear Models Using the Choquet Integral.” <i>In Proceedings ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,</i> 2011.","short":"A. Fallah Tehrani, W. Cheng, K. Dembczynski, E. Hüllermeier, in: In Proceedings ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece, 2011.","apa":"Fallah Tehrani, A., Cheng, W., Dembczynski, K., &#38; Hüllermeier, E. (2011). Learning  monotone nonlinear models using the Choquet integral. In <i>In Proceedings ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,</i>.","chicago":"Fallah Tehrani, A., W. Cheng, K. Dembczynski, and Eyke Hüllermeier. “Learning  Monotone Nonlinear Models Using the Choquet Integral.” In <i>In Proceedings ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,</i> 2011.","ieee":"A. Fallah Tehrani, W. Cheng, K. Dembczynski, and E. Hüllermeier, “Learning  monotone nonlinear models using the Choquet integral,” in <i>In Proceedings ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,</i> 2011.","ama":"Fallah Tehrani A, Cheng W, Dembczynski K, Hüllermeier E. Learning  monotone nonlinear models using the Choquet integral. In: <i>In Proceedings ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,</i>. ; 2011."},"year":"2011","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"user_id":"49109","_id":"13197","status":"public","publication":"In Proceedings ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,","type":"conference"},{"title":"Preference-based CBR: First steps toward a methodological framework","author":[{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"},{"first_name":"P.","full_name":"Schlegel, P.","last_name":"Schlegel"}],"date_created":"2019-09-12T15:10:28Z","publisher":"Springer","date_updated":"2022-01-06T06:51:30Z","citation":{"bibtex":"@inproceedings{Hüllermeier_Schlegel_2011, title={Preference-based CBR: First steps toward a methodological framework}, booktitle={In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, number 6880 in LNAI}, publisher={Springer}, author={Hüllermeier, Eyke and Schlegel, P.}, editor={Ram, A. and Wiratunga, N.Editors}, year={2011}, pages={77–91} }","mla":"Hüllermeier, Eyke, and P. Schlegel. “Preference-Based CBR: First Steps toward a Methodological Framework.” <i>In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, Number 6880 in LNAI</i>, edited by A. Ram and N. Wiratunga, Springer, 2011, pp. 77–91.","short":"E. Hüllermeier, P. Schlegel, in: A. Ram, N. Wiratunga (Eds.), In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, Number 6880 in LNAI, Springer, 2011, pp. 77–91.","apa":"Hüllermeier, E., &#38; Schlegel, P. (2011). Preference-based CBR: First steps toward a methodological framework. In A. Ram &#38; N. Wiratunga (Eds.), <i>In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, number 6880 in LNAI</i> (pp. 77–91). Springer.","chicago":"Hüllermeier, Eyke, and P. Schlegel. “Preference-Based CBR: First Steps toward a Methodological Framework.” In <i>In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, Number 6880 in LNAI</i>, edited by A. Ram and N. Wiratunga, 77–91. Springer, 2011.","ieee":"E. Hüllermeier and P. Schlegel, “Preference-based CBR: First steps toward a methodological framework,” in <i>In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, number 6880 in LNAI</i>, 2011, pp. 77–91.","ama":"Hüllermeier E, Schlegel P. Preference-based CBR: First steps toward a methodological framework. In: Ram A, Wiratunga N, eds. <i>In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, Number 6880 in LNAI</i>. Springer; 2011:77-91."},"page":"77-91","year":"2011","language":[{"iso":"eng"}],"user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"_id":"13198","status":"public","editor":[{"last_name":"Ram","full_name":"Ram, A.","first_name":"A."},{"last_name":"Wiratunga","full_name":"Wiratunga, N.","first_name":"N."}],"type":"conference","publication":"In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, number 6880 in LNAI"},{"status":"public","publication":"in Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"user_id":"49109","_id":"13588","citation":{"apa":"Kotlowski, W., Dembczynski, K., &#38; Hüllermeier, E. (2011). Bipartite ranking through minimization of univariate loss. In <i>in Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA</i>.","mla":"Kotlowski, W., et al. “Bipartite Ranking through Minimization of Univariate Loss.” <i>In Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA</i>, 2011.","bibtex":"@inproceedings{Kotlowski_Dembczynski_Hüllermeier_2011, title={Bipartite ranking through minimization of univariate loss}, booktitle={in Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA}, author={Kotlowski, W. and Dembczynski, K. and Hüllermeier, Eyke}, year={2011} }","short":"W. Kotlowski, K. Dembczynski, E. Hüllermeier, in: In Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA, 2011.","ama":"Kotlowski W, Dembczynski K, Hüllermeier E. Bipartite ranking through minimization of univariate loss. In: <i>In Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA</i>. ; 2011.","ieee":"W. Kotlowski, K. Dembczynski, and E. Hüllermeier, “Bipartite ranking through minimization of univariate loss,” in <i>in Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA</i>, 2011.","chicago":"Kotlowski, W., K. Dembczynski, and Eyke Hüllermeier. “Bipartite Ranking through Minimization of Univariate Loss.” In <i>In Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA</i>, 2011."},"year":"2011","title":"Bipartite ranking through minimization of univariate loss","author":[{"full_name":"Kotlowski, W.","last_name":"Kotlowski","first_name":"W."},{"first_name":"K.","full_name":"Dembczynski, K.","last_name":"Dembczynski"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"}],"date_created":"2019-10-02T16:21:06Z","date_updated":"2022-01-06T06:51:40Z"},{"language":[{"iso":"eng"}],"_id":"13643","user_id":"398","department":[{"_id":"78"}],"status":"public","type":"conference","publication":"Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)","title":"Memory Virtualization for Multithreaded Reconfigurable Hardware","doi":"10.1109/fpl.2011.42","date_updated":"2022-01-06T06:51:40Z","publisher":"IEEE","author":[{"last_name":"Agne","full_name":"Agne, Andreas","first_name":"Andreas"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"full_name":"Lübbers, Enno","last_name":"Lübbers","first_name":"Enno"}],"date_created":"2019-10-04T22:42:51Z","year":"2011","citation":{"ama":"Agne A, Platzner M, Lübbers E. Memory Virtualization for Multithreaded Reconfigurable Hardware. In: <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>. IEEE; 2011:185-188. doi:<a href=\"https://doi.org/10.1109/fpl.2011.42\">10.1109/fpl.2011.42</a>","chicago":"Agne, Andreas, Marco Platzner, and Enno Lübbers. “Memory Virtualization for Multithreaded Reconfigurable Hardware.” In <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, 185–88. IEEE, 2011. <a href=\"https://doi.org/10.1109/fpl.2011.42\">https://doi.org/10.1109/fpl.2011.42</a>.","ieee":"A. Agne, M. Platzner, and E. Lübbers, “Memory Virtualization for Multithreaded Reconfigurable Hardware,” in <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, 2011, pp. 185–188.","apa":"Agne, A., Platzner, M., &#38; Lübbers, E. (2011). Memory Virtualization for Multithreaded Reconfigurable Hardware. In <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i> (pp. 185–188). IEEE. <a href=\"https://doi.org/10.1109/fpl.2011.42\">https://doi.org/10.1109/fpl.2011.42</a>","bibtex":"@inproceedings{Agne_Platzner_Lübbers_2011, title={Memory Virtualization for Multithreaded Reconfigurable Hardware}, DOI={<a href=\"https://doi.org/10.1109/fpl.2011.42\">10.1109/fpl.2011.42</a>}, booktitle={Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)}, publisher={IEEE}, author={Agne, Andreas and Platzner, Marco and Lübbers, Enno}, year={2011}, pages={185–188} }","short":"A. Agne, M. Platzner, E. Lübbers, in: Proceedings of the International Conference on Field Programmable Logic and Applications (FPL), IEEE, 2011, pp. 185–188.","mla":"Agne, Andreas, et al. “Memory Virtualization for Multithreaded Reconfigurable Hardware.” <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, IEEE, 2011, pp. 185–88, doi:<a href=\"https://doi.org/10.1109/fpl.2011.42\">10.1109/fpl.2011.42</a>."},"page":"185-188","publication_status":"published","publication_identifier":{"isbn":["9781457714849"]}},{"type":"conference","publication":"Proceedings of the seventh IEEE/ACM/IFIP International Conference on Hardware/software Codesign and system synthesis - CODES+ISSS '11","status":"public","_id":"13644","user_id":"398","department":[{"_id":"78"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781450307154"]},"year":"2011","citation":{"apa":"Henkel, J., Hedrich, L., Herkersdorf, A., Kapitza, R., Lohmann, D., Marwedel, P., … Härtig, H. (2011). Design and architectures for dependable embedded systems. In <i>Proceedings of the seventh IEEE/ACM/IFIP International Conference on Hardware/software Codesign and system synthesis - CODES+ISSS ’11</i>. <a href=\"https://doi.org/10.1145/2039370.2039384\">https://doi.org/10.1145/2039370.2039384</a>","mla":"Henkel, Jörg, et al. “Design and Architectures for Dependable Embedded Systems.” <i>Proceedings of the Seventh IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis - CODES+ISSS ’11</i>, 2011, doi:<a href=\"https://doi.org/10.1145/2039370.2039384\">10.1145/2039370.2039384</a>.","short":"J. Henkel, L. Hedrich, A. Herkersdorf, R. Kapitza, D. Lohmann, P. Marwedel, M. Platzner, W. Rosenstiel, U. Schlichtmann, O. Spinczyk, M. Tahoori, L. Bauer, J. Teich, N. Wehn, H.-J. Wunderlich, J. Becker, O. Bringmann, U. Brinkschulte, S. Chakraborty, M. Engel, R. Ernst, H. Härtig, in: Proceedings of the Seventh IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis - CODES+ISSS ’11, 2011.","bibtex":"@inproceedings{Henkel_Hedrich_Herkersdorf_Kapitza_Lohmann_Marwedel_Platzner_Rosenstiel_Schlichtmann_Spinczyk_et al._2011, title={Design and architectures for dependable embedded systems}, DOI={<a href=\"https://doi.org/10.1145/2039370.2039384\">10.1145/2039370.2039384</a>}, booktitle={Proceedings of the seventh IEEE/ACM/IFIP International Conference on Hardware/software Codesign and system synthesis - CODES+ISSS ’11}, author={Henkel, Jörg and Hedrich, Lars and Herkersdorf, Andreas and Kapitza, Rüdiger and Lohmann, Daniel and Marwedel, Peter and Platzner, Marco and Rosenstiel, Wolfgang and Schlichtmann, Ulf and Spinczyk, Olaf and et al.}, year={2011} }","ieee":"J. Henkel <i>et al.</i>, “Design and architectures for dependable embedded systems,” in <i>Proceedings of the seventh IEEE/ACM/IFIP International Conference on Hardware/software Codesign and system synthesis - CODES+ISSS ’11</i>, 2011.","chicago":"Henkel, Jörg, Lars Hedrich, Andreas Herkersdorf, Rüdiger Kapitza, Daniel Lohmann, Peter Marwedel, Marco Platzner, et al. “Design and Architectures for Dependable Embedded Systems.” In <i>Proceedings of the Seventh IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis - CODES+ISSS ’11</i>, 2011. <a href=\"https://doi.org/10.1145/2039370.2039384\">https://doi.org/10.1145/2039370.2039384</a>.","ama":"Henkel J, Hedrich L, Herkersdorf A, et al. Design and architectures for dependable embedded systems. In: <i>Proceedings of the Seventh IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis - CODES+ISSS ’11</i>. ; 2011. doi:<a href=\"https://doi.org/10.1145/2039370.2039384\">10.1145/2039370.2039384</a>"},"date_updated":"2022-01-06T06:51:40Z","date_created":"2019-10-04T22:44:36Z","author":[{"first_name":"Jörg","full_name":"Henkel, Jörg","last_name":"Henkel"},{"first_name":"Lars","full_name":"Hedrich, Lars","last_name":"Hedrich"},{"first_name":"Andreas","last_name":"Herkersdorf","full_name":"Herkersdorf, Andreas"},{"full_name":"Kapitza, Rüdiger","last_name":"Kapitza","first_name":"Rüdiger"},{"full_name":"Lohmann, Daniel","last_name":"Lohmann","first_name":"Daniel"},{"first_name":"Peter","full_name":"Marwedel, Peter","last_name":"Marwedel"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"last_name":"Rosenstiel","full_name":"Rosenstiel, Wolfgang","first_name":"Wolfgang"},{"full_name":"Schlichtmann, Ulf","last_name":"Schlichtmann","first_name":"Ulf"},{"first_name":"Olaf","last_name":"Spinczyk","full_name":"Spinczyk, Olaf"},{"last_name":"Tahoori","full_name":"Tahoori, Mehdi","first_name":"Mehdi"},{"full_name":"Bauer, Lars","last_name":"Bauer","first_name":"Lars"},{"first_name":"Jürgen","full_name":"Teich, Jürgen","last_name":"Teich"},{"first_name":"Norbert","last_name":"Wehn","full_name":"Wehn, Norbert"},{"full_name":"Wunderlich, Hans-Joachim","last_name":"Wunderlich","first_name":"Hans-Joachim"},{"first_name":"Joachim","last_name":"Becker","full_name":"Becker, Joachim"},{"first_name":"Oliver","last_name":"Bringmann","full_name":"Bringmann, Oliver"},{"first_name":"Uwe","last_name":"Brinkschulte","full_name":"Brinkschulte, Uwe"},{"full_name":"Chakraborty, Samarjit","last_name":"Chakraborty","first_name":"Samarjit"},{"first_name":"Michael","last_name":"Engel","full_name":"Engel, Michael"},{"last_name":"Ernst","full_name":"Ernst, Rolf","first_name":"Rolf"},{"first_name":"Hermann","last_name":"Härtig","full_name":"Härtig, Hermann"}],"title":"Design and architectures for dependable embedded systems","doi":"10.1145/2039370.2039384"},{"_id":"1376","user_id":"15572","department":[{"_id":"75"}],"status":"public","type":"journal_article","publication":"Journal of Advances in Information Technology","title":"Complex Queries in P2P Networks with Resource-Constrained Devices","doi":"10.4304/jait.2.1.2-14","publisher":"Engineering and Technology Publishing","date_updated":"2022-01-06T06:51:43Z","author":[{"last_name":"Dannewitz","full_name":"Dannewitz, Christian","first_name":"Christian"},{"full_name":"Biermann, Thorsten","last_name":"Biermann","first_name":"Thorsten"},{"full_name":"Dräxler, Martin","last_name":"Dräxler","first_name":"Martin"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2018-03-19T14:28:44Z","volume":2,"year":"2011","citation":{"ama":"Dannewitz C, Biermann T, Dräxler M, Karl H. Complex Queries in P2P Networks with Resource-Constrained Devices. <i>Journal of Advances in Information Technology</i>. 2011;2(1). doi:<a href=\"https://doi.org/10.4304/jait.2.1.2-14\">10.4304/jait.2.1.2-14</a>","ieee":"C. Dannewitz, T. Biermann, M. Dräxler, and H. Karl, “Complex Queries in P2P Networks with Resource-Constrained Devices,” <i>Journal of Advances in Information Technology</i>, vol. 2, no. 1, 2011.","chicago":"Dannewitz, Christian, Thorsten Biermann, Martin Dräxler, and Holger Karl. “Complex Queries in P2P Networks with Resource-Constrained Devices.” <i>Journal of Advances in Information Technology</i> 2, no. 1 (2011). <a href=\"https://doi.org/10.4304/jait.2.1.2-14\">https://doi.org/10.4304/jait.2.1.2-14</a>.","apa":"Dannewitz, C., Biermann, T., Dräxler, M., &#38; Karl, H. (2011). Complex Queries in P2P Networks with Resource-Constrained Devices. <i>Journal of Advances in Information Technology</i>, <i>2</i>(1). <a href=\"https://doi.org/10.4304/jait.2.1.2-14\">https://doi.org/10.4304/jait.2.1.2-14</a>","mla":"Dannewitz, Christian, et al. “Complex Queries in P2P Networks with Resource-Constrained Devices.” <i>Journal of Advances in Information Technology</i>, vol. 2, no. 1, Engineering and Technology Publishing, 2011, doi:<a href=\"https://doi.org/10.4304/jait.2.1.2-14\">10.4304/jait.2.1.2-14</a>.","short":"C. Dannewitz, T. Biermann, M. Dräxler, H. Karl, Journal of Advances in Information Technology 2 (2011).","bibtex":"@article{Dannewitz_Biermann_Dräxler_Karl_2011, title={Complex Queries in P2P Networks with Resource-Constrained Devices}, volume={2}, DOI={<a href=\"https://doi.org/10.4304/jait.2.1.2-14\">10.4304/jait.2.1.2-14</a>}, number={1}, journal={Journal of Advances in Information Technology}, publisher={Engineering and Technology Publishing}, author={Dannewitz, Christian and Biermann, Thorsten and Dräxler, Martin and Karl, Holger}, year={2011} }"},"intvolume":"         2","publication_status":"published","publication_identifier":{"issn":["1798-2340"]},"issue":"1"},{"publication_identifier":{"isbn":["9781450305570"]},"year":"2011","place":"New York, NY, USA","citation":{"ama":"Mersmann O, Bischl B, Trautmann H, Preuss M, Weihs C, Rudolph G. Exploratory Landscape Analysis. In: <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>. GECCO ’11. Association for Computing Machinery; 2011:829–836. doi:<a href=\"https://doi.org/10.1145/2001576.2001690\">10.1145/2001576.2001690</a>","ieee":"O. Mersmann, B. Bischl, H. Trautmann, M. Preuss, C. Weihs, and G. Rudolph, “Exploratory Landscape Analysis,” in <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>, 2011, pp. 829–836, doi: <a href=\"https://doi.org/10.1145/2001576.2001690\">10.1145/2001576.2001690</a>.","chicago":"Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and Günter Rudolph. “Exploratory Landscape Analysis.” In <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>, 829–836. GECCO ’11. New York, NY, USA: Association for Computing Machinery, 2011. <a href=\"https://doi.org/10.1145/2001576.2001690\">https://doi.org/10.1145/2001576.2001690</a>.","apa":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., &#38; Rudolph, G. (2011). Exploratory Landscape Analysis. <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>, 829–836. <a href=\"https://doi.org/10.1145/2001576.2001690\">https://doi.org/10.1145/2001576.2001690</a>","bibtex":"@inproceedings{Mersmann_Bischl_Trautmann_Preuss_Weihs_Rudolph_2011, place={New York, NY, USA}, series={GECCO ’11}, title={Exploratory Landscape Analysis}, DOI={<a href=\"https://doi.org/10.1145/2001576.2001690\">10.1145/2001576.2001690</a>}, booktitle={Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation}, publisher={Association for Computing Machinery}, author={Mersmann, Olaf and Bischl, Bernd and Trautmann, Heike and Preuss, Mike and Weihs, Claus and Rudolph, Günter}, year={2011}, pages={829–836}, collection={GECCO ’11} }","short":"O. Mersmann, B. Bischl, H. Trautmann, M. Preuss, C. Weihs, G. Rudolph, in: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, Association for Computing Machinery, New York, NY, USA, 2011, pp. 829–836.","mla":"Mersmann, Olaf, et al. “Exploratory Landscape Analysis.” <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>, Association for Computing Machinery, 2011, pp. 829–836, doi:<a href=\"https://doi.org/10.1145/2001576.2001690\">10.1145/2001576.2001690</a>."},"page":"829–836","publisher":"Association for Computing Machinery","date_updated":"2023-10-16T13:54:34Z","date_created":"2023-08-04T15:58:22Z","author":[{"first_name":"Olaf","last_name":"Mersmann","full_name":"Mersmann, Olaf"},{"first_name":"Bernd","full_name":"Bischl, Bernd","last_name":"Bischl"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike","id":"100740","first_name":"Heike"},{"first_name":"Mike","full_name":"Preuss, Mike","last_name":"Preuss"},{"full_name":"Weihs, Claus","last_name":"Weihs","first_name":"Claus"},{"last_name":"Rudolph","full_name":"Rudolph, Günter","first_name":"Günter"}],"title":"Exploratory Landscape Analysis","doi":"10.1145/2001576.2001690","type":"conference","publication":"Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation","abstract":[{"lang":"eng","text":"Exploratory Landscape Analysis subsumes a number of techniques employed to obtain knowledge about the properties of an unknown optimization problem, especially insofar as these properties are important for the performance of optimization algorithms. Where in a first attempt, one could rely on high-level features designed by experts, we approach the problem from a different angle here, namely by using relatively cheap low-level computer generated features. Interestingly, very few features are needed to separate the BBOB problem groups and also for relating a problem to high-level, expert designed features, paving the way for automatic algorithm selection."}],"status":"public","_id":"46401","series_title":"GECCO ’11","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"keyword":["exploratory landscape analysis","evolutionary optimization","fitness landscape","benchmarking","BBOB test set"],"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"46402","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","abstract":[{"text":"The use of multi-objective evolutionary algorithms for solving black-box problems with multiple conflicting objectives has become an important research area. However, when no gradient information is available, the examination of formal convergence or optimality criteria is often impossible. Thus, sophisticated heuristic online stopping criteria (OSC) have recently become subject of intensive research. In order to establish formal guidelines for a systematic research, we present a taxonomy of OSC in this paper. We integrate the known approaches within the taxonomy and discuss them by extracting their building blocks. The formal structure of the taxonomy is used as a basis for the implementation of a comprehensive MATLAB toolbox. Both contributions, the formal taxonomy and the MATLAB implementation, provide a framework for the analysis and evaluation of existing and new OSC approaches.","lang":"eng"}],"editor":[{"first_name":"Ricardo H. C.","last_name":"Takahashi","full_name":"Takahashi, Ricardo H. C."},{"first_name":"Kalyanmoy","last_name":"Deb","full_name":"Deb, Kalyanmoy"},{"first_name":"Elizabeth F.","full_name":"Wanner, Elizabeth F.","last_name":"Wanner"},{"full_name":"Greco, Salvatore","last_name":"Greco","first_name":"Salvatore"}],"status":"public","publication":"Evolutionary Multi-Criterion Optimization","type":"conference","title":"A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms","doi":"https://doi.org/10.1007/978-3-642-19893-9_2","publisher":"Springer Berlin Heidelberg","date_updated":"2023-10-16T13:54:50Z","date_created":"2023-08-04T15:59:18Z","author":[{"first_name":"Tobias","last_name":"Wagner","full_name":"Wagner, Tobias"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740","full_name":"Trautmann, Heike"},{"full_name":"Martí, Luis","last_name":"Martí","first_name":"Luis"}],"year":"2011","place":"Berlin, Heidelberg","page":"16–30","citation":{"ama":"Wagner T, Trautmann H, Martí L. A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms. In: Takahashi RHC, Deb K, Wanner EF, Greco S, eds. <i>Evolutionary Multi-Criterion Optimization</i>. Springer Berlin Heidelberg; 2011:16–30. doi:<a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>","ieee":"T. Wagner, H. Trautmann, and L. Martí, “A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms,” in <i>Evolutionary Multi-Criterion Optimization</i>, 2011, pp. 16–30, doi: <a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>.","chicago":"Wagner, Tobias, Heike Trautmann, and Luis Martí. “A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms.” In <i>Evolutionary Multi-Criterion Optimization</i>, edited by Ricardo H. C. Takahashi, Kalyanmoy Deb, Elizabeth F. Wanner, and Salvatore Greco, 16–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>.","short":"T. Wagner, H. Trautmann, L. Martí, in: R.H.C. Takahashi, K. Deb, E.F. Wanner, S. Greco (Eds.), Evolutionary Multi-Criterion Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 16–30.","mla":"Wagner, Tobias, et al. “A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms.” <i>Evolutionary Multi-Criterion Optimization</i>, edited by Ricardo H. C. Takahashi et al., Springer Berlin Heidelberg, 2011, pp. 16–30, doi:<a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>.","bibtex":"@inproceedings{Wagner_Trautmann_Martí_2011, place={Berlin, Heidelberg}, title={A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>}, booktitle={Evolutionary Multi-Criterion Optimization}, publisher={Springer Berlin Heidelberg}, author={Wagner, Tobias and Trautmann, Heike and Martí, Luis}, editor={Takahashi, Ricardo H. C. and Deb, Kalyanmoy and Wanner, Elizabeth F. and Greco, Salvatore}, year={2011}, pages={16–30} }","apa":"Wagner, T., Trautmann, H., &#38; Martí, L. (2011). A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms. In R. H. C. Takahashi, K. Deb, E. F. Wanner, &#38; S. Greco (Eds.), <i>Evolutionary Multi-Criterion Optimization</i> (pp. 16–30). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>"},"publication_identifier":{"isbn":["978-3-642-19893-9"]}},{"issue":"10","year":"2011","citation":{"apa":"Naujoks, B., Trautmann, H., Wessing, S., &#38; Weihs, C. (2011). Advanced concepts for multi-objective evolutionary optimization in aircraft industry. <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i>, <i>225</i>(10), 1081–1096. <a href=\"https://doi.org/10.1177/0954410011414120\">https://doi.org/10.1177/0954410011414120</a>","bibtex":"@article{Naujoks_Trautmann_Wessing_Weihs_2011, title={Advanced concepts for multi-objective evolutionary optimization in aircraft industry}, volume={225}, DOI={<a href=\"https://doi.org/10.1177/0954410011414120\">10.1177/0954410011414120</a>}, number={10}, journal={Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering}, author={Naujoks, B and Trautmann, Heike and Wessing, S and Weihs, C}, year={2011}, pages={1081–1096} }","mla":"Naujoks, B., et al. “Advanced Concepts for Multi-Objective Evolutionary Optimization in Aircraft Industry.” <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i>, vol. 225, no. 10, 2011, pp. 1081–96, doi:<a href=\"https://doi.org/10.1177/0954410011414120\">10.1177/0954410011414120</a>.","short":"B. Naujoks, H. Trautmann, S. Wessing, C. Weihs, Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering 225 (2011) 1081–1096.","ama":"Naujoks B, Trautmann H, Wessing S, Weihs C. Advanced concepts for multi-objective evolutionary optimization in aircraft industry. <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i>. 2011;225(10):1081-1096. doi:<a href=\"https://doi.org/10.1177/0954410011414120\">10.1177/0954410011414120</a>","ieee":"B. Naujoks, H. Trautmann, S. Wessing, and C. Weihs, “Advanced concepts for multi-objective evolutionary optimization in aircraft industry,” <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i>, vol. 225, no. 10, pp. 1081–1096, 2011, doi: <a href=\"https://doi.org/10.1177/0954410011414120\">10.1177/0954410011414120</a>.","chicago":"Naujoks, B, Heike Trautmann, S Wessing, and C Weihs. “Advanced Concepts for Multi-Objective Evolutionary Optimization in Aircraft Industry.” <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i> 225, no. 10 (2011): 1081–96. <a href=\"https://doi.org/10.1177/0954410011414120\">https://doi.org/10.1177/0954410011414120</a>."},"intvolume":"       225","page":"1081-1096","date_updated":"2023-10-16T13:55:07Z","author":[{"first_name":"B","last_name":"Naujoks","full_name":"Naujoks, B"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"},{"first_name":"S","full_name":"Wessing, S","last_name":"Wessing"},{"full_name":"Weihs, C","last_name":"Weihs","first_name":"C"}],"date_created":"2023-08-04T16:00:28Z","volume":225,"title":"Advanced concepts for multi-objective evolutionary optimization in aircraft industry","doi":"10.1177/0954410011414120","type":"journal_article","publication":"Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering","abstract":[{"lang":"eng","text":" Evolutionary (multi-objective optimization) algorithms (EMOAs) are widely accepted to be competitive optimization methods in industry today. However, normally only standard techniques are employed by the engineering experts. Here, it is shown how these standard techniques can be completed and improved with respect to interactivity to other tools, runtime, and parameterization. The coupling with metamodels serves as an example for the interactivity to other tools, while the online convergence detection relates to runtime, i.e. stopping criteria. Finally, sequential parameter optimization improves results focussing on parameter tuning. We show that invoking all these methods on their own already enhances EMOAs for aerodynamic applications. It is concluded with an outlook on how these methods might come together to foster aerospace applications and, at a time, widen the application area to multi-disciplinary optimization tasks. "}],"status":"public","_id":"46403","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"language":[{"iso":"eng"}]},{"publication_status":"published","year":"2011","citation":{"apa":"Naewe, S. (2011). <i>Algorithms for lattice problems with respect to general norms</i>. Universität Paderborn.","mla":"Naewe, Stefanie. <i>Algorithms for Lattice Problems with Respect to General Norms</i>. Universität Paderborn, 2011.","short":"S.  Naewe, Algorithms for Lattice Problems with Respect to General Norms, Universität Paderborn, 2011.","bibtex":"@book{ Naewe_2011, title={Algorithms for lattice problems with respect to general norms}, publisher={Universität Paderborn}, author={ Naewe, Stefanie}, year={2011} }","ieee":"S.  Naewe, <i>Algorithms for lattice problems with respect to general norms</i>. Universität Paderborn, 2011.","chicago":"Naewe, Stefanie. <i>Algorithms for Lattice Problems with Respect to General Norms</i>. Universität Paderborn, 2011.","ama":"Naewe S. <i>Algorithms for Lattice Problems with Respect to General Norms</i>. Universität Paderborn; 2011."},"date_updated":"2024-08-08T12:17:02Z","publisher":"Universität Paderborn","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2018-05-25T10:08:44Z","author":[{"last_name":" Naewe","full_name":" Naewe, Stefanie","id":"1971","first_name":"Stefanie"}],"title":"Algorithms for lattice problems with respect to general norms","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-8047"}],"type":"dissertation","status":"public","_id":"2910","department":[{"_id":"64"}],"user_id":"49063","language":[{"iso":"eng"}]},{"type":"conference","status":"public","_id":"37001","department":[{"_id":"672"}],"user_id":"5786","language":[{"iso":"eng"}],"year":"2011","place":"Paderborn","citation":{"ama":"Becker M, Zabel H, Müller W, Elfeky A. Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie. In: ; 2011.","chicago":"Becker, Markus, Henning Zabel, Wolfgang Müller, and Ahmed Elfeky. “Virtual Prototyping Software-Intensiver Mechatronischer Systeme - Eine Fallstudie.” Paderborn, 2011.","ieee":"M. Becker, H. Zabel, W. Müller, and A. Elfeky, “Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie,” presented at the 8. Paderborner Workshop Entwurf Mechatronischer Systeme, 2011.","apa":"Becker, M., Zabel, H., Müller, W., &#38; Elfeky, A. (2011). <i>Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie</i>. 8. Paderborner Workshop Entwurf Mechatronischer Systeme.","short":"M. Becker, H. Zabel, W. Müller, A. Elfeky, in: Paderborn, 2011.","mla":"Becker, Markus, et al. <i>Virtual Prototyping Software-Intensiver Mechatronischer Systeme - Eine Fallstudie</i>. 2011.","bibtex":"@inproceedings{Becker_Zabel_Müller_Elfeky_2011, place={Paderborn}, title={Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie}, author={Becker, Markus and Zabel, Henning and Müller, Wolfgang and Elfeky, Ahmed}, year={2011} }"},"date_updated":"2023-01-17T08:59:47Z","date_created":"2023-01-17T08:59:23Z","author":[{"first_name":"Markus","full_name":"Becker, Markus","last_name":"Becker"},{"full_name":"Zabel, Henning","last_name":"Zabel","first_name":"Henning"},{"first_name":"Wolfgang","last_name":"Müller","full_name":"Müller, Wolfgang","id":"16243"},{"full_name":"Elfeky, Ahmed","last_name":"Elfeky","first_name":"Ahmed"}],"title":"Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie","conference":{"name":"8. Paderborner Workshop Entwurf Mechatronischer Systeme"}},{"department":[{"_id":"672"}],"user_id":"5786","_id":"37005","language":[{"iso":"eng"}],"type":"conference","status":"public","author":[{"full_name":"Kuznik, Christoph","last_name":"Kuznik","first_name":"Christoph"},{"first_name":"Wolfgang","last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang"}],"date_created":"2023-01-17T09:05:48Z","date_updated":"2023-01-17T09:05:58Z","conference":{"name":"Proceedings of the Design and Verification Conference (DVCON 2011)","location":"San Jose, CA"},"title":"A SystemC Based Library for Functional Coverage","citation":{"apa":"Kuznik, C., &#38; Müller, W. (2011). <i>A SystemC Based Library for Functional Coverage</i>. Proceedings of the Design and Verification Conference (DVCON 2011), San Jose, CA.","mla":"Kuznik, Christoph, and Wolfgang Müller. <i>A SystemC Based Library for Functional Coverage</i>. 2011.","short":"C. Kuznik, W. Müller, in: 2011.","bibtex":"@inproceedings{Kuznik_Müller_2011, title={A SystemC Based Library for Functional Coverage}, author={Kuznik, Christoph and Müller, Wolfgang}, year={2011} }","ama":"Kuznik C, Müller W. A SystemC Based Library for Functional Coverage. In: ; 2011.","chicago":"Kuznik, Christoph, and Wolfgang Müller. “A SystemC Based Library for Functional Coverage,” 2011.","ieee":"C. Kuznik and W. Müller, “A SystemC Based Library for Functional Coverage,” presented at the Proceedings of the Design and Verification Conference (DVCON 2011), San Jose, CA, 2011."},"year":"2011"},{"date_created":"2023-01-17T09:09:25Z","author":[{"first_name":"Kay","full_name":"Klobedanz, Kay","last_name":"Klobedanz"},{"full_name":"König, Andreas","last_name":"König","first_name":"Andreas"},{"id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang"}],"date_updated":"2023-01-17T09:09:33Z","publisher":"IEEE","conference":{"name":"2011 Design, Automation & Test in Europe","location":"Grenoble, France"},"doi":"10.1109/DATE.2011.5763022","title":"A Reconfiguration Approach for Faul-Tolerant FlexRay Networks","citation":{"apa":"Klobedanz, K., König, A., &#38; Müller, W. (2011). A Reconfiguration Approach for Faul-Tolerant FlexRay Networks. <i>Proceedings of DATE’11</i>. 2011 Design, Automation &#38; Test in Europe, Grenoble, France. <a href=\"https://doi.org/10.1109/DATE.2011.5763022\">https://doi.org/10.1109/DATE.2011.5763022</a>","mla":"Klobedanz, Kay, et al. “A Reconfiguration Approach for Faul-Tolerant FlexRay Networks.” <i>Proceedings of DATE’11</i>, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/DATE.2011.5763022\">10.1109/DATE.2011.5763022</a>.","short":"K. Klobedanz, A. König, W. Müller, in: Proceedings of DATE’11, IEEE, Grenoble, France, 2011.","bibtex":"@inproceedings{Klobedanz_König_Müller_2011, place={Grenoble, France}, title={A Reconfiguration Approach for Faul-Tolerant FlexRay Networks}, DOI={<a href=\"https://doi.org/10.1109/DATE.2011.5763022\">10.1109/DATE.2011.5763022</a>}, booktitle={Proceedings of DATE’11}, publisher={IEEE}, author={Klobedanz, Kay and König, Andreas and Müller, Wolfgang}, year={2011} }","ieee":"K. Klobedanz, A. König, and W. Müller, “A Reconfiguration Approach for Faul-Tolerant FlexRay Networks,” presented at the 2011 Design, Automation &#38; Test in Europe, Grenoble, France, 2011, doi: <a href=\"https://doi.org/10.1109/DATE.2011.5763022\">10.1109/DATE.2011.5763022</a>.","chicago":"Klobedanz, Kay, Andreas König, and Wolfgang Müller. “A Reconfiguration Approach for Faul-Tolerant FlexRay Networks.” In <i>Proceedings of DATE’11</i>. Grenoble, France: IEEE, 2011. <a href=\"https://doi.org/10.1109/DATE.2011.5763022\">https://doi.org/10.1109/DATE.2011.5763022</a>.","ama":"Klobedanz K, König A, Müller W. A Reconfiguration Approach for Faul-Tolerant FlexRay Networks. In: <i>Proceedings of DATE’11</i>. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/DATE.2011.5763022\">10.1109/DATE.2011.5763022</a>"},"place":"Grenoble, France","year":"2011","user_id":"5786","department":[{"_id":"672"}],"_id":"37006","language":[{"iso":"eng"}],"keyword":["Schedules","Fault tolerant systems","Redundancy","Protocols","Automotive engineering","Genetic algorithms"],"type":"conference","publication":"Proceedings of DATE'11","status":"public","abstract":[{"text":"In this paper we present an approach for the configuration and reconfiguration of FlexRay networks to increase their fault tolerance. To guarantee a correct and deterministic system behavior, the FlexRay specification does not allow a reconfiguration of the schedapproachule during run time. To avoid the necessity of a complete bus restart in case of a node failure, we propose a reconfiguration using redundant slots in the schedule and/or combine messages in existing frames and slots, to compensate node failures and increase robustness. Our approach supports the developer to increase the fault tolerance of the system during the design phase. It is a heuristic, which, additionally to a determined initial configuration, calculates possible reconfigurations for the remaining nodes of the FlexRay network in case of a node failure, to keep the system working properly. An evaluation by means of realistic safety-critical automotive real-time systems revealed that it determines valid reconfigurations for up to 80% of possible individual node failures. In summary, our approach offers major support for the developer of FlexRay networks since the results provide helpful feedback about reconfiguration capabilities. In an iterative design process these information can be used to determine and optimize valid reconfigurations.","lang":"eng"}]},{"publication_status":"published","publication_identifier":{"issn":["0219-7499","1793-6918"]},"citation":{"chicago":"Gharibian, Sevag, MARCO PIANI, GERARDO ADESSO, JOHN CALSAMIGLIA, and PAWEŁ HORODECKI. “Characterizing Quantumness via Entanglement Creation.” <i>International Journal of Quantum Information</i> 09, no. 07n08 (2011): 1701–13. <a href=\"https://doi.org/10.1142/s0219749911008258\">https://doi.org/10.1142/s0219749911008258</a>.","ieee":"S. Gharibian, M. PIANI, G. ADESSO, J. CALSAMIGLIA, and P. HORODECKI, “Characterizing Quantumness via Entanglement Creation,” <i>International Journal of Quantum Information</i>, vol. 09, no. 07n08, pp. 1701–1713, 2011, doi: <a href=\"https://doi.org/10.1142/s0219749911008258\">10.1142/s0219749911008258</a>.","ama":"Gharibian S, PIANI M, ADESSO G, CALSAMIGLIA J, HORODECKI P. Characterizing Quantumness via Entanglement Creation. <i>International Journal of Quantum Information</i>. 2011;09(07n08):1701-1713. doi:<a href=\"https://doi.org/10.1142/s0219749911008258\">10.1142/s0219749911008258</a>","short":"S. Gharibian, M. PIANI, G. ADESSO, J. CALSAMIGLIA, P. HORODECKI, International Journal of Quantum Information 09 (2011) 1701–1713.","mla":"Gharibian, Sevag, et al. “Characterizing Quantumness via Entanglement Creation.” <i>International Journal of Quantum Information</i>, vol. 09, no. 07n08, World Scientific Pub Co Pte Lt, 2011, pp. 1701–13, doi:<a href=\"https://doi.org/10.1142/s0219749911008258\">10.1142/s0219749911008258</a>.","bibtex":"@article{Gharibian_PIANI_ADESSO_CALSAMIGLIA_HORODECKI_2011, title={Characterizing Quantumness via Entanglement Creation}, volume={09}, DOI={<a href=\"https://doi.org/10.1142/s0219749911008258\">10.1142/s0219749911008258</a>}, number={07n08}, journal={International Journal of Quantum Information}, publisher={World Scientific Pub Co Pte Lt}, author={Gharibian, Sevag and PIANI, MARCO and ADESSO, GERARDO and CALSAMIGLIA, JOHN and HORODECKI, PAWEŁ}, year={2011}, pages={1701–1713} }","apa":"Gharibian, S., PIANI, M., ADESSO, G., CALSAMIGLIA, J., &#38; HORODECKI, P. (2011). Characterizing Quantumness via Entanglement Creation. <i>International Journal of Quantum Information</i>, <i>09</i>(07n08), 1701–1713. <a href=\"https://doi.org/10.1142/s0219749911008258\">https://doi.org/10.1142/s0219749911008258</a>"},"intvolume":"         9","page":"1701-1713","author":[{"first_name":"Sevag","id":"71541","full_name":"Gharibian, Sevag","last_name":"Gharibian","orcid":"0000-0002-9992-3379"},{"first_name":"MARCO","last_name":"PIANI","full_name":"PIANI, MARCO"},{"last_name":"ADESSO","full_name":"ADESSO, GERARDO","first_name":"GERARDO"},{"first_name":"JOHN","full_name":"CALSAMIGLIA, JOHN","last_name":"CALSAMIGLIA"},{"first_name":"PAWEŁ","last_name":"HORODECKI","full_name":"HORODECKI, PAWEŁ"}],"volume":"09","date_updated":"2023-02-28T11:04:25Z","oa":"1","main_file_link":[{"url":"https://arxiv.org/abs/1105.3419","open_access":"1"}],"doi":"10.1142/s0219749911008258","type":"journal_article","status":"public","user_id":"71541","department":[{"_id":"623"},{"_id":"7"}],"_id":"8178","extern":"1","article_type":"original","issue":"07n08","year":"2011","date_created":"2019-03-01T12:08:55Z","publisher":"World Scientific Pub Co Pte Lt","title":"Characterizing Quantumness via Entanglement Creation","publication":"International Journal of Quantum Information","abstract":[{"lang":"eng","text":"In [Piani et al., PRL106 (2011) 220403], an activation protocol was introduced which maps the general non-classical (multipartite) correlations between given systems into bipartite entanglement between the systems and local ancillae by means of a potentially highly entangling interaction. Here, we study how this activation protocol can be used to entangle the starting systems themselves via entanglement swapping through a measurement on the ancillae. Furthermore, we bound the relative entropy of quantumness (a naturally arising measure of non-classicality in the scheme of Piani et al. above) for a special class of separable states, the so-called classical–quantum states. In particular, we fully characterize the classical–quantum two-qubit states that are maximally non-classical."}],"external_id":{"arxiv":["1105.3419"]},"language":[{"iso":"eng"}]},{"publication_status":"published","publication_identifier":{"isbn":["9781457701795"]},"citation":{"ama":"Gharibian S, Kempe J. Approximation Algorithms for QMA-Complete Problems. In: <i>IEEE Annual Conference on Computational Complexity (CCC 2011)</i>. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/ccc.2011.15\">10.1109/ccc.2011.15</a>","ieee":"S. Gharibian and J. Kempe, “Approximation Algorithms for QMA-Complete Problems,” presented at the 2011 IEEE 26th Annual Conference on Computational Complexity (CCC), San Jose, USA, 2011, doi: <a href=\"https://doi.org/10.1109/ccc.2011.15\">10.1109/ccc.2011.15</a>.","chicago":"Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete Problems.” In <i>IEEE Annual Conference on Computational Complexity (CCC 2011)</i>. IEEE, 2011. <a href=\"https://doi.org/10.1109/ccc.2011.15\">https://doi.org/10.1109/ccc.2011.15</a>.","mla":"Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete Problems.” <i>IEEE Annual Conference on Computational Complexity (CCC 2011)</i>, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/ccc.2011.15\">10.1109/ccc.2011.15</a>.","short":"S. Gharibian, J. Kempe, in: IEEE Annual Conference on Computational Complexity (CCC 2011), IEEE, 2011.","bibtex":"@inproceedings{Gharibian_Kempe_2011, title={Approximation Algorithms for QMA-Complete Problems}, DOI={<a href=\"https://doi.org/10.1109/ccc.2011.15\">10.1109/ccc.2011.15</a>}, booktitle={IEEE Annual Conference on Computational Complexity (CCC 2011)}, publisher={IEEE}, author={Gharibian, Sevag and Kempe, Julia}, year={2011} }","apa":"Gharibian, S., &#38; Kempe, J. (2011). Approximation Algorithms for QMA-Complete Problems. <i>IEEE Annual Conference on Computational Complexity (CCC 2011)</i>. 2011 IEEE 26th Annual Conference on Computational Complexity (CCC), San Jose, USA. <a href=\"https://doi.org/10.1109/ccc.2011.15\">https://doi.org/10.1109/ccc.2011.15</a>"},"date_updated":"2023-02-28T11:04:02Z","oa":"1","author":[{"orcid":"0000-0002-9992-3379","last_name":"Gharibian","full_name":"Gharibian, Sevag","id":"71541","first_name":"Sevag"},{"first_name":"Julia","full_name":"Kempe, Julia","last_name":"Kempe"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1101.3884"}],"doi":"10.1109/ccc.2011.15","conference":{"name":"2011 IEEE 26th Annual Conference on Computational Complexity (CCC)","location":"San Jose, USA"},"type":"conference","status":"public","_id":"8176","user_id":"71541","department":[{"_id":"623"},{"_id":"7"}],"extern":"1","year":"2011","publisher":"IEEE","date_created":"2019-03-01T12:06:18Z","title":"Approximation Algorithms for QMA-Complete Problems","publication":"IEEE Annual Conference on Computational Complexity (CCC 2011)","abstract":[{"text":"Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and initiate its study. We present two main results. The first shows that a non-trivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one), gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an adaptation of the \"exhaustive sampling method\" by Arora et al. [J. Comp. Sys. Sci. 58, p.193 (1999)] to the quantum setting, and might be of independent interest.","lang":"eng"}],"external_id":{"arxiv":["1101.3884"]},"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"external_id":{"arxiv":["1103.4032"]},"abstract":[{"lang":"eng","text":"We devise a protocol in which general nonclassical multipartite correlations produce a physically relevant effect, leading to the creation of bipartite entanglement. In particular, we show that the relative entropy of quantumness, which measures all nonclassical correlations among subsystems of a quantum system, is equivalent to and can be operationally interpreted as the minimum distillable entanglement generated between the system and local ancillae in our protocol. We emphasize the key role of state mixedness in maximizing nonclassicality: Mixed entangled states can be arbitrarily more nonclassical than separable and pure entangled states."}],"publication":"Physical Review Letters","title":"All Nonclassical Correlations Can Be Activated into Distillable Entanglement","publisher":"American Physical Society (APS)","date_created":"2019-03-01T12:07:49Z","year":"2011","issue":"22","article_type":"original","extern":"1","_id":"8177","department":[{"_id":"623"},{"_id":"7"}],"user_id":"71541","status":"public","type":"journal_article","doi":"10.1103/physrevlett.106.220403","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1103.4032"}],"date_updated":"2023-02-28T11:04:13Z","oa":"1","volume":106,"author":[{"first_name":"Marco","full_name":"Piani, Marco","last_name":"Piani"},{"first_name":"Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","id":"71541","full_name":"Gharibian, Sevag"},{"first_name":"Gerardo","last_name":"Adesso","full_name":"Adesso, Gerardo"},{"first_name":"John","full_name":"Calsamiglia, John","last_name":"Calsamiglia"},{"last_name":"Horodecki","full_name":"Horodecki, Paweł","first_name":"Paweł"},{"last_name":"Winter","full_name":"Winter, Andreas","first_name":"Andreas"}],"intvolume":"       106","citation":{"apa":"Piani, M., Gharibian, S., Adesso, G., Calsamiglia, J., Horodecki, P., &#38; Winter, A. (2011). All Nonclassical Correlations Can Be Activated into Distillable Entanglement. <i>Physical Review Letters</i>, <i>106</i>(22). <a href=\"https://doi.org/10.1103/physrevlett.106.220403\">https://doi.org/10.1103/physrevlett.106.220403</a>","bibtex":"@article{Piani_Gharibian_Adesso_Calsamiglia_Horodecki_Winter_2011, title={All Nonclassical Correlations Can Be Activated into Distillable Entanglement}, volume={106}, DOI={<a href=\"https://doi.org/10.1103/physrevlett.106.220403\">10.1103/physrevlett.106.220403</a>}, number={22}, journal={Physical Review Letters}, publisher={American Physical Society (APS)}, author={Piani, Marco and Gharibian, Sevag and Adesso, Gerardo and Calsamiglia, John and Horodecki, Paweł and Winter, Andreas}, year={2011} }","short":"M. Piani, S. Gharibian, G. Adesso, J. Calsamiglia, P. Horodecki, A. Winter, Physical Review Letters 106 (2011).","mla":"Piani, Marco, et al. “All Nonclassical Correlations Can Be Activated into Distillable Entanglement.” <i>Physical Review Letters</i>, vol. 106, no. 22, American Physical Society (APS), 2011, doi:<a href=\"https://doi.org/10.1103/physrevlett.106.220403\">10.1103/physrevlett.106.220403</a>.","chicago":"Piani, Marco, Sevag Gharibian, Gerardo Adesso, John Calsamiglia, Paweł Horodecki, and Andreas Winter. “All Nonclassical Correlations Can Be Activated into Distillable Entanglement.” <i>Physical Review Letters</i> 106, no. 22 (2011). <a href=\"https://doi.org/10.1103/physrevlett.106.220403\">https://doi.org/10.1103/physrevlett.106.220403</a>.","ieee":"M. Piani, S. Gharibian, G. Adesso, J. Calsamiglia, P. Horodecki, and A. Winter, “All Nonclassical Correlations Can Be Activated into Distillable Entanglement,” <i>Physical Review Letters</i>, vol. 106, no. 22, 2011, doi: <a href=\"https://doi.org/10.1103/physrevlett.106.220403\">10.1103/physrevlett.106.220403</a>.","ama":"Piani M, Gharibian S, Adesso G, Calsamiglia J, Horodecki P, Winter A. All Nonclassical Correlations Can Be Activated into Distillable Entanglement. <i>Physical Review Letters</i>. 2011;106(22). doi:<a href=\"https://doi.org/10.1103/physrevlett.106.220403\">10.1103/physrevlett.106.220403</a>"},"publication_identifier":{"issn":["0031-9007","1079-7114"]},"publication_status":"published"},{"type":"conference","publication":"Symp. on Application Accelerators in High Performance Computing (SAAHPC)","status":"public","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"15"},{"_id":"78"}],"project":[{"name":"Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling Models","_id":"30","grant_number":"01|H11004A"}],"_id":"2194","language":[{"iso":"eng"}],"keyword":["tet_topic_hpc"],"quality_controlled":"1","citation":{"short":"B. Meyer, C. Plessl, J. Förstner, in: Symp. on Application Accelerators in High Performance Computing (SAAHPC), IEEE Computer Society, 2011, pp. 60–63.","bibtex":"@inproceedings{Meyer_Plessl_Förstner_2011, title={Transformation of scientific algorithms to parallel computing code: subdomain support in a MPI-multi-GPU backend}, DOI={<a href=\"https://doi.org/10.1109/SAAHPC.2011.12\">10.1109/SAAHPC.2011.12</a>}, booktitle={Symp. on Application Accelerators in High Performance Computing (SAAHPC)}, publisher={IEEE Computer Society}, author={Meyer, Björn and Plessl, Christian and Förstner, Jens}, year={2011}, pages={60–63} }","mla":"Meyer, Björn, et al. “Transformation of Scientific Algorithms to Parallel Computing Code: Subdomain Support in a MPI-Multi-GPU Backend.” <i>Symp. on Application Accelerators in High Performance Computing (SAAHPC)</i>, IEEE Computer Society, 2011, pp. 60–63, doi:<a href=\"https://doi.org/10.1109/SAAHPC.2011.12\">10.1109/SAAHPC.2011.12</a>.","apa":"Meyer, B., Plessl, C., &#38; Förstner, J. (2011). Transformation of scientific algorithms to parallel computing code: subdomain support in a MPI-multi-GPU backend. <i>Symp. on Application Accelerators in High Performance Computing (SAAHPC)</i>, 60–63. <a href=\"https://doi.org/10.1109/SAAHPC.2011.12\">https://doi.org/10.1109/SAAHPC.2011.12</a>","ama":"Meyer B, Plessl C, Förstner J. Transformation of scientific algorithms to parallel computing code: subdomain support in a MPI-multi-GPU backend. In: <i>Symp. on Application Accelerators in High Performance Computing (SAAHPC)</i>. IEEE Computer Society; 2011:60-63. doi:<a href=\"https://doi.org/10.1109/SAAHPC.2011.12\">10.1109/SAAHPC.2011.12</a>","chicago":"Meyer, Björn, Christian Plessl, and Jens Förstner. “Transformation of Scientific Algorithms to Parallel Computing Code: Subdomain Support in a MPI-Multi-GPU Backend.” In <i>Symp. on Application Accelerators in High Performance Computing (SAAHPC)</i>, 60–63. IEEE Computer Society, 2011. <a href=\"https://doi.org/10.1109/SAAHPC.2011.12\">https://doi.org/10.1109/SAAHPC.2011.12</a>.","ieee":"B. Meyer, C. Plessl, and J. Förstner, “Transformation of scientific algorithms to parallel computing code: subdomain support in a MPI-multi-GPU backend,” in <i>Symp. on Application Accelerators in High Performance Computing (SAAHPC)</i>, 2011, pp. 60–63, doi: <a href=\"https://doi.org/10.1109/SAAHPC.2011.12\">10.1109/SAAHPC.2011.12</a>."},"page":"60-63","year":"2011","author":[{"last_name":"Meyer","full_name":"Meyer, Björn","first_name":"Björn"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"},{"first_name":"Jens","last_name":"Förstner","orcid":"0000-0001-7059-9862","full_name":"Förstner, Jens","id":"158"}],"date_created":"2018-04-03T14:55:57Z","publisher":"IEEE Computer Society","date_updated":"2023-09-26T13:44:11Z","doi":"10.1109/SAAHPC.2011.12","title":"Transformation of scientific algorithms to parallel computing code: subdomain support in a MPI-multi-GPU backend"}]