[{"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"type":"conference","date_created":"2019-09-12T15:10:28Z","citation":{"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.","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.","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.","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.","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.","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.","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} }"},"publication":"In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, number 6880 in LNAI","editor":[{"full_name":"Ram, A.","first_name":"A.","last_name":"Ram"},{"last_name":"Wiratunga","first_name":"N.","full_name":"Wiratunga, N."}],"user_id":"49109","_id":"13198","language":[{"iso":"eng"}],"publisher":"Springer","page":"77-91","date_updated":"2022-01-06T06:51:30Z","author":[{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"},{"first_name":"P.","last_name":"Schlegel","full_name":"Schlegel, P."}],"year":"2011","status":"public","title":"Preference-based CBR: First steps toward a methodological framework"},{"status":"public","year":"2011","title":"Bipartite ranking through minimization of univariate loss","author":[{"full_name":"Kotlowski, W.","last_name":"Kotlowski","first_name":"W."},{"full_name":"Dembczynski, K.","first_name":"K.","last_name":"Dembczynski"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}],"date_updated":"2022-01-06T06:51:40Z","language":[{"iso":"eng"}],"_id":"13588","user_id":"49109","publication":"in Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA","citation":{"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.","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.","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} }","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>.","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.","short":"W. Kotlowski, K. Dembczynski, E. Hüllermeier, in: In Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA, 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."},"date_created":"2019-10-02T16:21:06Z","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}]},{"page":"185-188","publisher":"IEEE","_id":"13643","language":[{"iso":"eng"}],"doi":"10.1109/fpl.2011.42","user_id":"398","year":"2011","title":"Memory Virtualization for Multithreaded Reconfigurable Hardware","status":"public","author":[{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"},{"full_name":"Lübbers, Enno","first_name":"Enno","last_name":"Lübbers"}],"publication_identifier":{"isbn":["9781457714849"]},"date_updated":"2022-01-06T06:51:40Z","publication_status":"published","date_created":"2019-10-04T22:42:51Z","type":"conference","department":[{"_id":"78"}],"publication":"Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)","citation":{"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} }","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>","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>.","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>.","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.","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>"}},{"doi":"10.1145/2039370.2039384","user_id":"398","language":[{"iso":"eng"}],"_id":"13644","date_updated":"2022-01-06T06:51:40Z","publication_status":"published","year":"2011","title":"Design and architectures for dependable embedded systems","status":"public","publication_identifier":{"isbn":["9781450307154"]},"author":[{"last_name":"Henkel","first_name":"Jörg","full_name":"Henkel, Jörg"},{"full_name":"Hedrich, Lars","last_name":"Hedrich","first_name":"Lars"},{"full_name":"Herkersdorf, Andreas","first_name":"Andreas","last_name":"Herkersdorf"},{"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","last_name":"Marwedel","full_name":"Marwedel, Peter"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"first_name":"Wolfgang","last_name":"Rosenstiel","full_name":"Rosenstiel, Wolfgang"},{"last_name":"Schlichtmann","first_name":"Ulf","full_name":"Schlichtmann, Ulf"},{"first_name":"Olaf","last_name":"Spinczyk","full_name":"Spinczyk, Olaf"},{"full_name":"Tahoori, Mehdi","first_name":"Mehdi","last_name":"Tahoori"},{"last_name":"Bauer","first_name":"Lars","full_name":"Bauer, Lars"},{"last_name":"Teich","first_name":"Jürgen","full_name":"Teich, Jürgen"},{"last_name":"Wehn","first_name":"Norbert","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"},{"full_name":"Brinkschulte, Uwe","first_name":"Uwe","last_name":"Brinkschulte"},{"full_name":"Chakraborty, Samarjit","first_name":"Samarjit","last_name":"Chakraborty"},{"full_name":"Engel, Michael","last_name":"Engel","first_name":"Michael"},{"first_name":"Rolf","last_name":"Ernst","full_name":"Ernst, Rolf"},{"last_name":"Härtig","first_name":"Hermann","full_name":"Härtig, Hermann"}],"type":"conference","department":[{"_id":"78"}],"date_created":"2019-10-04T22:44:36Z","publication":"Proceedings of the seventh IEEE/ACM/IFIP International Conference on Hardware/software Codesign and system synthesis - CODES+ISSS '11","citation":{"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.","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>","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.","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>.","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>.","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} }","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_created":"2018-03-19T14:28:44Z","department":[{"_id":"75"}],"type":"journal_article","citation":{"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} }","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>","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).","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>.","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.","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>"},"publication":"Journal of Advances in Information Technology","issue":"1","publisher":"Engineering and Technology Publishing","_id":"1376","volume":2,"doi":"10.4304/jait.2.1.2-14","user_id":"15572","author":[{"first_name":"Christian","last_name":"Dannewitz","full_name":"Dannewitz, Christian"},{"full_name":"Biermann, Thorsten","first_name":"Thorsten","last_name":"Biermann"},{"first_name":"Martin","last_name":"Dräxler","full_name":"Dräxler, Martin"},{"id":"126","full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl"}],"publication_identifier":{"issn":["1798-2340"]},"status":"public","year":"2011","title":"Complex Queries in P2P Networks with Resource-Constrained Devices","intvolume":"         2","date_updated":"2022-01-06T06:51:43Z","publication_status":"published"},{"citation":{"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>.","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.","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>.","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} }","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>","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>."},"place":"New York, NY, USA","status":"public","_id":"46401","publisher":"Association for Computing Machinery","page":"829–836","user_id":"15504","publication":"Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation","abstract":[{"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.","lang":"eng"}],"date_created":"2023-08-04T15:58:22Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","keyword":["exploratory landscape analysis","evolutionary optimization","fitness landscape","benchmarking","BBOB test set"],"author":[{"full_name":"Mersmann, Olaf","first_name":"Olaf","last_name":"Mersmann"},{"full_name":"Bischl, Bernd","last_name":"Bischl","first_name":"Bernd"},{"full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740"},{"last_name":"Preuss","first_name":"Mike","full_name":"Preuss, Mike"},{"last_name":"Weihs","first_name":"Claus","full_name":"Weihs, Claus"},{"full_name":"Rudolph, Günter","first_name":"Günter","last_name":"Rudolph"}],"publication_identifier":{"isbn":["9781450305570"]},"title":"Exploratory Landscape Analysis","year":"2011","date_updated":"2023-10-16T13:54:34Z","series_title":"GECCO ’11","language":[{"iso":"eng"}],"doi":"10.1145/2001576.2001690"},{"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"place":"Berlin, Heidelberg","date_created":"2023-08-04T15:59:18Z","abstract":[{"lang":"eng","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."}],"publication":"Evolutionary Multi-Criterion Optimization","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>","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} }","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>.","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.","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>.","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>","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>."},"doi":"https://doi.org/10.1007/978-3-642-19893-9_2","user_id":"15504","editor":[{"first_name":"Ricardo H. C.","last_name":"Takahashi","full_name":"Takahashi, Ricardo H. C."},{"full_name":"Deb, Kalyanmoy","first_name":"Kalyanmoy","last_name":"Deb"},{"full_name":"Wanner, Elizabeth F.","last_name":"Wanner","first_name":"Elizabeth F."},{"first_name":"Salvatore","last_name":"Greco","full_name":"Greco, Salvatore"}],"page":"16–30","_id":"46402","publisher":"Springer Berlin Heidelberg","language":[{"iso":"eng"}],"date_updated":"2023-10-16T13:54:50Z","title":"A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms","status":"public","year":"2011","author":[{"first_name":"Tobias","last_name":"Wagner","full_name":"Wagner, Tobias"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","id":"100740"},{"first_name":"Luis","last_name":"Martí","full_name":"Martí, Luis"}],"publication_identifier":{"isbn":["978-3-642-19893-9"]}},{"abstract":[{"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. ","lang":"eng"}],"publication":"Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering","issue":"10","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>","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>.","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.","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>.","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>","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} }"},"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T16:00:28Z","date_updated":"2023-10-16T13:55:07Z","intvolume":"       225","title":"Advanced concepts for multi-objective evolutionary optimization in aircraft industry","year":"2011","status":"public","author":[{"full_name":"Naujoks, B","last_name":"Naujoks","first_name":"B"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"},{"last_name":"Wessing","first_name":"S","full_name":"Wessing, S"},{"full_name":"Weihs, C","first_name":"C","last_name":"Weihs"}],"user_id":"15504","doi":"10.1177/0954410011414120","volume":225,"page":"1081-1096","language":[{"iso":"eng"}],"_id":"46403"},{"_id":"2910","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-8047"}],"user_id":"49063","author":[{"id":"1971","full_name":" Naewe, Stefanie","first_name":"Stefanie","last_name":" Naewe"}],"status":"public","title":"Algorithms for lattice problems with respect to general norms","year":"2011","date_updated":"2024-08-08T12:17:02Z","publication_status":"published","date_created":"2018-05-25T10:08:44Z","department":[{"_id":"64"}],"type":"dissertation","supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"citation":{"apa":"Naewe, S. (2011). <i>Algorithms for lattice problems with respect to general norms</i>. Universität Paderborn.","ieee":"S.  Naewe, <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.","chicago":"Naewe, Stefanie. <i>Algorithms for Lattice Problems with Respect to General Norms</i>. Universität Paderborn, 2011.","mla":"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.","bibtex":"@book{ Naewe_2011, title={Algorithms for lattice problems with respect to general norms}, publisher={Universität Paderborn}, author={ Naewe, Stefanie}, year={2011} }"}},{"citation":{"mla":"Becker, Markus, et al. <i>Virtual Prototyping Software-Intensiver Mechatronischer Systeme - Eine Fallstudie</i>. 2011.","ama":"Becker M, Zabel H, Müller W, Elfeky A. Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie. In: ; 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} }","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.","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.","chicago":"Becker, Markus, Henning Zabel, Wolfgang Müller, and Ahmed Elfeky. “Virtual Prototyping Software-Intensiver Mechatronischer Systeme - Eine Fallstudie.” Paderborn, 2011.","short":"M. Becker, H. Zabel, W. Müller, A. Elfeky, in: Paderborn, 2011."},"place":"Paderborn","date_created":"2023-01-17T08:59:23Z","department":[{"_id":"672"}],"type":"conference","conference":{"name":"8. Paderborner Workshop Entwurf Mechatronischer Systeme"},"author":[{"full_name":"Becker, Markus","last_name":"Becker","first_name":"Markus"},{"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","first_name":"Ahmed","last_name":"Elfeky"}],"year":"2011","status":"public","title":"Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie","date_updated":"2023-01-17T08:59:47Z","_id":"37001","language":[{"iso":"eng"}],"user_id":"5786"},{"department":[{"_id":"672"}],"type":"conference","date_created":"2023-01-17T09:05:48Z","citation":{"chicago":"Kuznik, Christoph, and Wolfgang Müller. “A SystemC Based Library for Functional Coverage,” 2011.","short":"C. Kuznik, W. Müller, in: 2011.","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.","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.","ama":"Kuznik C, Müller W. A SystemC Based Library for Functional Coverage. 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} }","mla":"Kuznik, Christoph, and Wolfgang Müller. <i>A SystemC Based Library for Functional Coverage</i>. 2011."},"user_id":"5786","_id":"37005","language":[{"iso":"eng"}],"date_updated":"2023-01-17T09:05:58Z","conference":{"name":"Proceedings of the Design and Verification Conference (DVCON 2011)","location":"San Jose, CA"},"author":[{"last_name":"Kuznik","first_name":"Christoph","full_name":"Kuznik, Christoph"},{"full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller","id":"16243"}],"year":"2011","title":"A SystemC Based Library for Functional Coverage","status":"public"},{"doi":"10.1109/DATE.2011.5763022","user_id":"5786","publisher":"IEEE","_id":"37006","language":[{"iso":"eng"}],"date_updated":"2023-01-17T09:09:33Z","conference":{"location":"Grenoble, France","name":"2011 Design, Automation & Test in Europe"},"author":[{"full_name":"Klobedanz, Kay","last_name":"Klobedanz","first_name":"Kay"},{"last_name":"König","first_name":"Andreas","full_name":"König, Andreas"},{"full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller","id":"16243"}],"title":"A Reconfiguration Approach for Faul-Tolerant FlexRay Networks","status":"public","year":"2011","department":[{"_id":"672"}],"keyword":["Schedules","Fault tolerant systems","Redundancy","Protocols","Automotive engineering","Genetic algorithms"],"type":"conference","place":"Grenoble, France","date_created":"2023-01-17T09:09:25Z","abstract":[{"lang":"eng","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."}],"citation":{"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>.","short":"K. Klobedanz, A. König, W. Müller, in: Proceedings of DATE’11, IEEE, Grenoble, France, 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>.","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>","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} }","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>","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>."},"publication":"Proceedings of DATE'11"},{"doi":"10.1142/s0219749911008258","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1105.3419"}],"intvolume":"         9","article_type":"original","date_updated":"2023-02-28T11:04:25Z","publication_status":"published","publication_identifier":{"issn":["0219-7499","1793-6918"]},"author":[{"id":"71541","first_name":"Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","full_name":"Gharibian, Sevag"},{"full_name":"PIANI, MARCO","last_name":"PIANI","first_name":"MARCO"},{"full_name":"ADESSO, GERARDO","last_name":"ADESSO","first_name":"GERARDO"},{"full_name":"CALSAMIGLIA, JOHN","last_name":"CALSAMIGLIA","first_name":"JOHN"},{"full_name":"HORODECKI, PAWEŁ","last_name":"HORODECKI","first_name":"PAWEŁ"}],"title":"Characterizing Quantumness via Entanglement Creation","year":"2011","department":[{"_id":"623"},{"_id":"7"}],"type":"journal_article","date_created":"2019-03-01T12:08:55Z","abstract":[{"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.","lang":"eng"}],"extern":"1","publication":"International Journal of Quantum Information","issue":"07n08","volume":"09","user_id":"71541","_id":"8178","publisher":"World Scientific Pub Co Pte Lt","page":"1701-1713","status":"public","oa":"1","external_id":{"arxiv":["1105.3419"]},"citation":{"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} }","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>","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>.","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>.","short":"S. Gharibian, M. PIANI, G. ADESSO, J. CALSAMIGLIA, P. HORODECKI, International Journal of Quantum Information 09 (2011) 1701–1713.","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>.","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>"}},{"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"}],"extern":"1","publication":"IEEE Annual Conference on Computational Complexity (CCC 2011)","department":[{"_id":"623"},{"_id":"7"}],"type":"conference","date_created":"2019-03-01T12:06:18Z","date_updated":"2023-02-28T11:04:02Z","publication_status":"published","author":[{"id":"71541","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag"},{"last_name":"Kempe","first_name":"Julia","full_name":"Kempe, Julia"}],"publication_identifier":{"isbn":["9781457701795"]},"title":"Approximation Algorithms for QMA-Complete Problems","year":"2011","doi":"10.1109/ccc.2011.15","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1101.3884"}],"citation":{"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>.","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>","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>","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>.","short":"S. Gharibian, J. Kempe, in: IEEE Annual Conference on Computational Complexity (CCC 2011), IEEE, 2011."},"oa":"1","external_id":{"arxiv":["1101.3884"]},"conference":{"name":"2011 IEEE 26th Annual Conference on Computational Complexity (CCC)","location":"San Jose, USA"},"status":"public","user_id":"71541","_id":"8176","publisher":"IEEE"},{"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1103.4032","open_access":"1"}],"doi":"10.1103/physrevlett.106.220403","publication_identifier":{"issn":["0031-9007","1079-7114"]},"author":[{"full_name":"Piani, Marco","last_name":"Piani","first_name":"Marco"},{"id":"71541","full_name":"Gharibian, Sevag","last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag"},{"last_name":"Adesso","first_name":"Gerardo","full_name":"Adesso, Gerardo"},{"last_name":"Calsamiglia","first_name":"John","full_name":"Calsamiglia, John"},{"full_name":"Horodecki, Paweł","first_name":"Paweł","last_name":"Horodecki"},{"last_name":"Winter","first_name":"Andreas","full_name":"Winter, Andreas"}],"year":"2011","title":"All Nonclassical Correlations Can Be Activated into Distillable Entanglement","intvolume":"       106","article_type":"original","date_updated":"2023-02-28T11:04:13Z","publication_status":"published","date_created":"2019-03-01T12:07:49Z","department":[{"_id":"623"},{"_id":"7"}],"type":"journal_article","issue":"22","publication":"Physical Review Letters","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."}],"extern":"1","_id":"8177","publisher":"American Physical Society (APS)","volume":106,"user_id":"71541","status":"public","external_id":{"arxiv":["1103.4032"]},"oa":"1","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>","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>.","short":"M. Piani, S. Gharibian, G. Adesso, J. Calsamiglia, P. Horodecki, A. Winter, Physical Review Letters 106 (2011).","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>.","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>.","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>","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} }"}},{"publication":"Symp. on Application Accelerators in High Performance Computing (SAAHPC)","citation":{"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} }","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>","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>.","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.","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>.","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>"},"quality_controlled":"1","project":[{"name":"Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling Models","_id":"30","grant_number":"01|H11004A"}],"date_created":"2018-04-03T14:55:57Z","keyword":["tet_topic_hpc"],"type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"15"},{"_id":"78"}],"year":"2011","title":"Transformation of scientific algorithms to parallel computing code: subdomain support in a MPI-multi-GPU backend","status":"public","author":[{"full_name":"Meyer, Björn","last_name":"Meyer","first_name":"Björn"},{"full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian","id":"16153"},{"id":"158","last_name":"Förstner","first_name":"Jens","orcid":"0000-0001-7059-9862","full_name":"Förstner, Jens"}],"date_updated":"2023-09-26T13:44:11Z","page":"60-63","_id":"2194","publisher":"IEEE Computer Society","language":[{"iso":"eng"}],"user_id":"15278","doi":"10.1109/SAAHPC.2011.12"},{"publisher":"IEEE Computer Society","_id":"2193","language":[{"iso":"eng"}],"page":"223-226","doi":"10.1109/ASAP.2011.6043273","user_id":"15278","author":[{"last_name":"Beisel","first_name":"Tobias","full_name":"Beisel, Tobias"},{"id":"3118","first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias"},{"full_name":"Plessl, Christian","last_name":"Plessl","first_name":"Christian","orcid":"0000-0001-5728-9982","id":"16153"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"}],"title":"Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler","status":"public","year":"2011","date_updated":"2023-09-26T13:43:48Z","date_created":"2018-04-03T14:37:14Z","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","citation":{"mla":"Beisel, Tobias, et al. “Cooperative Multitasking for Heterogeneous Accelerators in the Linux Completely Fair Scheduler.” <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, IEEE Computer Society, 2011, pp. 223–26, doi:<a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">10.1109/ASAP.2011.6043273</a>.","apa":"Beisel, T., Wiersema, T., Plessl, C., &#38; Brinkmann, A. (2011). Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler. <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, 223–226. <a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">https://doi.org/10.1109/ASAP.2011.6043273</a>","ieee":"T. Beisel, T. Wiersema, C. Plessl, and A. Brinkmann, “Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler,” in <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, 2011, pp. 223–226, doi: <a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">10.1109/ASAP.2011.6043273</a>.","chicago":"Beisel, Tobias, Tobias Wiersema, Christian Plessl, and André Brinkmann. “Cooperative Multitasking for Heterogeneous Accelerators in the Linux Completely Fair Scheduler.” In <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, 223–26. IEEE Computer Society, 2011. <a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">https://doi.org/10.1109/ASAP.2011.6043273</a>.","ama":"Beisel T, Wiersema T, Plessl C, Brinkmann A. Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler. In: <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>. IEEE Computer Society; 2011:223-226. doi:<a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">10.1109/ASAP.2011.6043273</a>","short":"T. Beisel, T. Wiersema, C. Plessl, A. Brinkmann, in: Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP), IEEE Computer Society, 2011, pp. 223–226.","bibtex":"@inproceedings{Beisel_Wiersema_Plessl_Brinkmann_2011, title={Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler}, DOI={<a href=\"https://doi.org/10.1109/ASAP.2011.6043273\">10.1109/ASAP.2011.6043273</a>}, booktitle={Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)}, publisher={IEEE Computer Society}, author={Beisel, Tobias and Wiersema, Tobias and Plessl, Christian and Brinkmann, André}, year={2011}, pages={223–226} }"},"publication":"Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)","project":[{"name":"Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling Models","_id":"30","grant_number":"01|H11004A"}],"quality_controlled":"1"},{"user_id":"15278","ddc":["040"],"page":"55-60","_id":"656","publisher":"IEEE","has_accepted_license":"1","status":"public","quality_controlled":"1","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","grant_number":"160364472","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Engineering Proprioception in Computing Systems","grant_number":"257906","_id":"31"}],"file_date_updated":"2018-03-14T13:49:39Z","citation":{"chicago":"Happe, Markus, Andreas Agne, and Christian Plessl. “Measuring and Predicting Temperature Distributions on FPGAs at Run-Time.” In <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 55–60. IEEE, 2011. <a href=\"https://doi.org/10.1109/ReConFig.2011.59\">https://doi.org/10.1109/ReConFig.2011.59</a>.","short":"M. Happe, A. Agne, C. Plessl, in: Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig), IEEE, 2011, pp. 55–60.","ieee":"M. Happe, A. Agne, and C. Plessl, “Measuring and Predicting Temperature Distributions on FPGAs at Run-Time,” in <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 2011, pp. 55–60, doi: <a href=\"https://doi.org/10.1109/ReConFig.2011.59\">10.1109/ReConFig.2011.59</a>.","apa":"Happe, M., Agne, A., &#38; Plessl, C. (2011). Measuring and Predicting Temperature Distributions on FPGAs at Run-Time. <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 55–60. <a href=\"https://doi.org/10.1109/ReConFig.2011.59\">https://doi.org/10.1109/ReConFig.2011.59</a>","bibtex":"@inproceedings{Happe_Agne_Plessl_2011, title={Measuring and Predicting Temperature Distributions on FPGAs at Run-Time}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2011.59\">10.1109/ReConFig.2011.59</a>}, booktitle={Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Happe, Markus and Agne, Andreas and Plessl, Christian}, year={2011}, pages={55–60} }","ama":"Happe M, Agne A, Plessl C. Measuring and Predicting Temperature Distributions on FPGAs at Run-Time. In: <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2011:55-60. doi:<a href=\"https://doi.org/10.1109/ReConFig.2011.59\">10.1109/ReConFig.2011.59</a>","mla":"Happe, Markus, et al. “Measuring and Predicting Temperature Distributions on FPGAs at Run-Time.” <i>Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2011, pp. 55–60, doi:<a href=\"https://doi.org/10.1109/ReConFig.2011.59\">10.1109/ReConFig.2011.59</a>."},"doi":"10.1109/ReConFig.2011.59","language":[{"iso":"eng"}],"date_updated":"2023-09-26T13:46:08Z","title":"Measuring and Predicting Temperature Distributions on FPGAs at Run-Time","year":"2011","author":[{"last_name":"Happe","first_name":"Markus","full_name":"Happe, Markus"},{"full_name":"Agne, Andreas","first_name":"Andreas","last_name":"Agne"},{"id":"16153","orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl","full_name":"Plessl, Christian"}],"type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"file":[{"relation":"main_file","date_updated":"2018-03-14T13:49:39Z","file_name":"656-2011_happe_reconfig.pdf","file_size":502244,"access_level":"closed","file_id":"1220","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-14T13:49:39Z"}],"date_created":"2017-10-17T12:42:59Z","abstract":[{"lang":"eng","text":"In the next decades, hybrid multi-cores will be the predominant architecture for reconfigurable FPGA-based systems. Temperature-aware thread mapping strategies are key for providing dependability in such systems. These strategies rely on measuring the temperature distribution and redicting the thermal behavior of the system when there are changes to the hardware and software running on the FPGA. While there are a number of tools that use thermal models to predict temperature distributions at design time, these tools lack the flexibility to autonomously adjust to changing FPGA configurations. To address this problem we propose a temperature-aware system that empowers FPGA-based reconfigurable multi-cores to autonomously predict the on-chip temperature distribution for pro-active thread remapping. Our system obtains temperature measurements through a self-calibrating grid of sensors and uses area constrained heat-generating circuits in order to generate spatial and temporal temperature gradients. The generated temperature variations are then used to learn the free parameters of the system's thermal model. The system thus acquires an understanding of its own thermal characteristics. We implemented an FPGA system containing a net of 144 temperature sensors on a Xilinx Virtex-6 LX240T FPGA that is aware of its thermal model. Finally, we show that the temperature predictions vary less than 0.72 degree C on average compared to the measured temperature distributions at run-time."}],"publication":"Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)"},{"quality_controlled":"1","citation":{"apa":"Kenter, T., Platzner, M., Plessl, C., &#38; Kauschke, M. (2011). Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures. <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, 177–180. <a href=\"https://doi.org/10.1145/1950413.1950448\">https://doi.org/10.1145/1950413.1950448</a>","mla":"Kenter, Tobias, et al. “Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures.” <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, ACM, 2011, pp. 177–80, doi:<a href=\"https://doi.org/10.1145/1950413.1950448\">10.1145/1950413.1950448</a>.","ieee":"T. Kenter, M. Platzner, C. Plessl, and M. Kauschke, “Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures,” in <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, 2011, pp. 177–180, doi: <a href=\"https://doi.org/10.1145/1950413.1950448\">10.1145/1950413.1950448</a>.","chicago":"Kenter, Tobias, Marco Platzner, Christian Plessl, and Michael Kauschke. “Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures.” In <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, 177–80. New York, NY, USA: ACM, 2011. <a href=\"https://doi.org/10.1145/1950413.1950448\">https://doi.org/10.1145/1950413.1950448</a>.","ama":"Kenter T, Platzner M, Plessl C, Kauschke M. Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures. In: <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>. ACM; 2011:177-180. doi:<a href=\"https://doi.org/10.1145/1950413.1950448\">10.1145/1950413.1950448</a>","short":"T. Kenter, M. Platzner, C. Plessl, M. Kauschke, in: Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA), ACM, New York, NY, USA, 2011, pp. 177–180.","bibtex":"@inproceedings{Kenter_Platzner_Plessl_Kauschke_2011, place={New York, NY, USA}, title={Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures}, DOI={<a href=\"https://doi.org/10.1145/1950413.1950448\">10.1145/1950413.1950448</a>}, booktitle={Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)}, publisher={ACM}, author={Kenter, Tobias and Platzner, Marco and Plessl, Christian and Kauschke, Michael}, year={2011}, pages={177–180} }"},"publication":"Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"keyword":["design space exploration","LLVM","partitioning","performance","estimation","funding-intel"],"type":"conference","place":"New York, NY, USA","date_created":"2018-04-03T15:08:13Z","date_updated":"2023-09-26T13:45:04Z","publication_identifier":{"isbn":["978-1-4503-0554-9"]},"author":[{"full_name":"Kenter, Tobias","first_name":"Tobias","last_name":"Kenter","id":"3145"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"},{"id":"16153","full_name":"Plessl, Christian","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl"},{"last_name":"Kauschke","first_name":"Michael","full_name":"Kauschke, Michael"}],"title":"Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures","status":"public","year":"2011","doi":"10.1145/1950413.1950448","user_id":"15278","_id":"2200","language":[{"iso":"eng"}],"publisher":"ACM","page":"177-180"},{"doi":"10.1155/2011/760954","user_id":"15278","language":[{"iso":"eng"}],"_id":"2201","publisher":"Hindawi Publishing Corp.","date_updated":"2023-09-26T13:45:46Z","author":[{"full_name":"Schumacher, Tobias","first_name":"Tobias","last_name":"Schumacher"},{"full_name":"Süß, Tim","first_name":"Tim","last_name":"Süß"},{"id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","full_name":"Plessl, Christian"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"}],"title":"FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study","status":"public","year":"2011","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"keyword":["funding-altera"],"type":"journal_article","date_created":"2018-04-03T15:09:49Z","quality_controlled":"1","citation":{"mla":"Schumacher, Tobias, et al. “FPGA Acceleration of Communication-Bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study.” <i>Int. Journal of Recon- Figurable Computing (IJRC)</i>, Hindawi Publishing Corp., 2011, doi:<a href=\"https://doi.org/10.1155/2011/760954\">10.1155/2011/760954</a>.","ama":"Schumacher T, Süß T, Plessl C, Platzner M. FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study. <i>Int Journal of Recon- figurable Computing (IJRC)</i>. Published online 2011. doi:<a href=\"https://doi.org/10.1155/2011/760954\">10.1155/2011/760954</a>","bibtex":"@article{Schumacher_Süß_Plessl_Platzner_2011, title={FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study}, DOI={<a href=\"https://doi.org/10.1155/2011/760954\">10.1155/2011/760954</a>}, journal={Int. Journal of Recon- figurable Computing (IJRC)}, publisher={Hindawi Publishing Corp.}, author={Schumacher, Tobias and Süß, Tim and Plessl, Christian and Platzner, Marco}, year={2011} }","apa":"Schumacher, T., Süß, T., Plessl, C., &#38; Platzner, M. (2011). FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study. <i>Int. Journal of Recon- Figurable Computing (IJRC)</i>. <a href=\"https://doi.org/10.1155/2011/760954\">https://doi.org/10.1155/2011/760954</a>","ieee":"T. Schumacher, T. Süß, C. Plessl, and M. Platzner, “FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study,” <i>Int. Journal of Recon- figurable Computing (IJRC)</i>, 2011, doi: <a href=\"https://doi.org/10.1155/2011/760954\">10.1155/2011/760954</a>.","chicago":"Schumacher, Tobias, Tim Süß, Christian Plessl, and Marco Platzner. “FPGA Acceleration of Communication-Bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study.” <i>Int. Journal of Recon- Figurable Computing (IJRC)</i>, 2011. <a href=\"https://doi.org/10.1155/2011/760954\">https://doi.org/10.1155/2011/760954</a>.","short":"T. Schumacher, T. Süß, C. Plessl, M. Platzner, Int. Journal of Recon- Figurable Computing (IJRC) (2011)."},"publication":"Int. Journal of Recon- figurable Computing (IJRC)"}]