[{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"1190","user_id":"477","department":[{"_id":"77"}],"ddc":["040"],"file_date_updated":"2018-03-08T09:14:11Z","type":"dissertation","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-08T09:14:11Z","date_created":"2018-03-08T06:23:21Z","creator":"florida","file_size":3354335,"access_level":"closed","file_id":"1195","file_name":"1190-thesis_abgabeversion.pdf"}],"status":"public","date_updated":"2022-01-06T06:51:12Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"author":[{"first_name":"Tobias","last_name":"Isenberg","full_name":"Isenberg, Tobias"}],"date_created":"2018-03-05T10:11:48Z","title":"Induction-based Verification of Timed Systems","has_accepted_license":"1","year":"2016","citation":{"chicago":"Isenberg, Tobias. <i>Induction-Based Verification of Timed Systems</i>. Universität Paderborn, 2016.","ieee":"T. Isenberg, <i>Induction-based Verification of Timed Systems</i>. Universität Paderborn, 2016.","ama":"Isenberg T. <i>Induction-Based Verification of Timed Systems</i>. Universität Paderborn; 2016.","bibtex":"@book{Isenberg_2016, title={Induction-based Verification of Timed Systems}, publisher={Universität Paderborn}, author={Isenberg, Tobias}, year={2016} }","short":"T. Isenberg, Induction-Based Verification of Timed Systems, Universität Paderborn, 2016.","mla":"Isenberg, Tobias. <i>Induction-Based Verification of Timed Systems</i>. Universität Paderborn, 2016.","apa":"Isenberg, T. (2016). <i>Induction-based Verification of Timed Systems</i>. Universität Paderborn."}},{"year":"2016","citation":{"mla":"Blobel, Johannes, et al. “Protocol Options for Low Power Sensor Network MAC Using Wake-up Receivers with Duty Cycling.” <i>2016 IEEE International Conference on Communications (ICC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/icc.2016.7511318\">10.1109/icc.2016.7511318</a>.","bibtex":"@inproceedings{Blobel_Sommer_Dressler_2016, title={Protocol options for low power sensor network MAC using wake-up receivers with duty cycling}, DOI={<a href=\"https://doi.org/10.1109/icc.2016.7511318\">10.1109/icc.2016.7511318</a>}, booktitle={2016 IEEE International Conference on Communications (ICC)}, author={Blobel, Johannes and Sommer, Christoph and Dressler, Falko}, year={2016} }","short":"J. Blobel, C. Sommer, F. Dressler, in: 2016 IEEE International Conference on Communications (ICC), 2016.","apa":"Blobel, J., Sommer, C., &#38; Dressler, F. (2016). Protocol options for low power sensor network MAC using wake-up receivers with duty cycling. In <i>2016 IEEE International Conference on Communications (ICC)</i>. <a href=\"https://doi.org/10.1109/icc.2016.7511318\">https://doi.org/10.1109/icc.2016.7511318</a>","ama":"Blobel J, Sommer C, Dressler F. Protocol options for low power sensor network MAC using wake-up receivers with duty cycling. In: <i>2016 IEEE International Conference on Communications (ICC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/icc.2016.7511318\">10.1109/icc.2016.7511318</a>","ieee":"J. Blobel, C. Sommer, and F. Dressler, “Protocol options for low power sensor network MAC using wake-up receivers with duty cycling,” in <i>2016 IEEE International Conference on Communications (ICC)</i>, 2016.","chicago":"Blobel, Johannes, Christoph Sommer, and Falko Dressler. “Protocol Options for Low Power Sensor Network MAC Using Wake-up Receivers with Duty Cycling.” In <i>2016 IEEE International Conference on Communications (ICC)</i>, 2016. <a href=\"https://doi.org/10.1109/icc.2016.7511318\">https://doi.org/10.1109/icc.2016.7511318</a>."},"publication_status":"published","publication_identifier":{"isbn":["9781479966646"]},"title":"Protocol options for low power sensor network MAC using wake-up receivers with duty cycling","doi":"10.1109/icc.2016.7511318","date_updated":"2022-01-06T06:51:14Z","date_created":"2019-07-18T09:51:21Z","author":[{"first_name":"Johannes","full_name":"Blobel, Johannes","last_name":"Blobel"},{"first_name":"Christoph","id":"49154","full_name":"Sommer, Christoph","last_name":"Sommer","orcid":"0000-0002-4336-7350"},{"first_name":"Falko","last_name":"Dressler","full_name":"Dressler, Falko"}],"status":"public","type":"conference","publication":"2016 IEEE International Conference on Communications (ICC)","language":[{"iso":"eng"}],"_id":"11975","user_id":"49154","department":[{"_id":"589"}]},{"doi":"10.1109/icc.2016.7511085","title":"On the impact of adjacent channel interference in multi-channel VANETs","date_created":"2019-07-18T09:51:57Z","author":[{"first_name":"Claudia","last_name":"Campolo","full_name":"Campolo, Claudia"},{"full_name":"Sommer, Christoph","id":"49154","last_name":"Sommer","orcid":"0000-0002-4336-7350","first_name":"Christoph"},{"first_name":"Falko","last_name":"Dressler","full_name":"Dressler, Falko"},{"first_name":"Antonella","full_name":"Molinaro, Antonella","last_name":"Molinaro"}],"date_updated":"2022-01-06T06:51:15Z","citation":{"ieee":"C. Campolo, C. Sommer, F. Dressler, and A. Molinaro, “On the impact of adjacent channel interference in multi-channel VANETs,” in <i>2016 IEEE International Conference on Communications (ICC)</i>, 2016.","chicago":"Campolo, Claudia, Christoph Sommer, Falko Dressler, and Antonella Molinaro. “On the Impact of Adjacent Channel Interference in Multi-Channel VANETs.” In <i>2016 IEEE International Conference on Communications (ICC)</i>, 2016. <a href=\"https://doi.org/10.1109/icc.2016.7511085\">https://doi.org/10.1109/icc.2016.7511085</a>.","ama":"Campolo C, Sommer C, Dressler F, Molinaro A. On the impact of adjacent channel interference in multi-channel VANETs. In: <i>2016 IEEE International Conference on Communications (ICC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/icc.2016.7511085\">10.1109/icc.2016.7511085</a>","short":"C. Campolo, C. Sommer, F. Dressler, A. Molinaro, in: 2016 IEEE International Conference on Communications (ICC), 2016.","bibtex":"@inproceedings{Campolo_Sommer_Dressler_Molinaro_2016, title={On the impact of adjacent channel interference in multi-channel VANETs}, DOI={<a href=\"https://doi.org/10.1109/icc.2016.7511085\">10.1109/icc.2016.7511085</a>}, booktitle={2016 IEEE International Conference on Communications (ICC)}, author={Campolo, Claudia and Sommer, Christoph and Dressler, Falko and Molinaro, Antonella}, year={2016} }","mla":"Campolo, Claudia, et al. “On the Impact of Adjacent Channel Interference in Multi-Channel VANETs.” <i>2016 IEEE International Conference on Communications (ICC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/icc.2016.7511085\">10.1109/icc.2016.7511085</a>.","apa":"Campolo, C., Sommer, C., Dressler, F., &#38; Molinaro, A. (2016). On the impact of adjacent channel interference in multi-channel VANETs. In <i>2016 IEEE International Conference on Communications (ICC)</i>. <a href=\"https://doi.org/10.1109/icc.2016.7511085\">https://doi.org/10.1109/icc.2016.7511085</a>"},"year":"2016","publication_status":"published","publication_identifier":{"isbn":["9781479966646"]},"language":[{"iso":"eng"}],"user_id":"49154","department":[{"_id":"589"}],"_id":"11988","status":"public","type":"conference","publication":"2016 IEEE International Conference on Communications (ICC)"},{"citation":{"ama":"Hagenauer F, Sommer C, Merschjohann S, Higuchi T, Dressler F, Altintas O. Cars as the base for service discovery and provision in highly dynamic networks. In: <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/infcomw.2016.7562101\">10.1109/infcomw.2016.7562101</a>","ieee":"F. Hagenauer, C. Sommer, S. Merschjohann, T. Higuchi, F. Dressler, and O. Altintas, “Cars as the base for service discovery and provision in highly dynamic networks,” in <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>, 2016.","chicago":"Hagenauer, Florian, Christoph Sommer, Simon Merschjohann, Takamasa Higuchi, Falko Dressler, and Onur Altintas. “Cars as the Base for Service Discovery and Provision in Highly Dynamic Networks.” In <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>, 2016. <a href=\"https://doi.org/10.1109/infcomw.2016.7562101\">https://doi.org/10.1109/infcomw.2016.7562101</a>.","bibtex":"@inproceedings{Hagenauer_Sommer_Merschjohann_Higuchi_Dressler_Altintas_2016, title={Cars as the base for service discovery and provision in highly dynamic networks}, DOI={<a href=\"https://doi.org/10.1109/infcomw.2016.7562101\">10.1109/infcomw.2016.7562101</a>}, booktitle={2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)}, author={Hagenauer, Florian and Sommer, Christoph and Merschjohann, Simon and Higuchi, Takamasa and Dressler, Falko and Altintas, Onur}, year={2016} }","mla":"Hagenauer, Florian, et al. “Cars as the Base for Service Discovery and Provision in Highly Dynamic Networks.” <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/infcomw.2016.7562101\">10.1109/infcomw.2016.7562101</a>.","short":"F. Hagenauer, C. Sommer, S. Merschjohann, T. Higuchi, F. Dressler, O. Altintas, in: 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2016.","apa":"Hagenauer, F., Sommer, C., Merschjohann, S., Higuchi, T., Dressler, F., &#38; Altintas, O. (2016). Cars as the base for service discovery and provision in highly dynamic networks. In <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>. <a href=\"https://doi.org/10.1109/infcomw.2016.7562101\">https://doi.org/10.1109/infcomw.2016.7562101</a>"},"year":"2016","publication_status":"published","publication_identifier":{"isbn":["9781467399555"]},"doi":"10.1109/infcomw.2016.7562101","title":"Cars as the base for service discovery and provision in highly dynamic networks","date_created":"2019-07-18T09:53:13Z","author":[{"first_name":"Florian","last_name":"Hagenauer","full_name":"Hagenauer, Florian"},{"orcid":"0000-0002-4336-7350","last_name":"Sommer","id":"49154","full_name":"Sommer, Christoph","first_name":"Christoph"},{"last_name":"Merschjohann","full_name":"Merschjohann, Simon","first_name":"Simon"},{"full_name":"Higuchi, Takamasa","last_name":"Higuchi","first_name":"Takamasa"},{"first_name":"Falko","full_name":"Dressler, Falko","last_name":"Dressler"},{"first_name":"Onur","last_name":"Altintas","full_name":"Altintas, Onur"}],"date_updated":"2022-01-06T06:51:15Z","status":"public","type":"conference","publication":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","language":[{"iso":"eng"}],"user_id":"49154","department":[{"_id":"589"}],"_id":"12011"},{"publication_identifier":{"isbn":["9781467399555"]},"publication_status":"published","citation":{"ama":"Hagenauer F, Sommer C, Onishi R, Wilhelm M, Dressler F, Altintas O. Interconnecting smart cities by vehicles: How feasible is it? In: <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/infcomw.2016.7562184\">10.1109/infcomw.2016.7562184</a>","chicago":"Hagenauer, Florian, Christoph Sommer, Ryokichi Onishi, Matthias Wilhelm, Falko Dressler, and Onur Altintas. “Interconnecting Smart Cities by Vehicles: How Feasible Is It?” In <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>, 2016. <a href=\"https://doi.org/10.1109/infcomw.2016.7562184\">https://doi.org/10.1109/infcomw.2016.7562184</a>.","ieee":"F. Hagenauer, C. Sommer, R. Onishi, M. Wilhelm, F. Dressler, and O. Altintas, “Interconnecting smart cities by vehicles: How feasible is it?,” in <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>, 2016.","apa":"Hagenauer, F., Sommer, C., Onishi, R., Wilhelm, M., Dressler, F., &#38; Altintas, O. (2016). Interconnecting smart cities by vehicles: How feasible is it? In <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>. <a href=\"https://doi.org/10.1109/infcomw.2016.7562184\">https://doi.org/10.1109/infcomw.2016.7562184</a>","short":"F. Hagenauer, C. Sommer, R. Onishi, M. Wilhelm, F. Dressler, O. Altintas, in: 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2016.","mla":"Hagenauer, Florian, et al. “Interconnecting Smart Cities by Vehicles: How Feasible Is It?” <i>2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/infcomw.2016.7562184\">10.1109/infcomw.2016.7562184</a>.","bibtex":"@inproceedings{Hagenauer_Sommer_Onishi_Wilhelm_Dressler_Altintas_2016, title={Interconnecting smart cities by vehicles: How feasible is it?}, DOI={<a href=\"https://doi.org/10.1109/infcomw.2016.7562184\">10.1109/infcomw.2016.7562184</a>}, booktitle={2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)}, author={Hagenauer, Florian and Sommer, Christoph and Onishi, Ryokichi and Wilhelm, Matthias and Dressler, Falko and Altintas, Onur}, year={2016} }"},"year":"2016","date_created":"2019-07-18T09:53:16Z","author":[{"first_name":"Florian","full_name":"Hagenauer, Florian","last_name":"Hagenauer"},{"full_name":"Sommer, Christoph","id":"49154","orcid":"0000-0002-4336-7350","last_name":"Sommer","first_name":"Christoph"},{"first_name":"Ryokichi","full_name":"Onishi, Ryokichi","last_name":"Onishi"},{"last_name":"Wilhelm","full_name":"Wilhelm, Matthias","first_name":"Matthias"},{"full_name":"Dressler, Falko","last_name":"Dressler","first_name":"Falko"},{"first_name":"Onur","last_name":"Altintas","full_name":"Altintas, Onur"}],"date_updated":"2022-01-06T06:51:15Z","doi":"10.1109/infcomw.2016.7562184","title":"Interconnecting smart cities by vehicles: How feasible is it?","publication":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","type":"conference","status":"public","department":[{"_id":"589"}],"user_id":"49154","_id":"12012","language":[{"iso":"eng"}]},{"type":"book_chapter","publication":"Smart Cities and Homes","status":"public","_id":"12013","user_id":"49154","department":[{"_id":"589"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9780128034545"]},"year":"2016","citation":{"chicago":"Hagenauer, F., F. Dressler, O. Altintas, and Christoph Sommer. “Cars as a Main ICT Resource of Smart Cities.” In <i>Smart Cities and Homes</i>, 2016. <a href=\"https://doi.org/10.1016/b978-0-12-803454-5.00007-9\">https://doi.org/10.1016/b978-0-12-803454-5.00007-9</a>.","ieee":"F. Hagenauer, F. Dressler, O. Altintas, and C. Sommer, “Cars as a main ICT resource of smart cities,” in <i>Smart Cities and Homes</i>, 2016.","ama":"Hagenauer F, Dressler F, Altintas O, Sommer C. Cars as a main ICT resource of smart cities. In: <i>Smart Cities and Homes</i>. ; 2016. doi:<a href=\"https://doi.org/10.1016/b978-0-12-803454-5.00007-9\">10.1016/b978-0-12-803454-5.00007-9</a>","mla":"Hagenauer, F., et al. “Cars as a Main ICT Resource of Smart Cities.” <i>Smart Cities and Homes</i>, 2016, doi:<a href=\"https://doi.org/10.1016/b978-0-12-803454-5.00007-9\">10.1016/b978-0-12-803454-5.00007-9</a>.","bibtex":"@inbook{Hagenauer_Dressler_Altintas_Sommer_2016, title={Cars as a main ICT resource of smart cities}, DOI={<a href=\"https://doi.org/10.1016/b978-0-12-803454-5.00007-9\">10.1016/b978-0-12-803454-5.00007-9</a>}, booktitle={Smart Cities and Homes}, author={Hagenauer, F. and Dressler, F. and Altintas, O. and Sommer, Christoph}, year={2016} }","short":"F. Hagenauer, F. Dressler, O. Altintas, C. Sommer, in: Smart Cities and Homes, 2016.","apa":"Hagenauer, F., Dressler, F., Altintas, O., &#38; Sommer, C. (2016). Cars as a main ICT resource of smart cities. In <i>Smart Cities and Homes</i>. <a href=\"https://doi.org/10.1016/b978-0-12-803454-5.00007-9\">https://doi.org/10.1016/b978-0-12-803454-5.00007-9</a>"},"date_updated":"2022-01-06T06:51:15Z","date_created":"2019-07-18T09:53:18Z","author":[{"last_name":"Hagenauer","full_name":"Hagenauer, F.","first_name":"F."},{"first_name":"F.","full_name":"Dressler, F.","last_name":"Dressler"},{"last_name":"Altintas","full_name":"Altintas, O.","first_name":"O."},{"last_name":"Sommer","orcid":"0000-0002-4336-7350","id":"49154","full_name":"Sommer, Christoph","first_name":"Christoph"}],"title":"Cars as a main ICT resource of smart cities","doi":"10.1016/b978-0-12-803454-5.00007-9"},{"type":"conference","publication":"2015 IEEE Vehicular Networking Conference (VNC)","status":"public","user_id":"49154","department":[{"_id":"589"}],"_id":"12029","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781467394116"]},"citation":{"apa":"Klingler, F., Dressler, F., &#38; Sommer, C. (2016). IEEE 802.11p unicast considered harmful. In <i>2015 IEEE Vehicular Networking Conference (VNC)</i>. <a href=\"https://doi.org/10.1109/vnc.2015.7385550\">https://doi.org/10.1109/vnc.2015.7385550</a>","bibtex":"@inproceedings{Klingler_Dressler_Sommer_2016, title={IEEE 802.11p unicast considered harmful}, DOI={<a href=\"https://doi.org/10.1109/vnc.2015.7385550\">10.1109/vnc.2015.7385550</a>}, booktitle={2015 IEEE Vehicular Networking Conference (VNC)}, author={Klingler, Florian and Dressler, Falko and Sommer, Christoph}, year={2016} }","mla":"Klingler, Florian, et al. “IEEE 802.11p Unicast Considered Harmful.” <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/vnc.2015.7385550\">10.1109/vnc.2015.7385550</a>.","short":"F. Klingler, F. Dressler, C. Sommer, in: 2015 IEEE Vehicular Networking Conference (VNC), 2016.","chicago":"Klingler, Florian, Falko Dressler, and Christoph Sommer. “IEEE 802.11p Unicast Considered Harmful.” In <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016. <a href=\"https://doi.org/10.1109/vnc.2015.7385550\">https://doi.org/10.1109/vnc.2015.7385550</a>.","ieee":"F. Klingler, F. Dressler, and C. Sommer, “IEEE 802.11p unicast considered harmful,” in <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016.","ama":"Klingler F, Dressler F, Sommer C. IEEE 802.11p unicast considered harmful. In: <i>2015 IEEE Vehicular Networking Conference (VNC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/vnc.2015.7385550\">10.1109/vnc.2015.7385550</a>"},"year":"2016","date_created":"2019-07-18T09:54:00Z","author":[{"first_name":"Florian","last_name":"Klingler","full_name":"Klingler, Florian"},{"first_name":"Falko","last_name":"Dressler","full_name":"Dressler, Falko"},{"first_name":"Christoph","last_name":"Sommer","orcid":"0000-0002-4336-7350","id":"49154","full_name":"Sommer, Christoph"}],"date_updated":"2022-01-06T06:51:16Z","doi":"10.1109/vnc.2015.7385550","title":"IEEE 802.11p unicast considered harmful"},{"user_id":"49154","department":[{"_id":"589"}],"_id":"12039","language":[{"iso":"eng"}],"type":"conference","publication":"2015 IEEE Vehicular Networking Conference (VNC)","status":"public","author":[{"first_name":"Agon","last_name":"Memedi","full_name":"Memedi, Agon"},{"full_name":"Hagenauer, Florian","last_name":"Hagenauer","first_name":"Florian"},{"full_name":"Dressler, Falko","last_name":"Dressler","first_name":"Falko"},{"first_name":"Christoph","id":"49154","full_name":"Sommer, Christoph","orcid":"0000-0002-4336-7350","last_name":"Sommer"}],"date_created":"2019-07-18T09:54:27Z","date_updated":"2022-01-06T06:51:16Z","doi":"10.1109/vnc.2015.7385547","title":"Cluster-based transmit power control in heterogeneous vehicular networks","publication_status":"published","publication_identifier":{"isbn":["9781467394116"]},"citation":{"ieee":"A. Memedi, F. Hagenauer, F. Dressler, and C. Sommer, “Cluster-based transmit power control in heterogeneous vehicular networks,” in <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016.","chicago":"Memedi, Agon, Florian Hagenauer, Falko Dressler, and Christoph Sommer. “Cluster-Based Transmit Power Control in Heterogeneous Vehicular Networks.” In <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016. <a href=\"https://doi.org/10.1109/vnc.2015.7385547\">https://doi.org/10.1109/vnc.2015.7385547</a>.","ama":"Memedi A, Hagenauer F, Dressler F, Sommer C. Cluster-based transmit power control in heterogeneous vehicular networks. In: <i>2015 IEEE Vehicular Networking Conference (VNC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/vnc.2015.7385547\">10.1109/vnc.2015.7385547</a>","apa":"Memedi, A., Hagenauer, F., Dressler, F., &#38; Sommer, C. (2016). Cluster-based transmit power control in heterogeneous vehicular networks. In <i>2015 IEEE Vehicular Networking Conference (VNC)</i>. <a href=\"https://doi.org/10.1109/vnc.2015.7385547\">https://doi.org/10.1109/vnc.2015.7385547</a>","mla":"Memedi, Agon, et al. “Cluster-Based Transmit Power Control in Heterogeneous Vehicular Networks.” <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/vnc.2015.7385547\">10.1109/vnc.2015.7385547</a>.","short":"A. Memedi, F. Hagenauer, F. Dressler, C. Sommer, in: 2015 IEEE Vehicular Networking Conference (VNC), 2016.","bibtex":"@inproceedings{Memedi_Hagenauer_Dressler_Sommer_2016, title={Cluster-based transmit power control in heterogeneous vehicular networks}, DOI={<a href=\"https://doi.org/10.1109/vnc.2015.7385547\">10.1109/vnc.2015.7385547</a>}, booktitle={2015 IEEE Vehicular Networking Conference (VNC)}, author={Memedi, Agon and Hagenauer, Florian and Dressler, Falko and Sommer, Christoph}, year={2016} }"},"year":"2016"},{"editor":[{"first_name":"Peter R.","last_name":"Lewis","full_name":"Lewis, Peter R."},{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"},{"last_name":"Rinner","full_name":"Rinner, Bernhard","first_name":"Bernhard"},{"first_name":"Jim","last_name":"Tørresen","full_name":"Tørresen, Jim"},{"first_name":"Xin","last_name":"Yao","full_name":"Yao, Xin"}],"abstract":[{"lang":"eng","text":"Taking inspiration from self-awareness in humans, this book introduces the new notion of computational self-awareness as a fundamental concept for designing and operating computing systems. The basic ability of such self-aware computing systems is to collect information about their state and progress, learning and maintaining models containing knowledge that enables them to reason about their behaviour. Self-aware computing systems will have the ability to utilise this knowledge to effectively and autonomously adapt and explain their behaviour, in changing conditions. This book addresses these fundamental concepts from an engineering perspective, aiming at developing primitives for building systems and applications. It will be of value to researchers, professionals and graduate students in computer science and engineering."}],"status":"public","type":"book_editor","language":[{"iso":"eng"}],"_id":"12972","user_id":"398","department":[{"_id":"78"}],"place":"Cham","year":"2016","citation":{"ama":"Lewis PR, Platzner M, Rinner B, Tørresen J, Yao X, eds. <i>Self-Aware Computing Systems: An Engineering Approach</i>. Cham: Springer; 2016. doi:<a href=\"https://doi.org/10.1007/978-3-319-39675-0\">10.1007/978-3-319-39675-0</a>","chicago":"Lewis, Peter R., Marco Platzner, Bernhard Rinner, Jim Tørresen, and Xin Yao, eds. <i>Self-Aware Computing Systems: An Engineering Approach</i>. Cham: Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39675-0\">https://doi.org/10.1007/978-3-319-39675-0</a>.","ieee":"P. R. Lewis, M. Platzner, B. Rinner, J. Tørresen, and X. Yao, Eds., <i>Self-aware Computing Systems: An Engineering Approach</i>. Cham: Springer, 2016.","apa":"Lewis, P. R., Platzner, M., Rinner, B., Tørresen, J., &#38; Yao, X. (Eds.). (2016). <i>Self-aware Computing Systems: An Engineering Approach</i>. Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-319-39675-0\">https://doi.org/10.1007/978-3-319-39675-0</a>","mla":"Lewis, Peter R., et al., editors. <i>Self-Aware Computing Systems: An Engineering Approach</i>. Springer, 2016, doi:<a href=\"https://doi.org/10.1007/978-3-319-39675-0\">10.1007/978-3-319-39675-0</a>.","bibtex":"@book{Lewis_Platzner_Rinner_Tørresen_Yao_2016, place={Cham}, title={Self-aware Computing Systems: An Engineering Approach}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-39675-0\">10.1007/978-3-319-39675-0</a>}, publisher={Springer}, year={2016} }","short":"P.R. Lewis, M. Platzner, B. Rinner, J. Tørresen, X. Yao, eds., Self-Aware Computing Systems: An Engineering Approach, Springer, Cham, 2016."},"publication_status":"published","publication_identifier":{"issn":["1619-7127"],"isbn":["9783319396743","9783319396750"]},"title":"Self-aware Computing Systems: An Engineering Approach","doi":"10.1007/978-3-319-39675-0","publisher":"Springer","date_updated":"2022-01-06T06:51:27Z","date_created":"2019-08-27T13:39:43Z"},{"date_updated":"2022-01-06T06:52:23Z","author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"volume":353,"has_accepted_license":"1","publication_identifier":{"isbn":["978-3-942647-72-4"]},"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089"}]},"citation":{"ama":"Cord-Landwehr A. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2016.","chicago":"Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","ieee":"A. Cord-Landwehr, <i>Selfish Network Creation - On Variants of Network Creation Games</i>, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","short":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","mla":"Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","bibtex":"@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Cord-Landwehr, A. (2016). <i>Selfish Network Creation - On Variants of Network Creation Games</i> (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"intvolume":"       353","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"154","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","department":[{"_id":"63"},{"_id":"26"}],"file_date_updated":"2018-03-21T12:52:03Z","type":"dissertation","status":"public","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_created":"2017-10-17T12:41:22Z","title":"Selfish Network Creation - On Variants of Network Creation Games","year":"2016","ddc":["040"],"language":[{"iso":"eng"}],"file":[{"file_size":800101,"access_level":"closed","file_id":"1551","file_name":"154-dissertation.pdf","date_updated":"2018-03-21T12:52:03Z","creator":"florida","date_created":"2018-03-21T12:52:03Z","success":1,"relation":"main_file","content_type":"application/pdf"}]},{"citation":{"mla":"Labreuche, C., et al. “On the Identifiability of Models  in Multi-Criteria Preference Learning.” <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, edited by R. Busa-Fekete et al., 2016.","bibtex":"@inproceedings{Labreuche_Hüllermeier_Vojtas_Fallah Tehrani_2016, title={On the identifiability of models  in multi-criteria preference learning}, booktitle={in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}, author={Labreuche, C. and Hüllermeier, Eyke and Vojtas, P. and Fallah Tehrani, A.}, editor={Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, KarlsonEditors}, year={2016} }","short":"C. Labreuche, E. Hüllermeier, P. Vojtas, A. Fallah Tehrani, in: R. Busa-Fekete, E. Hüllermeier, V. Mousseau, K. Pfannschmidt (Eds.), In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany, 2016.","apa":"Labreuche, C., Hüllermeier, E., Vojtas, P., &#38; Fallah Tehrani, A. (2016). On the identifiability of models  in multi-criteria preference learning. In R. Busa-Fekete, E. Hüllermeier, V. Mousseau, &#38; K. Pfannschmidt (Eds.), <i>in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>.","chicago":"Labreuche, C., Eyke Hüllermeier, P. Vojtas, and A. Fallah Tehrani. “On the Identifiability of Models  in Multi-Criteria Preference Learning.” In <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, edited by R. Busa-Fekete, Eyke Hüllermeier, V. Mousseau, and Karlson Pfannschmidt, 2016.","ieee":"C. Labreuche, E. Hüllermeier, P. Vojtas, and A. Fallah Tehrani, “On the identifiability of models  in multi-criteria preference learning,” in <i>in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, 2016.","ama":"Labreuche C, Hüllermeier E, Vojtas P, Fallah Tehrani A. On the identifiability of models  in multi-criteria preference learning. In: Busa-Fekete R, Hüllermeier E, Mousseau V, Pfannschmidt K, eds. <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>. ; 2016."},"year":"2016","date_created":"2019-12-19T16:02:19Z","author":[{"full_name":"Labreuche, C.","last_name":"Labreuche","first_name":"C."},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"},{"first_name":"P.","full_name":"Vojtas, P.","last_name":"Vojtas"},{"full_name":"Fallah Tehrani, A.","last_name":"Fallah Tehrani","first_name":"A."}],"date_updated":"2022-01-06T06:52:23Z","title":"On the identifiability of models  in multi-criteria preference learning","publication":"in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany","type":"conference","status":"public","editor":[{"first_name":"R.","last_name":"Busa-Fekete","full_name":"Busa-Fekete, R."},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"},{"last_name":"Mousseau","full_name":"Mousseau, V.","first_name":"V."},{"first_name":"Karlson","last_name":"Pfannschmidt","full_name":"Pfannschmidt, Karlson"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"user_id":"49109","_id":"15400","language":[{"iso":"eng"}]},{"type":"conference","publication":"in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany","editor":[{"first_name":"R.","last_name":"Busa-Fekete","full_name":"Busa-Fekete, R."},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"},{"first_name":"V.","last_name":"Mousseau","full_name":"Mousseau, V."},{"first_name":"Karlson","full_name":"Pfannschmidt, Karlson","last_name":"Pfannschmidt"}],"status":"public","_id":"15401","user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"language":[{"iso":"eng"}],"year":"2016","citation":{"apa":"Schäfer, D., &#38; Hüllermeier, E. (2016). Preference -based reinforcement learning using dyad ranking. In R. Busa-Fekete, E. Hüllermeier, V. Mousseau, &#38; K. Pfannschmidt (Eds.), <i>in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>.","short":"D. Schäfer, E. Hüllermeier, in: R. Busa-Fekete, E. Hüllermeier, V. Mousseau, K. Pfannschmidt (Eds.), In Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany, 2016.","mla":"Schäfer, D., and Eyke Hüllermeier. “Preference -Based Reinforcement Learning Using Dyad Ranking.” <i>In Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>, edited by R. Busa-Fekete et al., 2016.","bibtex":"@inproceedings{Schäfer_Hüllermeier_2016, title={Preference -based reinforcement learning using dyad ranking}, booktitle={in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany}, author={Schäfer, D. and Hüllermeier, Eyke}, editor={Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, KarlsonEditors}, year={2016} }","ama":"Schäfer D, Hüllermeier E. Preference -based reinforcement learning using dyad ranking. In: Busa-Fekete R, Hüllermeier E, Mousseau V, Pfannschmidt K, eds. <i>In Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>. ; 2016.","ieee":"D. Schäfer and E. Hüllermeier, “Preference -based reinforcement learning using dyad ranking,” in <i>in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>, 2016.","chicago":"Schäfer, D., and Eyke Hüllermeier. “Preference -Based Reinforcement Learning Using Dyad Ranking.” In <i>In Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>, edited by R. Busa-Fekete, Eyke Hüllermeier, V. Mousseau, and Karlson Pfannschmidt, 2016."},"date_updated":"2022-01-06T06:52:23Z","date_created":"2019-12-19T16:33:45Z","author":[{"first_name":"D.","full_name":"Schäfer, D.","last_name":"Schäfer"},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"title":"Preference -based reinforcement learning using dyad ranking"},{"author":[{"last_name":"Couso","full_name":"Couso, Ines","first_name":"Ines"},{"first_name":"Mohsen","last_name":"Ahmadi Fahandar","full_name":"Ahmadi Fahandar, Mohsen"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"}],"date_created":"2019-12-19T16:37:06Z","date_updated":"2022-01-06T06:52:23Z","title":"Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators","citation":{"bibtex":"@inproceedings{Couso_Ahmadi Fahandar_Hüllermeier_2016, title={Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators}, booktitle={in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}, author={Couso, Ines and Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, editor={Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, KarlsonEditors}, year={2016} }","short":"I. Couso, M. Ahmadi Fahandar, E. Hüllermeier, in: R. Busa-Fekete, E. Hüllermeier, V. Mousseau, K. Pfannschmidt (Eds.), In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany, 2016.","mla":"Couso, Ines, et al. “Statistical Inference for Incomplete Ranking Data: A Comparison of Two Likelihood-Based Estimators.” <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, edited by R. Busa-Fekete et al., 2016.","apa":"Couso, I., Ahmadi Fahandar, M., &#38; Hüllermeier, E. (2016). Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators. In R. Busa-Fekete, E. Hüllermeier, V. Mousseau, &#38; K. Pfannschmidt (Eds.), <i>in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>.","ieee":"I. Couso, M. Ahmadi Fahandar, and E. Hüllermeier, “Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators,” in <i>in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, 2016.","chicago":"Couso, Ines, Mohsen Ahmadi Fahandar, and Eyke Hüllermeier. “Statistical Inference for Incomplete Ranking Data: A Comparison of Two Likelihood-Based Estimators.” In <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, edited by R. Busa-Fekete, Eyke Hüllermeier, V. Mousseau, and Karlson Pfannschmidt, 2016.","ama":"Couso I, Ahmadi Fahandar M, Hüllermeier E. Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators. In: Busa-Fekete R, Hüllermeier E, Mousseau V, Pfannschmidt K, eds. <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>. ; 2016."},"year":"2016","user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"_id":"15402","language":[{"iso":"eng"}],"type":"conference","publication":"in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany","status":"public","editor":[{"full_name":"Busa-Fekete, R.","last_name":"Busa-Fekete","first_name":"R."},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"},{"first_name":"V.","last_name":"Mousseau","full_name":"Mousseau, V."},{"first_name":"Karlson","last_name":"Pfannschmidt","full_name":"Pfannschmidt, Karlson"}]},{"page":"1-8","citation":{"ama":"Lu S, Hüllermeier E. Support vector classification on noisy data using fuzzy superset losses. In: Hüllermeier E, Hoffmann F, Mikut R, eds. <i>In Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i>. KIT Scientific Publishing; 2016:1-8.","ieee":"S. Lu and E. Hüllermeier, “Support vector classification on noisy data using fuzzy superset losses,” in <i>in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i>, 2016, pp. 1–8.","chicago":"Lu, S., and Eyke Hüllermeier. “Support Vector Classification on Noisy Data Using Fuzzy Superset Losses.” In <i>In Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i>, edited by Eyke Hüllermeier, F. Hoffmann, and R. Mikut, 1–8. KIT Scientific Publishing, 2016.","apa":"Lu, S., &#38; Hüllermeier, E. (2016). Support vector classification on noisy data using fuzzy superset losses. In E. Hüllermeier, F. Hoffmann, &#38; R. Mikut (Eds.), <i>in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i> (pp. 1–8). KIT Scientific Publishing.","short":"S. Lu, E. Hüllermeier, in: E. Hüllermeier, F. Hoffmann, R. Mikut (Eds.), In Proceedings 26th Workshop Computational Intelligence, Dortmund Germany, KIT Scientific Publishing, 2016, pp. 1–8.","bibtex":"@inproceedings{Lu_Hüllermeier_2016, title={Support vector classification on noisy data using fuzzy superset losses}, booktitle={in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany}, publisher={KIT Scientific Publishing}, author={Lu, S. and Hüllermeier, Eyke}, editor={Hüllermeier, Eyke and Hoffmann, F. and Mikut, R.Editors}, year={2016}, pages={1–8} }","mla":"Lu, S., and Eyke Hüllermeier. “Support Vector Classification on Noisy Data Using Fuzzy Superset Losses.” <i>In Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i>, edited by Eyke Hüllermeier et al., KIT Scientific Publishing, 2016, pp. 1–8."},"year":"2016","title":"Support vector classification on noisy data using fuzzy superset losses","date_created":"2019-12-19T16:40:33Z","author":[{"first_name":"S.","last_name":"Lu","full_name":"Lu, S."},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"publisher":"KIT Scientific Publishing","date_updated":"2022-01-06T06:52:23Z","status":"public","editor":[{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"full_name":"Hoffmann, F.","last_name":"Hoffmann","first_name":"F."},{"first_name":"R.","full_name":"Mikut, R.","last_name":"Mikut"}],"publication":"in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"user_id":"49109","_id":"15403"},{"language":[{"iso":"eng"}],"user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"_id":"15404","status":"public","type":"conference","publication":"in Workshop LWDA \"Lernen, Wissen, Daten, Analysen\" Potsdam, Germany","title":"Plackett-Luce networks for dyad ranking","date_created":"2019-12-19T16:43:27Z","author":[{"last_name":"Schäfer","full_name":"Schäfer, D.","first_name":"D."},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"date_updated":"2022-01-06T06:52:23Z","citation":{"ieee":"D. Schäfer and E. Hüllermeier, “Plackett-Luce networks for dyad ranking,” in <i>in Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>, 2016.","chicago":"Schäfer, D., and Eyke Hüllermeier. “Plackett-Luce Networks for Dyad Ranking.” In <i>In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>, 2016.","ama":"Schäfer D, Hüllermeier E. Plackett-Luce networks for dyad ranking. In: <i>In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>. ; 2016.","apa":"Schäfer, D., &#38; Hüllermeier, E. (2016). Plackett-Luce networks for dyad ranking. In <i>in Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>.","mla":"Schäfer, D., and Eyke Hüllermeier. “Plackett-Luce Networks for Dyad Ranking.” <i>In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>, 2016.","short":"D. Schäfer, E. Hüllermeier, in: In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany, 2016.","bibtex":"@inproceedings{Schäfer_Hüllermeier_2016, title={Plackett-Luce networks for dyad ranking}, booktitle={in Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany}, author={Schäfer, D. and Hüllermeier, Eyke}, year={2016} }"},"year":"2016"},{"status":"public","type":"conference","publication":"Pedagogy Data Visualization, IEEE VIS Workshop","language":[{"iso":"eng"}],"user_id":"90","department":[{"_id":"65"}],"_id":"15435","citation":{"apa":"Domik, G. (2016). A data visualization course at the university of paderborn. In <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>. Baltimore.","mla":"Domik, Gitta. “A Data Visualization Course at the University of Paderborn.” <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>, 2016.","short":"G. Domik, in: Pedagogy Data Visualization, IEEE VIS Workshop, Baltimore, 2016.","bibtex":"@inproceedings{Domik_2016, place={Baltimore}, title={A data visualization course at the university of paderborn}, booktitle={Pedagogy Data Visualization, IEEE VIS Workshop}, author={Domik, Gitta}, year={2016} }","ama":"Domik G. A data visualization course at the university of paderborn. In: <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>. Baltimore; 2016.","ieee":"G. Domik, “A data visualization course at the university of paderborn,” in <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>, 2016.","chicago":"Domik, Gitta. “A Data Visualization Course at the University of Paderborn.” In <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>. Baltimore, 2016."},"place":"Baltimore","year":"2016","title":"A data visualization course at the university of paderborn","author":[{"full_name":"Domik, Gitta","id":"90","last_name":"Domik","first_name":"Gitta"}],"date_created":"2020-01-07T07:54:37Z","date_updated":"2022-01-06T06:52:25Z"},{"file_date_updated":"2018-03-21T12:51:24Z","ddc":["040"],"department":[{"_id":"79"}],"series_title":"LNCS","user_id":"15504","_id":"155","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":389136,"access_level":"closed","file_name":"155-SSS16-GLS.pdf","file_id":"1550","date_updated":"2018-03-21T12:51:24Z","date_created":"2018-03-21T12:51:24Z","creator":"florida"}],"abstract":[{"text":"We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.","lang":"eng"}],"publication":"Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","type":"conference","doi":"10.1007/978-3-319-49259-9_20","title":"Self-stabilizing Metric Graphs","author":[{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Jonas","last_name":"Lefèvre","full_name":"Lefèvre, Jonas"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:41:22Z","date_updated":"2022-01-06T06:52:28Z","page":"248--262","citation":{"ama":"Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2016:248--262. doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>","chicago":"Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 248--262. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>.","ieee":"R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,” in <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262.","short":"R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262.","bibtex":"@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing Metric Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>}, booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS} }","mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262, doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>.","apa":"Gmyr, R., Lefèvre, J., &#38; Scheideler, C. (2016). Self-stabilizing Metric Graphs. In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 248--262). <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>"},"year":"2016","has_accepted_license":"1"},{"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","type":"conference","abstract":[{"text":"Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees.","lang":"eng"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":753147,"access_level":"closed","file_name":"157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf","file_id":"1549","date_updated":"2018-03-21T12:50:29Z","creator":"florida","date_created":"2018-03-21T12:50:29Z"}],"_id":"157","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"series_title":"LNCS","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-21T12:50:29Z","has_accepted_license":"1","year":"2016","page":"563--577","citation":{"apa":"König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 563--577). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>.","bibtex":"@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS}, title={Scheduling with Interjob Communication on Parallel Processors}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577}, collection={LNCS} }","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577.","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob Communication on Parallel Processors. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:563--577. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 563--577. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>.","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577."},"date_updated":"2022-01-06T06:52:32Z","date_created":"2017-10-17T12:41:22Z","author":[{"first_name":"Jürgen","full_name":"König, Jürgen","last_name":"König"},{"first_name":"Alexander","id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"}],"title":"Scheduling with Interjob Communication on Parallel Processors","doi":"10.1007/978-3-319-48749-6_41"},{"publication_status":"published","publication_identifier":{"isbn":["9781467394062"]},"year":"2016","citation":{"bibtex":"@inproceedings{Boschmann_Agne_Witschen_Thombansen_Kraus_Platzner_2016, title={FPGA-based acceleration of high density myoelectric signal processing}, DOI={<a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">10.1109/reconfig.2015.7393312</a>}, booktitle={2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Boschmann, Alexander and Agne, Andreas and Witschen, Linus Matthias and Thombansen, Georg and Kraus, Florian and Platzner, Marco}, year={2016} }","mla":"Boschmann, Alexander, et al. “FPGA-Based Acceleration of High Density Myoelectric Signal Processing.” <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">10.1109/reconfig.2015.7393312</a>.","short":"A. Boschmann, A. Agne, L.M. Witschen, G. Thombansen, F. Kraus, M. Platzner, in: 2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2016.","apa":"Boschmann, A., Agne, A., Witschen, L. M., Thombansen, G., Kraus, F., &#38; Platzner, M. (2016). FPGA-based acceleration of high density myoelectric signal processing. In <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. Mexiko City, Mexiko: IEEE. <a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">https://doi.org/10.1109/reconfig.2015.7393312</a>","ama":"Boschmann A, Agne A, Witschen LM, Thombansen G, Kraus F, Platzner M. FPGA-based acceleration of high density myoelectric signal processing. In: <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">10.1109/reconfig.2015.7393312</a>","chicago":"Boschmann, Alexander, Andreas Agne, Linus Matthias Witschen, Georg Thombansen, Florian Kraus, and Marco Platzner. “FPGA-Based Acceleration of High Density Myoelectric Signal Processing.” In <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">https://doi.org/10.1109/reconfig.2015.7393312</a>.","ieee":"A. Boschmann, A. Agne, L. M. Witschen, G. Thombansen, F. Kraus, and M. Platzner, “FPGA-based acceleration of high density myoelectric signal processing,” in <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, Mexiko City, Mexiko, 2016."},"publisher":"IEEE","date_updated":"2022-01-06T06:52:38Z","date_created":"2020-02-11T07:48:56Z","author":[{"first_name":"Alexander","full_name":"Boschmann, Alexander","last_name":"Boschmann"},{"full_name":"Agne, Andreas","last_name":"Agne","first_name":"Andreas"},{"full_name":"Witschen, Linus Matthias","id":"49051","last_name":"Witschen","first_name":"Linus Matthias"},{"full_name":"Thombansen, Georg","last_name":"Thombansen","first_name":"Georg"},{"first_name":"Florian","last_name":"Kraus","full_name":"Kraus, Florian"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"title":"FPGA-based acceleration of high density myoelectric signal processing","doi":"10.1109/reconfig.2015.7393312","conference":{"location":"Mexiko City, Mexiko","name":"2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)"},"type":"conference","publication":"2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)","status":"public","_id":"15873","user_id":"49051","department":[{"_id":"78"}],"keyword":["Electromyography","Feature extraction","Delays","Hardware  Pattern recognition","Prosthetics","High definition video"],"language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"159-Harks-Hoefer-Schewior-Skopalik2016.pdf","file_id":"1547","file_size":1655309,"date_created":"2018-03-21T12:48:02Z","creator":"florida","date_updated":"2018-03-21T12:48:02Z"}],"publication":"IEEE/ACM Transactions on Networking","type":"journal_article","ddc":["040"],"file_date_updated":"2018-03-21T12:48:02Z","language":[{"iso":"eng"}],"_id":"159","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"477","year":"2016","page":"2553 - 2562","citation":{"chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4 (2016): 2553–62. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>.","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” <i>IEEE/ACM Transactions on Networking</i>, no. 4, pp. 2553–2562, 2016.","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>. 2016;(4):2553-2562. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>","mla":"Harks, Tobias, et al. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4, IEEE, 2016, pp. 2553–62, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.","bibtex":"@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With Progressive Filling}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>}, number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016}, pages={2553–2562} }","apa":"Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2016). Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>, (4), 2553–2562. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>"},"has_accepted_license":"1","issue":"4","title":"Routing Games With Progressive Filling","doi":"10.1109/TNET.2015.2468571","date_updated":"2022-01-06T06:52:40Z","publisher":"IEEE","author":[{"first_name":"Tobias","full_name":"Harks, Tobias","last_name":"Harks"},{"full_name":"Höfer, Martin","last_name":"Höfer","first_name":"Martin"},{"first_name":"Kevin","last_name":"Schewior","full_name":"Schewior, Kevin"},{"id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander"}],"date_created":"2017-10-17T12:41:23Z"}]