[{"abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria."}],"publication":"Journal of Combinatorial Optimization","issue":"4","department":[{"_id":"63"},{"_id":"541"}],"type":"journal_article","date_created":"2017-10-26T14:11:04Z","file":[{"creator":"feldi","date_created":"2018-10-31T16:57:32Z","file_size":605207,"access_level":"closed","file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","date_updated":"2018-10-31T16:57:32Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5226"}],"intvolume":"        36","date_updated":"2022-01-06T07:03:15Z","publication_status":"published","publication_identifier":{"issn":["1382-6905","1573-2886"]},"author":[{"full_name":"Feldotto, Matthias","first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","id":"14052"},{"full_name":"Leder, Lennart","first_name":"Lennart","last_name":"Leder"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"year":"2018","title":"Congestion games with mixed objectives","doi":"10.1007/s10878-017-0189-y","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>.","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1145–67. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>.","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167."},"file_date_updated":"2018-10-31T16:57:32Z","external_id":{"arxiv":["1607.05143"]},"has_accepted_license":"1","status":"public","volume":36,"ddc":["000"],"user_id":"14052","publisher":"Springer Nature","_id":"669","page":"1145-1167"},{"citation":{"mla":"Wolters, Dennis. “Einsatz von Classroom-Response-Systemen und Peer Instruction in der Veranstaltung Grundlagen von Datenbanken.” <i>die hochschullehre</i>, no. 4, 2018.","apa":"Wolters, D. (2018). Einsatz von Classroom-Response-Systemen und Peer Instruction in der Veranstaltung Grundlagen von Datenbanken. <i>die hochschullehre</i>, (4).","ieee":"D. Wolters, “Einsatz von Classroom-Response-Systemen und Peer Instruction in der Veranstaltung Grundlagen von Datenbanken,” <i>die hochschullehre</i>, no. 4, 2018.","short":"D. Wolters, die hochschullehre (2018).","ama":"Wolters D. Einsatz von Classroom-Response-Systemen und Peer Instruction in der Veranstaltung Grundlagen von Datenbanken. <i>die hochschullehre</i>. 2018;(4).","chicago":"Wolters, Dennis. “Einsatz von Classroom-Response-Systemen und Peer Instruction in der Veranstaltung Grundlagen von Datenbanken.” <i>die hochschullehre</i>, no. 4 (2018).","bibtex":"@article{Wolters_2018, title={Einsatz von Classroom-Response-Systemen und Peer Instruction in der Veranstaltung Grundlagen von Datenbanken}, number={4}, journal={die hochschullehre}, author={Wolters, Dennis}, year={2018} }"},"publication":"die hochschullehre","issue":"4","date_created":"2019-01-15T19:10:58Z","department":[{"_id":"66"}],"type":"journal_article","author":[{"id":"11308","last_name":"Wolters","first_name":"Dennis","full_name":"Wolters, Dennis"}],"status":"public","year":"2018","title":"Einsatz von Classroom-Response-Systemen und Peer Instruction in der Veranstaltung Grundlagen von Datenbanken","date_updated":"2022-01-06T07:03:17Z","publication_status":"published","language":[{"iso":"ger"}],"_id":"6743","main_file_link":[{"url":"http://www.hochschullehre.org/wp-content/files/die_hochschullehre_Wolters_2018.pdf"}],"user_id":"11308"},{"_id":"6761","publisher":"SciTePress","language":[{"iso":"eng"}],"page":"594-601","doi":"10.5220/0006724405940601","user_id":"39187","conference":{"location":"Madeira, Portugal","name":"6th International Conference on Model-Driven Engineering and Software Development (MODELSWARD'18)"},"author":[{"full_name":"Jovanovikj, Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","first_name":"Ivan","last_name":"Jovanovikj","id":"39187"},{"first_name":"Vishwak","last_name":"Narasimhan","full_name":"Narasimhan, Vishwak"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"},{"id":"447","first_name":"Stefan","last_name":"Sauer","full_name":"Sauer, Stefan"}],"publication_identifier":{"isbn":["978-989-758-283-7"]},"title":"Context-specific Quality Evaluation of Test Cases","year":"2018","status":"public","date_updated":"2022-01-06T07:03:17Z","date_created":"2019-01-16T09:38:29Z","department":[{"_id":"66"},{"_id":"534"}],"type":"conference","citation":{"ieee":"I. Jovanovikj, V. Narasimhan, G. Engels, and S. Sauer, “Context-specific Quality Evaluation of Test Cases,” in <i>Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,</i> Madeira, Portugal, 2018, pp. 594–601.","apa":"Jovanovikj, I., Narasimhan, V., Engels, G., &#38; Sauer, S. (2018). Context-specific Quality Evaluation of Test Cases. In <i>Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,</i> (pp. 594–601). Madeira, Portugal: SciTePress. <a href=\"https://doi.org/10.5220/0006724405940601\">https://doi.org/10.5220/0006724405940601</a>","short":"I. Jovanovikj, V. Narasimhan, G. Engels, S. Sauer, in: Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD, SciTePress, 2018, pp. 594–601.","chicago":"Jovanovikj, Ivan, Vishwak Narasimhan, Gregor Engels, and Stefan Sauer. “Context-Specific Quality Evaluation of Test Cases.” In <i>Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,</i> 594–601. SciTePress, 2018. <a href=\"https://doi.org/10.5220/0006724405940601\">https://doi.org/10.5220/0006724405940601</a>.","mla":"Jovanovikj, Ivan, et al. “Context-Specific Quality Evaluation of Test Cases.” <i>Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,</i> SciTePress, 2018, pp. 594–601, doi:<a href=\"https://doi.org/10.5220/0006724405940601\">10.5220/0006724405940601</a>.","bibtex":"@inproceedings{Jovanovikj_Narasimhan_Engels_Sauer_2018, title={Context-specific Quality Evaluation of Test Cases}, DOI={<a href=\"https://doi.org/10.5220/0006724405940601\">10.5220/0006724405940601</a>}, booktitle={Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,}, publisher={SciTePress}, author={Jovanovikj, Ivan and Narasimhan, Vishwak and Engels, Gregor and Sauer, Stefan}, year={2018}, pages={594–601} }","ama":"Jovanovikj I, Narasimhan V, Engels G, Sauer S. Context-specific Quality Evaluation of Test Cases. In: <i>Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,</i>. SciTePress; 2018:594-601. doi:<a href=\"https://doi.org/10.5220/0006724405940601\">10.5220/0006724405940601</a>"},"publication":"Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,"},{"title":"Model-Driven Test Case Migration: The Test Case Reengineering Horseshoe Model","year":"2018","publication_identifier":{"isbn":["978-3-319-92901-9"]},"author":[{"first_name":"Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","last_name":"Jovanovikj","full_name":"Jovanovikj, Ivan","id":"39187"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"},{"first_name":"Anthony","last_name":"Anjorin","full_name":"Anjorin, Anthony"},{"id":"447","first_name":"Stefan","last_name":"Sauer","full_name":"Sauer, Stefan"}],"date_updated":"2022-01-06T07:03:17Z","language":[{"iso":"eng"}],"doi":"https://doi.org/10.1007/978-3-319-92901-9_13","publication":"Information Systems in the Big Data Era - CAiSE Forum 2018, Tallinn, Estonia, June 11-15, 2018, ProceedingIs","abstract":[{"lang":"eng","text":"Existing test cases represent important assets, which are worth reusing in software migration projects. The benefit is twofold, reuse of relevant information as well cost saving by avoiding design of new test cases. As test cases are implemented in the same or a compatible technology as the system they are testing, they have to somehow follow the system migration, i.e., they should be co-migrated. Due to the size of the test case set, and often missing conformity in the structure of the test cases, migration of test cases is a quite challenging task. As model-driven engineering has been established to manage those complex tasks, we apply it in the test case domain. In this paper, we propose a generic migration method based on model-driven reengineering techniques. Our method which involves reverse engineering, restructuring, and forward engineering is applied in an industrial case study where appropriate tooling was developed as well."}],"date_created":"2019-01-16T09:42:41Z","type":"conference","department":[{"_id":"66"},{"_id":"534"}],"status":"public","conference":{"location":"Tallinn, Estonia","name":"CAiSE 2018"},"page":"133-147","_id":"6763","publisher":"Springer International Publishing","user_id":"39187","editor":[{"full_name":"Mendling, Jan","last_name":"Mendling","first_name":"Jan"},{"first_name":"Haralambos","last_name":"Mouratidis","full_name":"Mouratidis, Haralambos"}],"citation":{"short":"I. Jovanovikj, G. Engels, A. Anjorin, S. Sauer, in: J. Mendling, H. Mouratidis (Eds.), Information Systems in the Big Data Era - CAiSE Forum 2018, Tallinn, Estonia, June 11-15, 2018, ProceedingIs, Springer International Publishing, Cham, 2018, pp. 133–147.","chicago":"Jovanovikj, Ivan, Gregor Engels, Anthony Anjorin, and Stefan Sauer. “Model-Driven Test Case Migration: The Test Case Reengineering Horseshoe Model.” In <i>Information Systems in the Big Data Era - CAiSE Forum 2018, Tallinn, Estonia, June 11-15, 2018, ProceedingIs</i>, edited by Jan Mendling and Haralambos Mouratidis, 133–47. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-92901-9_13\">https://doi.org/10.1007/978-3-319-92901-9_13</a>.","ieee":"I. Jovanovikj, G. Engels, A. Anjorin, and S. Sauer, “Model-Driven Test Case Migration: The Test Case Reengineering Horseshoe Model,” in <i>Information Systems in the Big Data Era - CAiSE Forum 2018, Tallinn, Estonia, June 11-15, 2018, ProceedingIs</i>, Tallinn, Estonia, 2018, pp. 133–147.","apa":"Jovanovikj, I., Engels, G., Anjorin, A., &#38; Sauer, S. (2018). Model-Driven Test Case Migration: The Test Case Reengineering Horseshoe Model. In J. Mendling &#38; H. Mouratidis (Eds.), <i>Information Systems in the Big Data Era - CAiSE Forum 2018, Tallinn, Estonia, June 11-15, 2018, ProceedingIs</i> (pp. 133–147). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-92901-9_13\">https://doi.org/10.1007/978-3-319-92901-9_13</a>","bibtex":"@inproceedings{Jovanovikj_Engels_Anjorin_Sauer_2018, place={Cham}, title={Model-Driven Test Case Migration: The Test Case Reengineering Horseshoe Model}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-92901-9_13\">https://doi.org/10.1007/978-3-319-92901-9_13</a>}, booktitle={Information Systems in the Big Data Era - CAiSE Forum 2018, Tallinn, Estonia, June 11-15, 2018, ProceedingIs}, publisher={Springer International Publishing}, author={Jovanovikj, Ivan and Engels, Gregor and Anjorin, Anthony and Sauer, Stefan}, editor={Mendling, Jan and Mouratidis, HaralambosEditors}, year={2018}, pages={133–147} }","ama":"Jovanovikj I, Engels G, Anjorin A, Sauer S. Model-Driven Test Case Migration: The Test Case Reengineering Horseshoe Model. In: Mendling J, Mouratidis H, eds. <i>Information Systems in the Big Data Era - CAiSE Forum 2018, Tallinn, Estonia, June 11-15, 2018, ProceedingIs</i>. Cham: Springer International Publishing; 2018:133-147. doi:<a href=\"https://doi.org/10.1007/978-3-319-92901-9_13\">https://doi.org/10.1007/978-3-319-92901-9_13</a>","mla":"Jovanovikj, Ivan, et al. “Model-Driven Test Case Migration: The Test Case Reengineering Horseshoe Model.” <i>Information Systems in the Big Data Era - CAiSE Forum 2018, Tallinn, Estonia, June 11-15, 2018, ProceedingIs</i>, edited by Jan Mendling and Haralambos Mouratidis, Springer International Publishing, 2018, pp. 133–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-92901-9_13\">https://doi.org/10.1007/978-3-319-92901-9_13</a>."},"place":"Cham"},{"citation":{"apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., Travkin, O., &#38; Wehrheim, H. (2018). Mechanized proofs of opacity: a comparison of two techniques. <i>Formal Asp. Comput.</i>, <i>30</i>(5), 597–625. <a href=\"https://doi.org/10.1007/s00165-017-0433-3\">https://doi.org/10.1007/s00165-017-0433-3</a>","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Mechanized proofs of opacity: a comparison of two techniques,” <i>Formal Asp. Comput.</i>, vol. 30, no. 5, pp. 597–625, 2018.","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, Formal Asp. Comput. 30 (2018) 597–625.","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike Wehrheim. “Mechanized Proofs of Opacity: A Comparison of Two Techniques.” <i>Formal Asp. Comput.</i> 30, no. 5 (2018): 597–625. <a href=\"https://doi.org/10.1007/s00165-017-0433-3\">https://doi.org/10.1007/s00165-017-0433-3</a>.","mla":"Derrick, John, et al. “Mechanized Proofs of Opacity: A Comparison of Two Techniques.” <i>Formal Asp. Comput.</i>, vol. 30, no. 5, 2018, pp. 597–625, doi:<a href=\"https://doi.org/10.1007/s00165-017-0433-3\">10.1007/s00165-017-0433-3</a>.","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Mechanized proofs of opacity: a comparison of two techniques. <i>Formal Asp Comput</i>. 2018;30(5):597-625. doi:<a href=\"https://doi.org/10.1007/s00165-017-0433-3\">10.1007/s00165-017-0433-3</a>","bibtex":"@article{Derrick_Doherty_Dongol_Schellhorn_Travkin_Wehrheim_2018, title={Mechanized proofs of opacity: a comparison of two techniques}, volume={30}, DOI={<a href=\"https://doi.org/10.1007/s00165-017-0433-3\">10.1007/s00165-017-0433-3</a>}, number={5}, journal={Formal Asp. Comput.}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, year={2018}, pages={597–625} }"},"publication":"Formal Asp. Comput.","issue":"5","department":[{"_id":"77"}],"type":"journal_article","date_created":"2019-01-17T08:28:33Z","intvolume":"        30","date_updated":"2022-01-06T07:03:21Z","author":[{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"last_name":"Dongol","first_name":"Brijesh","full_name":"Dongol, Brijesh"},{"full_name":"Schellhorn, Gerhard","first_name":"Gerhard","last_name":"Schellhorn"},{"last_name":"Travkin","first_name":"Oleg","full_name":"Travkin, Oleg"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"title":"Mechanized proofs of opacity: a comparison of two techniques","year":"2018","status":"public","volume":30,"user_id":"29719","doi":"10.1007/s00165-017-0433-3","language":[{"iso":"eng"}],"_id":"6828","page":"597-625"},{"date_created":"2019-01-17T08:44:13Z","type":"conference","department":[{"_id":"77"}],"publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings","citation":{"ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability Compositional for Partially Ordered Executions,” in <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–129.","mla":"Doherty, Simon, et al. “Making Linearizability Compositional for Partially Ordered Executions.” <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–29, doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i> (pp. 110–129). <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>}, booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129} }","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making Linearizability Compositional for Partially Ordered Executions.” In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 110–29, 2018. <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>.","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional for Partially Ordered Executions. In: <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>. ; 2018:110-129. doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129."},"page":"110-129","_id":"6836","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-98938-9\\_7","user_id":"29719","status":"public","title":"Making Linearizability Compositional for Partially Ordered Executions","year":"2018","author":[{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"},{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"}],"date_updated":"2022-01-06T07:03:21Z"},{"publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings","citation":{"bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>}, booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129} }","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional for Partially Ordered Executions. In: <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>. ; 2018:110-129. doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>","mla":"Doherty, Simon, et al. “Making Linearizability Compositional for Partially Ordered Executions.” <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–29, doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>.","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129.","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making Linearizability Compositional for Partially Ordered Executions.” In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 110–29, 2018. <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>.","ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability Compositional for Partially Ordered Executions,” in <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–129.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i> (pp. 110–129). <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>"},"date_created":"2019-01-17T08:46:30Z","type":"conference","department":[{"_id":"77"}],"year":"2018","status":"public","title":"Making Linearizability Compositional for Partially Ordered Executions","author":[{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"},{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"}],"date_updated":"2022-01-06T07:03:21Z","page":"110-129","language":[{"iso":"eng"}],"_id":"6838","doi":"10.1007/978-3-319-98938-9\\_7","user_id":"29719"},{"doi":"10.4230/LIPIcs.DISC.2018.45","user_id":"29719","language":[{"iso":"eng"}],"_id":"6839","page":"45:1-45:3","date_updated":"2022-01-06T07:03:21Z","author":[{"full_name":"Doherty, Simon","last_name":"Doherty","first_name":"Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"},{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"}],"status":"public","title":"Brief Announcement: Generalising Concurrent Correctness to Weak Memory","year":"2018","department":[{"_id":"77"}],"type":"conference","date_created":"2019-01-17T08:54:03Z","citation":{"short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018, 2018, pp. 45:1-45:3.","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Brief Announcement: Generalising Concurrent Correctness to Weak Memory.” In <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>, 45:1-45:3, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">https://doi.org/10.4230/LIPIcs.DISC.2018.45</a>.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2018). Brief Announcement: Generalising Concurrent Correctness to Weak Memory. In <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i> (pp. 45:1-45:3). <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">https://doi.org/10.4230/LIPIcs.DISC.2018.45</a>","ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Brief Announcement: Generalising Concurrent Correctness to Weak Memory,” in <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>, 2018, pp. 45:1-45:3.","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Brief Announcement: Generalising Concurrent Correctness to Weak Memory. In: <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>. ; 2018:45:1-45:3. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">10.4230/LIPIcs.DISC.2018.45</a>","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Brief Announcement: Generalising Concurrent Correctness to Weak Memory}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">10.4230/LIPIcs.DISC.2018.45</a>}, booktitle={32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={45:1-45:3} }","mla":"Doherty, Simon, et al. “Brief Announcement: Generalising Concurrent Correctness to Weak Memory.” <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>, 2018, pp. 45:1-45:3, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">10.4230/LIPIcs.DISC.2018.45</a>."},"publication":"32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018"},{"date_updated":"2022-01-06T07:03:24Z","author":[{"first_name":"Mahdi","last_name":"Derakhshanmanesh","full_name":"Derakhshanmanesh, Mahdi"},{"full_name":"Ebert, Jürgen","last_name":"Ebert","first_name":"Jürgen"},{"last_name":"Grieger","first_name":"Marvin","full_name":"Grieger, Marvin"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"status":"public","title":"Model-integrating development of software systems: a flexible component-based approach","year":"2018","user_id":"11319","language":[{"iso":"eng"}],"_id":"6967","page":"1-30","citation":{"mla":"Derakhshanmanesh, Mahdi, et al. “Model-Integrating Development of Software Systems: A Flexible Component-Based Approach.” <i>Software &#38; Systems Modeling</i>, 2018, pp. 1–30.","bibtex":"@article{Derakhshanmanesh_Ebert_Grieger_Engels_2018, title={Model-integrating development of software systems: a flexible component-based approach}, journal={Software &#38; Systems Modeling}, author={Derakhshanmanesh, Mahdi and Ebert, Jürgen and Grieger, Marvin and Engels, Gregor}, year={2018}, pages={1–30} }","ama":"Derakhshanmanesh M, Ebert J, Grieger M, Engels G. Model-integrating development of software systems: a flexible component-based approach. <i>Software &#38; Systems Modeling</i>. 2018:1-30.","ieee":"M. Derakhshanmanesh, J. Ebert, M. Grieger, and G. Engels, “Model-integrating development of software systems: a flexible component-based approach,” <i>Software &#38; Systems Modeling</i>, pp. 1–30, 2018.","apa":"Derakhshanmanesh, M., Ebert, J., Grieger, M., &#38; Engels, G. (2018). Model-integrating development of software systems: a flexible component-based approach. <i>Software &#38; Systems Modeling</i>, 1–30.","short":"M. Derakhshanmanesh, J. Ebert, M. Grieger, G. Engels, Software &#38; Systems Modeling (2018) 1–30.","chicago":"Derakhshanmanesh, Mahdi, Jürgen Ebert, Marvin Grieger, and Gregor Engels. “Model-Integrating Development of Software Systems: A Flexible Component-Based Approach.” <i>Software &#38; Systems Modeling</i>, 2018, 1–30."},"publication":"Software & Systems Modeling","department":[{"_id":"66"}],"type":"journal_article","date_created":"2019-01-24T09:08:46Z"},{"date_created":"2019-01-24T13:53:22Z","file":[{"file_size":422196,"access_level":"open_access","file_name":"preprint_ris.pdf","date_updated":"2019-01-24T13:53:16Z","relation":"main_file","content_type":"application/pdf","file_id":"6971","creator":"stschn","date_created":"2019-01-24T13:53:16Z"}],"department":[{"_id":"75"}],"type":"conference","publication":"IEEE Global Communications Conference (GLOBECOM 2018)","abstract":[{"lang":"eng","text":"Dynamic allocation of resources is a key feature in network function virtualization (NFV), enabling flexible adjustment of slices and contained network services to ever-changing service demands. \r\nConsidering resource allocation across the entire network, many authors have proposed approaches to optimize the placement and chaining of virtual network function (VNF) instances and the allocation of resources to these VNF instances. In doing so, various optimization objectives are conceivable, e.g., minimizing certain required resources or the end-to-end delay of the placed services.\r\n\r\nIn this paper, we investigate the relationship between four typical optimization objectives when coordinating the placement and resource allocation of chained VNF instances. We observe an interesting trade-off between minimizing the overhead of starting/stopping VNF instances and all other objectives when adapting to changed service demands."}],"language":[{"iso":"eng"}],"author":[{"last_name":"Schneider","orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"id":"31764","first_name":"Sevil","last_name":"Dräxler","full_name":"Dräxler, Sevil"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger","id":"126"}],"year":"2018","title":"Trade-offs in Dynamic Resource Allocation in Network Function Virtualization","date_updated":"2022-01-06T07:03:24Z","oa":"1","citation":{"mla":"Schneider, Stefan Balthasar, et al. “Trade-Offs in Dynamic Resource Allocation in Network Function Virtualization.” <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>, IEEE, 2018.","bibtex":"@inproceedings{Schneider_Dräxler_Karl_2018, title={Trade-offs in Dynamic Resource Allocation in Network Function Virtualization}, booktitle={IEEE Global Communications Conference (GLOBECOM 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Dräxler, Sevil and Karl, Holger}, year={2018} }","ama":"Schneider SB, Dräxler S, Karl H. Trade-offs in Dynamic Resource Allocation in Network Function Virtualization. In: <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. IEEE; 2018.","ieee":"S. B. Schneider, S. Dräxler, and H. Karl, “Trade-offs in Dynamic Resource Allocation in Network Function Virtualization,” in <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>, Abu Dhabi, UAE, 2018.","apa":"Schneider, S. B., Dräxler, S., &#38; Karl, H. (2018). Trade-offs in Dynamic Resource Allocation in Network Function Virtualization. In <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. Abu Dhabi, UAE: IEEE.","chicago":"Schneider, Stefan Balthasar, Sevil Dräxler, and Holger Karl. “Trade-Offs in Dynamic Resource Allocation in Network Function Virtualization.” In <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. IEEE, 2018.","short":"S.B. Schneider, S. Dräxler, H. Karl, in: IEEE Global Communications Conference (GLOBECOM 2018), IEEE, 2018."},"file_date_updated":"2019-01-24T13:53:16Z","project":[{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"6970","publisher":"IEEE","ddc":["040"],"user_id":"35343","conference":{"name":"IEEE Global Communications Conference (GLOBECOM 2018)","location":"Abu Dhabi, UAE"},"status":"public","has_accepted_license":"1"},{"project":[{"name":"5G Development and validation platform for global industry-specific network services and Apps","grant_number":"761493","_id":"28"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2019-01-24T14:25:23Z","citation":{"ieee":"S. B. Schneider, M. Peuster, and H. Karl, “A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms,” in <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, Verona, Italy, 2018.","apa":"Schneider, S. B., Peuster, M., &#38; Karl, H. (2018). A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms. In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. Verona, Italy: IEEE. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">https://doi.org/10.1109/NFV-SDN.2018.8725795</a>","chicago":"Schneider, Stefan Balthasar, Manuel Peuster, and Holger Karl. “A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms.” In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">https://doi.org/10.1109/NFV-SDN.2018.8725795</a>.","short":"S.B. Schneider, M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018.","mla":"Schneider, Stefan Balthasar, et al. “A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms.” <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">10.1109/NFV-SDN.2018.8725795</a>.","bibtex":"@inproceedings{Schneider_Peuster_Karl_2018, title={A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">10.1109/NFV-SDN.2018.8725795</a>}, booktitle={IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Peuster, Manuel and Karl, Holger}, year={2018} }","ama":"Schneider SB, Peuster M, Karl H. A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms. In: <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">10.1109/NFV-SDN.2018.8725795</a>"},"oa":"1","has_accepted_license":"1","status":"public","conference":{"name":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)","location":"Verona, Italy"},"ddc":["040"],"user_id":"35343","publisher":"IEEE","_id":"6972","abstract":[{"text":"In recent years, a variety of different approaches\r\nhave been proposed to tackle the problem of scaling and placing\r\nnetwork services, consisting of interconnected virtual network\r\nfunctions (VNFs). This paper presents a placement abstraction\r\nlayer (PAL) that provides a clear and simple northbound interface\r\nfor using such algorithms while hiding their internal\r\nfunctionality and implementation. Through its southbound interface,\r\nPAL can connect to different back ends that evaluate\r\nthe calculated placements, e.g., using simulations, emulations, or\r\ntestbed approaches. As an example for such evaluation back ends,\r\nwe introduce a novel placement emulation framework (PEF)\r\nthat allows executing calculated placements using real, containerbased\r\nVNFs on real-world network topologies. In a case study,\r\nwe show how PAL and PEF facilitate reusing and evaluating\r\nplacement algorithms as well as validating their underlying\r\nmodels and performance claims.","lang":"eng"}],"publication":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)","type":"conference","department":[{"_id":"75"}],"file":[{"creator":"stschn","date_created":"2019-01-24T14:10:08Z","relation":"main_file","date_updated":"2019-01-24T14:25:23Z","file_name":"preprint_ris.pdf","file_size":468396,"access_level":"open_access","file_id":"6973","content_type":"application/pdf"}],"date_created":"2019-01-24T14:10:17Z","date_updated":"2022-01-06T07:03:24Z","year":"2018","title":"A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms","author":[{"last_name":"Schneider","first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"last_name":"Peuster","first_name":"Manuel","full_name":"Peuster, Manuel","id":"13271"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"doi":"10.1109/NFV-SDN.2018.8725795","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8725795"}],"language":[{"iso":"eng"}]},{"publication":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)","abstract":[{"text":"A key challenge of network function virtualization\r\n(NFV) is the complexity of developing and deploying new\r\nnetwork services. Currently, development requires many manual\r\nsteps that are time-consuming and error-prone (e.g., for creating\r\nservice descriptors). Furthermore, existing management and\r\norchestration (MANO) platforms only offer limited support of\r\nstandardized descriptor models or package formats, limiting the\r\nre-usability of network services.\r\n\r\nTo this end, we introduce a fully integrated, open-source\r\nNFV service development kit (SDK) with multi-MANO platform\r\nsupport. Our SDK simplifies many NFV service development\r\nsteps by offering initial generation of descriptors, advanced\r\nproject management, as well as fully automated packaging and\r\nsubmission for on-boarding. To achieve multi-platform support,\r\nwe present a package format that extends ETSI’s VNF package\r\nformat. In this demonstration, we present the end-to-end workflow\r\nto develop an NFV service that is then packaged for multiple\r\nplatforms, i.e., 5GTANGO and OSM.","lang":"eng"}],"date_created":"2019-01-24T14:17:58Z","file":[{"date_created":"2019-01-24T14:17:29Z","creator":"stschn","content_type":"application/pdf","file_id":"6975","date_updated":"2019-01-24T14:26:23Z","relation":"main_file","access_level":"open_access","file_size":475022,"file_name":"Pre-print.pdf"}],"department":[{"_id":"75"}],"type":"conference","author":[{"full_name":"Schneider, Stefan Balthasar","last_name":"Schneider","first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","id":"35343"},{"full_name":"Peuster, Manuel","last_name":"Peuster","first_name":"Manuel","id":"13271"},{"last_name":"Tavernier","first_name":"Wouter","full_name":"Tavernier, Wouter"},{"id":"126","full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl"}],"year":"2018","title":"A Fully Integrated Multi-Platform NFV SDK","date_updated":"2022-01-06T07:03:25Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8725794"}],"doi":"10.1109/NFV-SDN.2018.8725794","citation":{"short":"S.B. Schneider, M. Peuster, W. Tavernier, H. Karl, in: IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018.","chicago":"Schneider, Stefan Balthasar, Manuel Peuster, Wouter Tavernier, and Holger Karl. “A Fully Integrated Multi-Platform NFV SDK.” In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">https://doi.org/10.1109/NFV-SDN.2018.8725794</a>.","ieee":"S. B. Schneider, M. Peuster, W. Tavernier, and H. Karl, “A Fully Integrated Multi-Platform NFV SDK,” in <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, Verona, Italy, 2018.","apa":"Schneider, S. B., Peuster, M., Tavernier, W., &#38; Karl, H. (2018). A Fully Integrated Multi-Platform NFV SDK. In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. Verona, Italy: IEEE. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">https://doi.org/10.1109/NFV-SDN.2018.8725794</a>","bibtex":"@inproceedings{Schneider_Peuster_Tavernier_Karl_2018, title={A Fully Integrated Multi-Platform NFV SDK}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">10.1109/NFV-SDN.2018.8725794</a>}, booktitle={IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Peuster, Manuel and Tavernier, Wouter and Karl, Holger}, year={2018} }","ama":"Schneider SB, Peuster M, Tavernier W, Karl H. A Fully Integrated Multi-Platform NFV SDK. In: <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">10.1109/NFV-SDN.2018.8725794</a>","mla":"Schneider, Stefan Balthasar, et al. “A Fully Integrated Multi-Platform NFV SDK.” <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">10.1109/NFV-SDN.2018.8725794</a>."},"file_date_updated":"2019-01-24T14:26:23Z","project":[{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"oa":"1","conference":{"location":"Verona, Italy","name":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)"},"status":"public","has_accepted_license":"1","publisher":"IEEE","_id":"6974","user_id":"35343","ddc":["040"]},{"conference":{"end_date":"2018-10-04","location":"Lisbon, Portugal","start_date":"2018-10-01","name":"IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)"},"author":[{"first_name":"Jácome","last_name":"Cunha","full_name":"Cunha, Jácome"},{"first_name":"Joao Paulo","last_name":"Fernandes","full_name":"Fernandes, Joao Paulo"},{"full_name":"Kelleher, Caitlin","first_name":"Caitlin","last_name":"Kelleher"},{"first_name":"Jorge","last_name":"Mendes","full_name":"Mendes, Jorge"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"publication_identifier":{"isbn":["9781538642351"]},"year":"2018","status":"public","title":"2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)","date_updated":"2022-01-06T06:52:59Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16937","publisher":"IEEE","doi":"10.1109/vl/hcc43341.2018","user_id":"57458","citation":{"ama":"Cunha J, Fernandes JP, Kelleher C, Mendes J, Engels G. 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC). In: <i>Proceedings of 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Lisbon, Portugal, October 1-4, 2018</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/vl/hcc43341.2018\">10.1109/vl/hcc43341.2018</a>","bibtex":"@inproceedings{Cunha_Fernandes_Kelleher_Mendes_Engels_2018, title={2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)}, DOI={<a href=\"https://doi.org/10.1109/vl/hcc43341.2018\">10.1109/vl/hcc43341.2018</a>}, booktitle={Proceedings of 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Lisbon, Portugal, October 1-4, 2018}, publisher={IEEE}, author={Cunha, Jácome and Fernandes, Joao Paulo and Kelleher, Caitlin and Mendes, Jorge and Engels, Gregor}, year={2018} }","mla":"Cunha, Jácome, et al. “2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC).” <i>Proceedings of 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Lisbon, Portugal, October 1-4, 2018</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/vl/hcc43341.2018\">10.1109/vl/hcc43341.2018</a>.","chicago":"Cunha, Jácome, Joao Paulo Fernandes, Caitlin Kelleher, Jorge Mendes, and Gregor Engels. “2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC).” In <i>Proceedings of 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Lisbon, Portugal, October 1-4, 2018</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/vl/hcc43341.2018\">https://doi.org/10.1109/vl/hcc43341.2018</a>.","short":"J. Cunha, J.P. Fernandes, C. Kelleher, J. Mendes, G. Engels, in: Proceedings of 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Lisbon, Portugal, October 1-4, 2018, IEEE, 2018.","apa":"Cunha, J., Fernandes, J. P., Kelleher, C., Mendes, J., &#38; Engels, G. (2018). 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC). In <i>Proceedings of 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Lisbon, Portugal, October 1-4, 2018</i>. Lisbon, Portugal: IEEE. <a href=\"https://doi.org/10.1109/vl/hcc43341.2018\">https://doi.org/10.1109/vl/hcc43341.2018</a>","ieee":"J. Cunha, J. P. Fernandes, C. Kelleher, J. Mendes, and G. Engels, “2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC),” in <i>Proceedings of 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Lisbon, Portugal, October 1-4, 2018</i>, Lisbon, Portugal, 2018."},"publication":"Proceedings of 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Lisbon, Portugal, October 1-4, 2018","date_created":"2020-05-05T15:14:04Z","department":[{"_id":"66"}],"type":"conference"},{"department":[{"_id":"66"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-05-05T15:38:22Z","citation":{"ieee":"G. Engels, G. W. Maier, S. K. Ötting, E. Steffen, and A. Teetz, “Gerechtigkeit in flexiblen Arbeits- und Managementprozessen,” in <i>Zukunft der Arbeit – Eine praxisnahe Betrachtung</i>, S. Wischmann and E. A. Hartmann, Eds. Berlin, Heidelberg: Springer Verlag, 2018, pp. 221–231.","apa":"Engels, G., Maier, G. W., Ötting, S. K., Steffen, E., &#38; Teetz, A. (2018). Gerechtigkeit in flexiblen Arbeits- und Managementprozessen. In S. Wischmann &#38; E. A. Hartmann (Eds.), <i>Zukunft der Arbeit – Eine praxisnahe Betrachtung</i> (pp. 221–231). Berlin, Heidelberg: Springer Verlag. <a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">https://doi.org/10.1007/978-3-662-49266-6_16</a>","short":"G. Engels, G.W. Maier, S.K. Ötting, E. Steffen, A. Teetz, in: S. Wischmann, E.A. Hartmann (Eds.), Zukunft Der Arbeit – Eine Praxisnahe Betrachtung, Springer Verlag, Berlin, Heidelberg, 2018, pp. 221–231.","chicago":"Engels, Gregor, Günter W. Maier, Sonja K. Ötting, Eckhard Steffen, and Alexander Teetz. “Gerechtigkeit in Flexiblen Arbeits- Und Managementprozessen.” In <i>Zukunft Der Arbeit – Eine Praxisnahe Betrachtung</i>, edited by Steffen Wischmann and Ernst Andreas Hartmann, 221–31. Berlin, Heidelberg: Springer Verlag, 2018. <a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">https://doi.org/10.1007/978-3-662-49266-6_16</a>.","mla":"Engels, Gregor, et al. “Gerechtigkeit in Flexiblen Arbeits- Und Managementprozessen.” <i>Zukunft Der Arbeit – Eine Praxisnahe Betrachtung</i>, edited by Steffen Wischmann and Ernst Andreas Hartmann, Springer Verlag, 2018, pp. 221–31, doi:<a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">10.1007/978-3-662-49266-6_16</a>.","bibtex":"@inbook{Engels_Maier_Ötting_Steffen_Teetz_2018, place={Berlin, Heidelberg}, title={Gerechtigkeit in flexiblen Arbeits- und Managementprozessen}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">10.1007/978-3-662-49266-6_16</a>}, booktitle={Zukunft der Arbeit – Eine praxisnahe Betrachtung}, publisher={Springer Verlag}, author={Engels, Gregor and Maier, Günter W. and Ötting, Sonja K. and Steffen, Eckhard and Teetz, Alexander}, editor={Wischmann, Steffen and Hartmann, Ernst AndreasEditors}, year={2018}, pages={221–231} }","ama":"Engels G, Maier GW, Ötting SK, Steffen E, Teetz A. Gerechtigkeit in flexiblen Arbeits- und Managementprozessen. In: Wischmann S, Hartmann EA, eds. <i>Zukunft Der Arbeit – Eine Praxisnahe Betrachtung</i>. Berlin, Heidelberg: Springer Verlag; 2018:221-231. doi:<a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">10.1007/978-3-662-49266-6_16</a>"},"publication":"Zukunft der Arbeit – Eine praxisnahe Betrachtung","editor":[{"full_name":"Wischmann, Steffen","first_name":"Steffen","last_name":"Wischmann"},{"first_name":"Ernst Andreas","last_name":"Hartmann","full_name":"Hartmann, Ernst Andreas"}],"doi":"10.1007/978-3-662-49266-6_16","user_id":"57458","_id":"16938","language":[{"iso":"eng"}],"publisher":"Springer Verlag","page":"221-231","date_updated":"2022-01-06T06:52:59Z","publication_status":"published","author":[{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"full_name":"Maier, Günter W.","last_name":"Maier","first_name":"Günter W."},{"full_name":"Ötting, Sonja K.","last_name":"Ötting","first_name":"Sonja K."},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"},{"first_name":"Alexander","last_name":"Teetz","full_name":"Teetz, Alexander"}],"publication_identifier":{"isbn":["9783662492659","9783662492666"]},"year":"2018","title":"Gerechtigkeit in flexiblen Arbeits- und Managementprozessen","status":"public"},{"doi":"10.1109/LES.2017.2758200","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:50:39Z","title":"Validity of Software Verification Results on Approximate Hardware","year":"2018","author":[{"first_name":"Tobias","last_name":"Isenberg","full_name":"Isenberg, Tobias"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"id":"22398","last_name":"Pauck","first_name":"Felix","full_name":"Pauck, Felix"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication_identifier":{"issn":["1943-0663","1943-0671"]},"type":"journal_article","department":[{"_id":"77"}],"file":[{"creator":"ups","date_created":"2018-11-02T15:27:04Z","file_size":523362,"access_level":"closed","file_name":"08053741.pdf","date_updated":"2018-11-02T15:27:04Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5303"}],"date_created":"2017-12-11T16:11:00Z","abstract":[{"text":"Approximate computing (AC) is an emerging paradigm for energy-efficient computation. The basic idea of AC is to sacrifice high precision for low energy by allowing hardware to carry out “approximately correct” calculations. This provides a major challenge for software quality assurance: programs successfully verified to be correct might be erroneous on approximate hardware. In this letter, we present a novel approach for determining under what conditions a software verification result is valid for approximate hardware. To this end, we compute the allowed tolerances for AC hardware from successful verification runs. More precisely, we derive a set of constraints which—when met by the AC hardware—guarantees the verification result to carry over to AC. On the practical side, we furthermore: 1) show how to extract tolerances from verification runs employing predicate abstraction as verification technology and 2) show how to check such constraints on hardware designs. We have implemented all techniques, and exemplify them on example C programs and a number of recently proposed approximate adders.","lang":"eng"}],"publication":"IEEE Embedded Systems Letters","user_id":"477","ddc":["000"],"page":"22-25","_id":"1043","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"file_date_updated":"2018-11-02T15:27:04Z","citation":{"chicago":"Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “Validity of Software Verification Results on Approximate Hardware.” <i>IEEE Embedded Systems Letters</i>, 2018, 22–25. <a href=\"https://doi.org/10.1109/LES.2017.2758200\">https://doi.org/10.1109/LES.2017.2758200</a>.","short":"T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, IEEE Embedded Systems Letters (2018) 22–25.","apa":"Isenberg, T., Jakobs, M.-C., Pauck, F., &#38; Wehrheim, H. (2018). Validity of Software Verification Results on Approximate Hardware. <i>IEEE Embedded Systems Letters</i>, 22–25. <a href=\"https://doi.org/10.1109/LES.2017.2758200\">https://doi.org/10.1109/LES.2017.2758200</a>","ieee":"T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “Validity of Software Verification Results on Approximate Hardware,” <i>IEEE Embedded Systems Letters</i>, pp. 22–25, 2018.","ama":"Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. Validity of Software Verification Results on Approximate Hardware. <i>IEEE Embedded Systems Letters</i>. 2018:22-25. doi:<a href=\"https://doi.org/10.1109/LES.2017.2758200\">10.1109/LES.2017.2758200</a>","bibtex":"@article{Isenberg_Jakobs_Pauck_Wehrheim_2018, title={Validity of Software Verification Results on Approximate Hardware}, DOI={<a href=\"https://doi.org/10.1109/LES.2017.2758200\">10.1109/LES.2017.2758200</a>}, journal={IEEE Embedded Systems Letters}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}, year={2018}, pages={22–25} }","mla":"Isenberg, Tobias, et al. “Validity of Software Verification Results on Approximate Hardware.” <i>IEEE Embedded Systems Letters</i>, Institute of Electrical and Electronics Engineers (IEEE), 2018, pp. 22–25, doi:<a href=\"https://doi.org/10.1109/LES.2017.2758200\">10.1109/LES.2017.2758200</a>."}},{"ddc":["000"],"user_id":"15504","_id":"1044","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:39Z","has_accepted_license":"1","status":"public","title":"Measuring Performance of a Static Analysis Framework with an application to Immutability Analysis","year":"2018","author":[{"full_name":"Leer, Richard","first_name":"Richard","last_name":"Leer"}],"type":"bachelorsthesis","department":[{"_id":"76"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"5768","date_updated":"2018-11-21T06:15:51Z","relation":"main_file","access_level":"closed","file_size":1383049,"file_name":"ba_leer.pdf","date_created":"2018-11-21T06:15:51Z","creator":"florida"}],"date_created":"2017-12-13T07:52:01Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"file_date_updated":"2018-11-21T06:15:51Z","supervisor":[{"first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","full_name":"Bodden, Eric","id":"59256"}],"citation":{"ieee":"R. Leer, <i>Measuring Performance of a Static Analysis Framework with an application to Immutability Analysis</i>. Universität Paderborn, 2018.","mla":"Leer, Richard. <i>Measuring Performance of a Static Analysis Framework with an Application to Immutability Analysis</i>. Universität Paderborn, 2018.","apa":"Leer, R. (2018). <i>Measuring Performance of a Static Analysis Framework with an application to Immutability Analysis</i>. Universität Paderborn.","bibtex":"@book{Leer_2018, title={Measuring Performance of a Static Analysis Framework with an application to Immutability Analysis}, publisher={Universität Paderborn}, author={Leer, Richard}, year={2018} }","ama":"Leer R. <i>Measuring Performance of a Static Analysis Framework with an Application to Immutability Analysis</i>. Universität Paderborn; 2018.","short":"R. Leer, Measuring Performance of a Static Analysis Framework with an Application to Immutability Analysis, Universität Paderborn, 2018.","chicago":"Leer, Richard. <i>Measuring Performance of a Static Analysis Framework with an Application to Immutability Analysis</i>. Universität Paderborn, 2018."}},{"file_date_updated":"2018-11-21T06:14:15Z","supervisor":[{"id":"59256","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric"}],"citation":{"mla":"Strüwer, Jan Niclas. <i>Interactive Data Visualization for Exploded Supergraphs</i>. Universität Paderborn, 2018.","ama":"Strüwer JN. <i>Interactive Data Visualization for Exploded Supergraphs</i>. Universität Paderborn; 2018.","bibtex":"@book{Strüwer_2018, title={Interactive Data Visualization for Exploded Supergraphs}, publisher={Universität Paderborn}, author={Strüwer, Jan Niclas}, year={2018} }","apa":"Strüwer, J. N. (2018). <i>Interactive Data Visualization for Exploded Supergraphs</i>. Universität Paderborn.","ieee":"J. N. Strüwer, <i>Interactive Data Visualization for Exploded Supergraphs</i>. Universität Paderborn, 2018.","short":"J.N. Strüwer, Interactive Data Visualization for Exploded Supergraphs, Universität Paderborn, 2018.","chicago":"Strüwer, Jan Niclas. <i>Interactive Data Visualization for Exploded Supergraphs</i>. Universität Paderborn, 2018."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"file":[{"creator":"florida","date_created":"2018-11-21T06:14:15Z","access_level":"closed","file_size":15839765,"file_name":"ba_struewer.pdf","date_updated":"2018-11-21T06:14:15Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5767"}],"date_created":"2017-12-13T07:53:49Z","type":"bachelorsthesis","department":[{"_id":"76"}],"status":"public","title":"Interactive Data Visualization for Exploded Supergraphs","year":"2018","author":[{"last_name":"Strüwer","first_name":"Jan Niclas","full_name":"Strüwer, Jan Niclas"}],"date_updated":"2022-01-06T06:50:40Z","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"1045","publisher":"Universität Paderborn","ddc":["000"],"user_id":"15504"},{"language":[{"iso":"eng"}],"_id":"10591","page":"1-29","volume":7,"alternative_title":["Manifesto from Dagstuhl Perspectives Workshop 16151"],"editor":[{"full_name":"Abiteboul, S.","first_name":"S.","last_name":"Abiteboul"},{"full_name":"Arenas, M.","last_name":"Arenas","first_name":"M."},{"full_name":"Barceló, P.","last_name":"Barceló","first_name":"P."},{"last_name":"Bienvenu","first_name":"M.","full_name":"Bienvenu, M."},{"first_name":"D.","last_name":"Calvanese","full_name":"Calvanese, D."},{"full_name":"David, C.","first_name":"C.","last_name":"David"},{"first_name":"R.","last_name":"Hull","full_name":"Hull, R."},{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"},{"last_name":"Kimelfeld","first_name":"B.","full_name":"Kimelfeld, B."},{"full_name":"Libkin, L.","last_name":"Libkin","first_name":"L."},{"first_name":"W.","last_name":"Martens","full_name":"Martens, W."},{"first_name":"T.","last_name":"Milo","full_name":"Milo, T."},{"last_name":"Murlak","first_name":"F.","full_name":"Murlak, F."},{"last_name":"Neven","first_name":"F.","full_name":"Neven, F."},{"full_name":"Ortiz, M.","last_name":"Ortiz","first_name":"M."},{"full_name":"Schwentick, T.","first_name":"T.","last_name":"Schwentick"},{"full_name":"Stoyanovich, J.","last_name":"Stoyanovich","first_name":"J."},{"first_name":"J.","last_name":"Su","full_name":"Su, J."},{"full_name":"Suciu, D.","last_name":"Suciu","first_name":"D."},{"first_name":"V.","last_name":"Vianu","full_name":"Vianu, V."},{"full_name":"Yi, K.","last_name":"Yi","first_name":"K."}],"user_id":"49109","year":"2018","status":"public","title":"Research Directions for Principles of Data Management","intvolume":"         7","date_updated":"2022-01-06T06:50:45Z","date_created":"2019-07-09T15:58:12Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"type":"conference_editor","citation":{"mla":"Abiteboul, S., et al., editors. <i>Research Directions for Principles of Data Management</i>. Vol. 7, no. 1, 2018, pp. 1–29.","apa":"Abiteboul, S., Arenas, M., Barceló, P., Bienvenu, M., Calvanese, D., David, C., … Yi, K. (Eds.). (2018). <i>Research Directions for Principles of Data Management</i> (Vol. 7, pp. 1–29).","ieee":"S. Abiteboul <i>et al.</i>, Eds., <i>Research Directions for Principles of Data Management</i>, vol. 7, no. 1. 2018, pp. 1–29.","chicago":"Abiteboul, S., M. Arenas, P. Barceló, M. Bienvenu, D. Calvanese, C. David, R. Hull, et al., eds. <i>Research Directions for Principles of Data Management</i>. Vol. 7, 2018.","short":"S. Abiteboul, M. Arenas, P. Barceló, M. Bienvenu, D. Calvanese, C. David, R. Hull, E. Hüllermeier, B. Kimelfeld, L. Libkin, W. Martens, T. Milo, F. Murlak, F. Neven, M. Ortiz, T. Schwentick, J. Stoyanovich, J. Su, D. Suciu, V. Vianu, K. Yi, eds., Research Directions for Principles of Data Management, 2018.","ama":"Abiteboul S, Arenas M, Barceló P, et al., eds. <i>Research Directions for Principles of Data Management</i>. Vol 7.; 2018:1-29.","bibtex":"@book{Abiteboul_Arenas_Barceló_Bienvenu_Calvanese_David_Hull_Hüllermeier_Kimelfeld_Libkin_et al._2018, title={Research Directions for Principles of Data Management}, volume={7}, number={1}, year={2018}, pages={1–29} }"},"issue":"1"},{"abstract":[{"lang":"eng","text":"Approximate computing has become a very popular design\r\nstrategy that exploits error resilient computations to achieve higher\r\nperformance and energy efficiency. Automated synthesis of approximate\r\ncircuits is performed via functional approximation, in which various\r\nparts of the target circuit are extensively examined with a library\r\nof approximate components/transformations to trade off the functional\r\naccuracy and computational budget (i.e., power). However, as the number\r\nof possible approximate transformations increases, traditional search\r\ntechniques suffer from a combinatorial explosion due to the large\r\nbranching factor. In this work, we present a comprehensive framework\r\nfor automated synthesis of approximate circuits from either structural\r\nor behavioral descriptions. We adapt the Monte Carlo Tree Search\r\n(MCTS), as a stochastic search technique, to deal with the large design\r\nspace exploration, which enables a broader range of potential possible\r\napproximations through lightweight random simulations. The proposed\r\nframework is able to recognize the design Pareto set even with low\r\ncomputational budgets. Experimental results highlight the capabilities of\r\nthe proposed synthesis framework by resulting in up to 61.69% energy\r\nsaving while maintaining the predefined quality constraints."}],"citation":{"ieee":"M. Awais, H. Ghasemzadeh Mohammadi, and M. Platzner, “An MCTS-based Framework for Synthesis of Approximate Circuits,” in <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 2018, pp. 219–224.","apa":"Awais, M., Ghasemzadeh Mohammadi, H., &#38; Platzner, M. (2018). An MCTS-based Framework for Synthesis of Approximate Circuits. In <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i> (pp. 219–224). <a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">https://doi.org/10.1109/VLSI-SoC.2018.8645026</a>","mla":"Awais, Muhammad, et al. “An MCTS-Based Framework for Synthesis of Approximate Circuits.” <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 2018, pp. 219–24, doi:<a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">10.1109/VLSI-SoC.2018.8645026</a>.","bibtex":"@inproceedings{Awais_Ghasemzadeh Mohammadi_Platzner_2018, title={An MCTS-based Framework for Synthesis of Approximate Circuits}, DOI={<a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">10.1109/VLSI-SoC.2018.8645026</a>}, booktitle={26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)}, author={Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and Platzner, Marco}, year={2018}, pages={219–224} }","short":"M. Awais, H. Ghasemzadeh Mohammadi, M. Platzner, in: 26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC), 2018, pp. 219–224.","ama":"Awais M, Ghasemzadeh Mohammadi H, Platzner M. An MCTS-based Framework for Synthesis of Approximate Circuits. In: <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i>. ; 2018:219-224. doi:<a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">10.1109/VLSI-SoC.2018.8645026</a>","chicago":"Awais, Muhammad, Hassan Ghasemzadeh Mohammadi, and Marco Platzner. “An MCTS-Based Framework for Synthesis of Approximate Circuits.” In <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 219–24, 2018. <a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">https://doi.org/10.1109/VLSI-SoC.2018.8645026</a>."},"publication":"26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)","department":[{"_id":"78"}],"type":"conference","keyword":["Approximate computing","High-level synthesis","Accuracy","Monte-Carlo tree search","Circuit simulation"],"date_created":"2019-07-10T09:21:38Z","date_updated":"2022-01-06T06:50:46Z","author":[{"id":"64665","last_name":"Awais","first_name":"Muhammad","orcid":"https://orcid.org/0000-0003-4148-2969","full_name":"Awais, Muhammad"},{"id":"61186","first_name":"Hassan","last_name":"Ghasemzadeh Mohammadi","full_name":"Ghasemzadeh Mohammadi, Hassan"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"year":"2018","title":"An MCTS-based Framework for Synthesis of Approximate Circuits","status":"public","user_id":"64665","doi":"10.1109/VLSI-SoC.2018.8645026","language":[{"iso":"eng"}],"_id":"10598","page":"219-224"},{"author":[{"id":"74287","last_name":"Clausing","first_name":"Lennart","orcid":"0000-0003-3789-6034","full_name":"Clausing, Lennart"}],"status":"public","title":"Development of a Hardware / Software Codesign for sonification of LIDAR-based sensor data","year":"2018","date_updated":"2022-01-06T06:50:50Z","_id":"10782","publisher":"Ruhr-University Bochum","language":[{"iso":"eng"}],"user_id":"3118","citation":{"mla":"Clausing, Lennart. <i>Development of a Hardware / Software Codesign for Sonification of LIDAR-Based Sensor Data</i>. Ruhr-University Bochum, 2018.","ama":"Clausing L. <i>Development of a Hardware / Software Codesign for Sonification of LIDAR-Based Sensor Data</i>. Ruhr-University Bochum; 2018.","bibtex":"@book{Clausing_2018, title={Development of a Hardware / Software Codesign for sonification of LIDAR-based sensor data}, publisher={Ruhr-University Bochum}, author={Clausing, Lennart}, year={2018} }","apa":"Clausing, L. (2018). <i>Development of a Hardware / Software Codesign for sonification of LIDAR-based sensor data</i>. Ruhr-University Bochum.","ieee":"L. Clausing, <i>Development of a Hardware / Software Codesign for sonification of LIDAR-based sensor data</i>. Ruhr-University Bochum, 2018.","short":"L. Clausing, Development of a Hardware / Software Codesign for Sonification of LIDAR-Based Sensor Data, Ruhr-University Bochum, 2018.","chicago":"Clausing, Lennart. <i>Development of a Hardware / Software Codesign for Sonification of LIDAR-Based Sensor Data</i>. Ruhr-University Bochum, 2018."},"extern":"1","date_created":"2019-07-10T12:13:18Z","department":[{"_id":"78"}],"type":"mastersthesis"}]