[{"_id":"20961","user_id":"5786","department":[{"_id":"76"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"Self-healing promises to improve the dependability of systems. In particular safety-critical systems like automotive systems are well suited application, since safe operation is required in these systems even in case of failures. Prerequisite for the improved dependability is the correct realization of the self-healing techniques. Consequently, self-healing activities should be rigorously specified and appropriately integrated with the rest of the system. In this paper, we present an approach for designing self-healing mechanisms in automotive systems. The approach contains a construction model which consist of a structural description as well as an extensive set of constraints. The constraints specify a correct system structure and are also used in the self-healing activities. We exemplify the self-healing approach using the adaptive cruise control system of modern cars.\r\n"}],"status":"public","date_updated":"2022-01-06T06:54:42Z","date_created":"2021-01-13T10:54:04Z","author":[{"first_name":"Hella","last_name":"Seebach","full_name":"Seebach, Hella"},{"full_name":"Nafz, Florian","last_name":"Nafz","first_name":"Florian"},{"orcid":"0000-0001-6141-4571","last_name":"Holtmann","full_name":"Holtmann, Jörg","id":"3875","first_name":"Jörg"},{"last_name":"Meyer","full_name":"Meyer, Jan","first_name":"Jan"},{"first_name":"Matthias","full_name":"Tichy, Matthias","last_name":"Tichy"},{"first_name":"Wolfgang","full_name":"Reif, Wolfgang","last_name":"Reif"},{"first_name":"Wilhelm","full_name":"Schäfer, Wilhelm","last_name":"Schäfer"}],"title":"Designing Self-healing in Automotive Systems","doi":"10.1007/978-3-642-16576-4_4","publication_status":"published","publication_identifier":{"isbn":["9783642165757","9783642165764"],"issn":["0302-9743","1611-3349"]},"year":"2010","place":"Berlin, Heidelberg","citation":{"ama":"Seebach H, Nafz F, Holtmann J, et al. Designing Self-healing in Automotive Systems. In: <i>Lecture Notes in Computer Science</i>. ; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">10.1007/978-3-642-16576-4_4</a>","chicago":"Seebach, Hella, Florian Nafz, Jörg Holtmann, Jan Meyer, Matthias Tichy, Wolfgang Reif, and Wilhelm Schäfer. “Designing Self-Healing in Automotive Systems.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">https://doi.org/10.1007/978-3-642-16576-4_4</a>.","ieee":"H. Seebach <i>et al.</i>, “Designing Self-healing in Automotive Systems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2010.","apa":"Seebach, H., Nafz, F., Holtmann, J., Meyer, J., Tichy, M., Reif, W., &#38; Schäfer, W. (2010). Designing Self-healing in Automotive Systems. In <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">https://doi.org/10.1007/978-3-642-16576-4_4</a>","mla":"Seebach, Hella, et al. “Designing Self-Healing in Automotive Systems.” <i>Lecture Notes in Computer Science</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">10.1007/978-3-642-16576-4_4</a>.","bibtex":"@inbook{Seebach_Nafz_Holtmann_Meyer_Tichy_Reif_Schäfer_2010, place={Berlin, Heidelberg}, title={Designing Self-healing in Automotive Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">10.1007/978-3-642-16576-4_4</a>}, booktitle={Lecture Notes in Computer Science}, author={Seebach, Hella and Nafz, Florian and Holtmann, Jörg and Meyer, Jan and Tichy, Matthias and Reif, Wolfgang and Schäfer, Wilhelm}, year={2010} }","short":"H. Seebach, F. Nafz, J. Holtmann, J. Meyer, M. Tichy, W. Reif, W. Schäfer, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2010."}},{"department":[{"_id":"63"}],"user_id":"15415","_id":"19029","language":[{"iso":"eng"}],"publication":"Workshop on Internet and Network Economics (WINE)","type":"conference","status":"public","author":[{"first_name":"Patrick","full_name":"Briest, Patrick","last_name":"Briest"},{"first_name":"Parinya","last_name":"Chalermsook","full_name":"Chalermsook, Parinya"},{"last_name":"Khanna","full_name":"Khanna, Sanjeev","first_name":"Sanjeev"},{"first_name":"Bundit","full_name":"Laekhanukit, Bundit","last_name":"Laekhanukit"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"date_created":"2020-09-04T12:01:18Z","date_updated":"2022-01-06T06:53:57Z","doi":"10.1007/978-3-642-17572-5_37","title":"Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing","publication_identifier":{"isbn":["9783642175718","9783642175725"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"apa":"Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., &#38; Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In <i>Workshop on Internet and Network Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>","short":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in: Workshop on Internet and Network Economics (WINE), 2010.","mla":"Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” <i>Workshop on Internet and Network Economics (WINE)</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>.","bibtex":"@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>}, booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}, year={2010} }","ieee":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in <i>Workshop on Internet and Network Economics (WINE)</i>, 2010.","chicago":"Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” In <i>Workshop on Internet and Network Economics (WINE)</i>, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>.","ama":"Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In: <i>Workshop on Internet and Network Economics (WINE)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>"},"year":"2010"},{"status":"public","abstract":[{"lang":"eng","text":"We present an approach for real-time rendering of complex 3D scenes consisting of millions of polygons on limited graphics hardware. In a preprocessing step, powerful hardware is used to gain fine granular global visibility information of a scene using an adaptive sampling algorithm. Additively the visual influence of each object on the eventual rendered image is estimated. This influence is used to select the most important objects to display in our approximative culling algorithm. After the visibility data is compressed to meet the storage capabilities of small devices, we achieve an interactive walkthrough of the Power Plant scene on a standard netbook with an integrated graphics chipset."}],"type":"book_chapter","publication":"Advances in Visual Computing","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16505","citation":{"ama":"Eikel B, Jähn C, Fischer M. Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>","ieee":"B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2010.","chicago":"Eikel, Benjamin, Claudius Jähn, and Matthias Fischer. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>.","bibtex":"@inbook{Eikel_Jähn_Fischer_2010, place={Berlin, Heidelberg}, title={Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>}, booktitle={Advances in Visual Computing}, author={Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias}, year={2010} }","mla":"Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” <i>Advances in Visual Computing</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>.","short":"B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.","apa":"Eikel, B., Jähn, C., &#38; Fischer, M. (2010). Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>"},"year":"2010","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"isbn":["9783642172885","9783642172892"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-642-17289-2_60","title":"Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware","author":[{"full_name":"Eikel, Benjamin","last_name":"Eikel","first_name":"Benjamin"},{"last_name":"Jähn","full_name":"Jähn, Claudius","first_name":"Claudius"},{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"}],"date_created":"2020-04-14T13:06:51Z","date_updated":"2022-01-06T06:52:52Z"},{"year":"2010","citation":{"apa":"Böttcher, S., Hartel, R., &#38; Messinger, C. (2010). Searchable Compression of Office Documents by XML Schema Subtraction. In <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i> (pp. 103–112). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">https://doi.org/10.1007/978-3-642-15684-7_9</a>","mla":"Böttcher, Stefan, et al. “Searchable Compression of Office Documents by XML Schema Subtraction.” <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i>, Springer, 2010, pp. 103–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">10.1007/978-3-642-15684-7_9</a>.","bibtex":"@inproceedings{Böttcher_Hartel_Messinger_2010, title={Searchable Compression of Office Documents by XML Schema Subtraction}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">10.1007/978-3-642-15684-7_9</a>}, booktitle={Database and XML Technologies - 7th International XML Database Symposium, XSym 2010}, publisher={Springer}, author={Böttcher, Stefan and Hartel, Rita and Messinger, Christian}, year={2010}, pages={103–112} }","short":"S. Böttcher, R. Hartel, C. Messinger, in: Database and XML Technologies - 7th International XML Database Symposium, XSym 2010, Springer, 2010, pp. 103–112.","ama":"Böttcher S, Hartel R, Messinger C. Searchable Compression of Office Documents by XML Schema Subtraction. In: <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i>. Springer; 2010:103-112. doi:<a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">10.1007/978-3-642-15684-7_9</a>","ieee":"S. Böttcher, R. Hartel, and C. Messinger, “Searchable Compression of Office Documents by XML Schema Subtraction,” in <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i>, 2010, pp. 103–112.","chicago":"Böttcher, Stefan, Rita Hartel, and Christian Messinger. “Searchable Compression of Office Documents by XML Schema Subtraction.” In <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i>, 103–12. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">https://doi.org/10.1007/978-3-642-15684-7_9</a>."},"page":"103-112","publication_status":"published","publication_identifier":{"isbn":["9783642156830","9783642156847"],"issn":["0302-9743","1611-3349"]},"title":"Searchable Compression of Office Documents by XML Schema Subtraction","doi":"10.1007/978-3-642-15684-7_9","date_updated":"2022-01-06T06:52:16Z","publisher":"Springer","author":[{"first_name":"Stefan","id":"624","full_name":"Böttcher, Stefan","last_name":"Böttcher"},{"last_name":"Hartel","full_name":"Hartel, Rita","id":"14961","first_name":"Rita"},{"full_name":"Messinger, Christian","last_name":"Messinger","first_name":"Christian"}],"date_created":"2019-11-22T08:43:42Z","status":"public","type":"conference","publication":"Database and XML Technologies - 7th International XML Database Symposium, XSym 2010","language":[{"iso":"eng"}],"_id":"15137","user_id":"14961","department":[{"_id":"69"}]},{"title":"A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots","doi":"10.1007/978-3-642-13284-1_14","date_updated":"2022-01-06T06:52:49Z","author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-02T13:56:17Z","place":"Berlin, Heidelberg","year":"2010","citation":{"apa":"Degener, B., Kempkes, B., Kling, P., &#38; Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In <i>Structural Information and Communication Complexity</i> (pp. 168–182). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>","mla":"Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” <i>Structural Information and Communication Complexity</i>, 2010, pp. 168–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>.","bibtex":"@inbook{Degener_Kempkes_Kling_Meyer auf der Heide_2010, place={Berlin, Heidelberg}, series={SIROCCO 2010}, title={A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>}, booktitle={Structural Information and Communication Complexity}, author={Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2010}, pages={168–182}, collection={SIROCCO 2010} }","short":"B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.","ieee":"B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots,” in <i>Structural Information and Communication Complexity</i>, Berlin, Heidelberg, 2010, pp. 168–182.","chicago":"Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf der Heide. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” In <i>Structural Information and Communication Complexity</i>, 168–82. SIROCCO 2010. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>.","ama":"Degener B, Kempkes B, Kling P, Meyer auf der Heide F. A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In: <i>Structural Information and Communication Complexity</i>. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>"},"page":"168-182","publication_status":"published","publication_identifier":{"isbn":["9783642132834","9783642132841"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"_id":"16365","user_id":"15415","series_title":"SIROCCO 2010","department":[{"_id":"63"}],"status":"public","type":"book_chapter","publication":"Structural Information and Communication Complexity"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16403","status":"public","editor":[{"full_name":"Abramsky, Samson","last_name":"Abramsky","first_name":"Samson"},{"first_name":"Cyril","last_name":"Gavoille","full_name":"Gavoille, Cyril"},{"first_name":"Claude","full_name":"Kirchner, Claude","last_name":"Kirchner"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Spirakis, Paul G.","last_name":"Spirakis","first_name":"Paul G."}],"type":"book_editor","doi":"10.1007/978-3-642-14162-1","title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.","date_created":"2020-04-03T12:56:30Z","date_updated":"2022-01-06T06:52:50Z","citation":{"ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010.","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>.","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>.","bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>}, year={2010} }","short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg, 2010.","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>"},"year":"2010","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783642141614","9783642141621"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-03T12:58:05Z","title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.","doi":"10.1007/978-3-642-14165-2","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642141614","9783642141621"]},"publication_status":"published","year":"2010","place":"Berlin, Heidelberg","citation":{"apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>","bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>}, year={2010} }","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>.","short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg, 2010.","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010.","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>.","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>"},"_id":"16404","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"type":"book_editor","editor":[{"first_name":"Samson","full_name":"Abramsky, Samson","last_name":"Abramsky"},{"first_name":"Cyril","last_name":"Gavoille","full_name":"Gavoille, Cyril"},{"first_name":"Claude","full_name":"Kirchner, Claude","last_name":"Kirchner"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Paul G.","last_name":"Spirakis","full_name":"Spirakis, Paul G."}],"status":"public"},{"status":"public","publication":"Practical Aspects of Knowledge Management","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"198"}],"user_id":"62809","_id":"13301","citation":{"short":"M. Trier, C. Müller, in: Practical Aspects of Knowledge Management, Berlin, Heidelberg, 2010.","mla":"Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes.” <i>Practical Aspects of Knowledge Management</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">10.1007/978-3-540-30545-3_23</a>.","bibtex":"@inbook{Trier_Müller_2010, place={Berlin, Heidelberg}, title={Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">10.1007/978-3-540-30545-3_23</a>}, booktitle={Practical Aspects of Knowledge Management}, author={Trier, Matthias and Müller, Claudia}, year={2010} }","apa":"Trier, M., &#38; Müller, C. (2010). Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes. In <i>Practical Aspects of Knowledge Management</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">https://doi.org/10.1007/978-3-540-30545-3_23</a>","ama":"Trier M, Müller C. Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes. In: <i>Practical Aspects of Knowledge Management</i>. Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">10.1007/978-3-540-30545-3_23</a>","chicago":"Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes.” In <i>Practical Aspects of Knowledge Management</i>. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">https://doi.org/10.1007/978-3-540-30545-3_23</a>.","ieee":"M. Trier and C. Müller, “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes,” in <i>Practical Aspects of Knowledge Management</i>, Berlin, Heidelberg, 2010."},"year":"2010","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540240884","9783540305453"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","doi":"10.1007/978-3-540-30545-3_23","title":"Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes","author":[{"first_name":"Matthias","last_name":"Trier","id":"72744","full_name":"Trier, Matthias"},{"full_name":"Müller, Claudia","last_name":"Müller","first_name":"Claudia"}],"date_created":"2019-09-19T09:45:04Z","date_updated":"2022-01-06T06:51:32Z"},{"title":"Complexity and Approximation of a Geometric Local Robot Assignment Problem","doi":"10.1007/978-3-642-05434-1_25","publisher":"Springer","date_updated":"2022-01-06T06:54:10Z","date_created":"2020-09-28T10:25:34Z","author":[{"last_name":"Bonorden","full_name":"Bonorden, Olaf","first_name":"Olaf"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"}],"place":"Berlin, Heidelberg","year":"2009","citation":{"chicago":"Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” In <i>Algorithmic Aspects of Wireless Sensor Networks</i>, 252–62. Berlin, Heidelberg: Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>.","ieee":"O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Berlin, Heidelberg: Springer, 2009, pp. 252–262.","ama":"Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: <i>Algorithmic Aspects of Wireless Sensor Networks</i>. Berlin, Heidelberg: Springer; 2009:252-262. doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>","short":"O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.","mla":"Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Springer, 2009, pp. 252–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>.","bibtex":"@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg}, title={Complexity and Approximation of a Geometric Local Robot Assignment Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>}, booktitle={Algorithmic Aspects of Wireless Sensor Networks}, publisher={Springer}, author={Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}, year={2009}, pages={252–262} }","apa":"Bonorden, O., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In <i>Algorithmic Aspects of Wireless Sensor Networks</i> (pp. 252–262). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>"},"page":"252-262","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642054334","9783642054341"]},"language":[{"iso":"eng"}],"_id":"19724","user_id":"15415","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\\classP$ or are $\\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\\bigO(\\log^*n)$ communication rounds."}],"status":"public","type":"book_chapter","publication":"Algorithmic Aspects of Wireless Sensor Networks"},{"department":[{"_id":"558"}],"user_id":"25078","_id":"2920","extern":"1","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","author":[{"first_name":"Saqib","last_name":"Kakvi","full_name":"Kakvi, Saqib"}],"date_created":"2018-05-25T12:38:01Z","date_updated":"2022-01-06T06:58:47Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/978-3-642-04052-8_43","title":"Reinforcement Learning for Blackjack","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642040511","9783642040528"]},"publication_status":"published","page":"300-301","citation":{"mla":"Kakvi, Saqib. “Reinforcement Learning for Blackjack.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2009, pp. 300–01, doi:<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>.","bibtex":"@inbook{Kakvi_2009, place={Berlin, Heidelberg}, title={Reinforcement Learning for Blackjack}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Kakvi, Saqib}, year={2009}, pages={300–301} }","short":"S. Kakvi, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 300–301.","apa":"Kakvi, S. (2009). Reinforcement Learning for Blackjack. In <i>Lecture Notes in Computer Science</i> (pp. 300–301). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">https://doi.org/10.1007/978-3-642-04052-8_43</a>","chicago":"Kakvi, Saqib. “Reinforcement Learning for Blackjack.” In <i>Lecture Notes in Computer Science</i>, 300–301. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">https://doi.org/10.1007/978-3-642-04052-8_43</a>.","ieee":"S. Kakvi, “Reinforcement Learning for Blackjack,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 300–301.","ama":"Kakvi S. Reinforcement Learning for Blackjack. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:300-301. doi:<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>"},"place":"Berlin, Heidelberg","year":"2009"},{"page":"106-122","citation":{"chicago":"Schrieb, Jonas, Heike Wehrheim, and Daniel Wonisch. “Three-Valued Spotlight Abstractions.” In <i>FM 2009: Formal Methods</i>, 106–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05089-3_8\">https://doi.org/10.1007/978-3-642-05089-3_8</a>.","ieee":"J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in <i>FM 2009: Formal Methods</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.","ama":"Schrieb J, Wehrheim H, Wonisch D. Three-Valued Spotlight Abstractions. In: <i>FM 2009: Formal Methods</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:106-122. doi:<a href=\"https://doi.org/10.1007/978-3-642-05089-3_8\">10.1007/978-3-642-05089-3_8</a>","apa":"Schrieb, J., Wehrheim, H., &#38; Wonisch, D. (2009). Three-Valued Spotlight Abstractions. In <i>FM 2009: Formal Methods</i> (pp. 106–122). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-05089-3_8\">https://doi.org/10.1007/978-3-642-05089-3_8</a>","short":"J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 106–122.","bibtex":"@inbook{Schrieb_Wehrheim_Wonisch_2009, place={Berlin, Heidelberg}, title={Three-Valued Spotlight Abstractions}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05089-3_8\">10.1007/978-3-642-05089-3_8</a>}, booktitle={FM 2009: Formal Methods}, publisher={Springer Berlin Heidelberg}, author={Schrieb, Jonas and Wehrheim, Heike and Wonisch, Daniel}, year={2009}, pages={106–122} }","mla":"Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.” <i>FM 2009: Formal Methods</i>, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:<a href=\"https://doi.org/10.1007/978-3-642-05089-3_8\">10.1007/978-3-642-05089-3_8</a>."},"place":"Berlin, Heidelberg","year":"2009","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642050886","9783642050893"]},"publication_status":"published","doi":"10.1007/978-3-642-05089-3_8","title":"Three-Valued Spotlight Abstractions","author":[{"full_name":"Schrieb, Jonas","last_name":"Schrieb","first_name":"Jonas"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"},{"first_name":"Daniel","full_name":"Wonisch, Daniel","last_name":"Wonisch"}],"date_created":"2018-06-05T08:09:11Z","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:50Z","status":"public","publication":"FM 2009: Formal Methods","type":"book_chapter","department":[{"_id":"64"}],"user_id":"25078","_id":"3000"},{"doi":"10.1007/978-3-642-10841-9_6","title":"On Stackelberg Pricing with Computationally Bounded Consumers","author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"first_name":"Martin","last_name":"Hoefer","full_name":"Hoefer, Martin"},{"last_name":"Gualà","full_name":"Gualà, Luciano","first_name":"Luciano"},{"full_name":"Ventre, Carmine","last_name":"Ventre","first_name":"Carmine"}],"date_created":"2021-09-03T10:55:38Z","date_updated":"2022-01-06T06:55:59Z","citation":{"ama":"Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally Bounded Consumers. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2009. doi:<a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">10.1007/978-3-642-10841-9_6</a>","ieee":"P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with Computationally Bounded Consumers,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2009.","chicago":"Briest, Patrick, Martin Hoefer, Luciano Gualà, and Carmine Ventre. “On Stackelberg Pricing with Computationally Bounded Consumers.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">https://doi.org/10.1007/978-3-642-10841-9_6</a>.","apa":"Briest, P., Hoefer, M., Gualà, L., &#38; Ventre, C. (2009). On Stackelberg Pricing with Computationally Bounded Consumers. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">https://doi.org/10.1007/978-3-642-10841-9_6</a>","short":"P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.","bibtex":"@inbook{Briest_Hoefer_Gualà_Ventre_2009, place={Berlin, Heidelberg}, title={On Stackelberg Pricing with Computationally Bounded Consumers}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">10.1007/978-3-642-10841-9_6</a>}, booktitle={Lecture Notes in Computer Science}, author={Briest, Patrick and Hoefer, Martin and Gualà, Luciano and Ventre, Carmine}, year={2009} }","mla":"Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded Consumers.” <i>Lecture Notes in Computer Science</i>, 2009, doi:<a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">10.1007/978-3-642-10841-9_6</a>."},"place":"Berlin, Heidelberg","year":"2009","publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"23744","status":"public","abstract":[{"lang":"eng","text":"In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability.\r\n\r\nWe consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3."}],"publication":"Lecture Notes in Computer Science","type":"book_chapter"},{"type":"book_chapter","publication":"NETWORKING 2009","status":"public","_id":"1830","user_id":"15572","department":[{"_id":"75"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642013980","9783642013997"]},"year":"2009","place":"Berlin, Heidelberg","citation":{"chicago":"Biermann, Thorsten, Arne Schwabe, and Holger Karl. “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE.” In <i>NETWORKING 2009</i>, 883–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-01399-7_69\">https://doi.org/10.1007/978-3-642-01399-7_69</a>.","ieee":"T. Biermann, A. Schwabe, and H. Karl, “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE,” in <i>NETWORKING 2009</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 883–894.","ama":"Biermann T, Schwabe A, Karl H. Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE. In: <i>NETWORKING 2009</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:883-894. doi:<a href=\"https://doi.org/10.1007/978-3-642-01399-7_69\">10.1007/978-3-642-01399-7_69</a>","apa":"Biermann, T., Schwabe, A., &#38; Karl, H. (2009). Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE. In <i>NETWORKING 2009</i> (pp. 883–894). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-01399-7_69\">https://doi.org/10.1007/978-3-642-01399-7_69</a>","mla":"Biermann, Thorsten, et al. “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE.” <i>NETWORKING 2009</i>, Springer Berlin Heidelberg, 2009, pp. 883–94, doi:<a href=\"https://doi.org/10.1007/978-3-642-01399-7_69\">10.1007/978-3-642-01399-7_69</a>.","bibtex":"@inbook{Biermann_Schwabe_Karl_2009, place={Berlin, Heidelberg}, title={Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-01399-7_69\">10.1007/978-3-642-01399-7_69</a>}, booktitle={NETWORKING 2009}, publisher={Springer Berlin Heidelberg}, author={Biermann, Thorsten and Schwabe, Arne and Karl, Holger}, year={2009}, pages={883–894} }","short":"T. Biermann, A. Schwabe, H. Karl, in: NETWORKING 2009, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 883–894."},"page":"883-894","date_updated":"2022-01-06T06:53:28Z","publisher":"Springer Berlin Heidelberg","author":[{"first_name":"Thorsten","last_name":"Biermann","full_name":"Biermann, Thorsten"},{"last_name":"Schwabe","full_name":"Schwabe, Arne","first_name":"Arne"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_created":"2018-03-27T12:31:37Z","title":"Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE","doi":"10.1007/978-3-642-01399-7_69"},{"publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","_id":"9616","department":[{"_id":"558"}],"user_id":"66268","language":[{"iso":"eng"}],"extern":"1","publication_identifier":{"isbn":["9783642040511","9783642040528"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2009","citation":{"apa":"Kakvi, S. (2009). Reinforcement Learning for Blackjack. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">https://doi.org/10.1007/978-3-642-04052-8_43</a>","mla":"Kakvi, Saqib. “Reinforcement Learning for Blackjack.” <i>Lecture Notes in Computer Science</i>, 2009, doi:<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>.","bibtex":"@inbook{Kakvi_2009, place={Berlin, Heidelberg}, title={Reinforcement Learning for Blackjack}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>}, booktitle={Lecture Notes in Computer Science}, author={Kakvi, Saqib}, year={2009} }","short":"S. Kakvi, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.","ama":"Kakvi S. Reinforcement Learning for Blackjack. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2009. doi:<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>","chicago":"Kakvi, Saqib. “Reinforcement Learning for Blackjack.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">https://doi.org/10.1007/978-3-642-04052-8_43</a>.","ieee":"S. Kakvi, “Reinforcement Learning for Blackjack,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2009."},"date_updated":"2022-01-06T07:04:17Z","date_created":"2019-05-06T09:54:39Z","author":[{"first_name":"Saqib","last_name":"Kakvi","full_name":"Kakvi, Saqib","id":"66268"}],"title":"Reinforcement Learning for Blackjack","doi":"10.1007/978-3-642-04052-8_43"},{"editor":[{"first_name":"Bärbel","full_name":"Mertsching, Bärbel","last_name":"Mertsching"},{"first_name":"Marcus","id":"238","full_name":"Hund, Marcus","last_name":"Hund"},{"last_name":"Aziz","full_name":"Aziz, Zaheer","first_name":"Zaheer"}],"status":"public","type":"conference_editor","alternative_title":["32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009. Proceedings"],"language":[{"iso":"eng"}],"_id":"61021","user_id":"238","department":[{"_id":"50"}],"place":"Berlin, Heidelberg","year":"2009","citation":{"chicago":"Mertsching, Bärbel, Marcus Hund, and Zaheer Aziz, eds. <i>KI 2009: Advances in Artificial Intelligence</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04617-9\">https://doi.org/10.1007/978-3-642-04617-9</a>.","ieee":"B. Mertsching, M. Hund, and Z. Aziz, Eds., <i>KI 2009: Advances in Artificial Intelligence</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.","ama":"Mertsching B, Hund M, Aziz Z, eds. <i>KI 2009: Advances in Artificial Intelligence</i>. Springer Berlin Heidelberg; 2009. doi:<a href=\"https://doi.org/10.1007/978-3-642-04617-9\">10.1007/978-3-642-04617-9</a>","mla":"Mertsching, Bärbel, et al., editors. <i>KI 2009: Advances in Artificial Intelligence</i>. Springer Berlin Heidelberg, 2009, doi:<a href=\"https://doi.org/10.1007/978-3-642-04617-9\">10.1007/978-3-642-04617-9</a>.","short":"B. Mertsching, M. Hund, Z. Aziz, eds., KI 2009: Advances in Artificial Intelligence, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.","bibtex":"@book{Mertsching_Hund_Aziz_2009, place={Berlin, Heidelberg}, title={KI 2009: Advances in Artificial Intelligence}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-04617-9\">10.1007/978-3-642-04617-9</a>}, publisher={Springer Berlin Heidelberg}, year={2009} }","apa":"Mertsching, B., Hund, M., &#38; Aziz, Z. (Eds.). (2009). <i>KI 2009: Advances in Artificial Intelligence</i>. Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-04617-9\">https://doi.org/10.1007/978-3-642-04617-9</a>"},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642046162","9783642046179"]},"title":"KI 2009: Advances in Artificial Intelligence","doi":"10.1007/978-3-642-04617-9","conference":{"name":"KI 2009"},"publisher":"Springer Berlin Heidelberg","date_updated":"2025-08-26T13:59:56Z","date_created":"2025-08-26T11:28:37Z"},{"_id":"19686","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)","status":"public","date_updated":"2022-01-06T06:54:10Z","author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"}],"date_created":"2020-09-25T09:45:40Z","title":"Uniform Budgets and the Envy-Free Pricing Problem","doi":"10.1007/978-3-540-70575-8_66","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540705741","9783540705758"]},"year":"2008","citation":{"bibtex":"@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">10.1007/978-3-540-70575-8_66</a>}, booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }","mla":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">10.1007/978-3-540-70575-8_66</a>.","short":"P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.","apa":"Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>. <a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">https://doi.org/10.1007/978-3-540-70575-8_66</a>","ama":"Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>. ; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">10.1007/978-3-540-70575-8_66</a>","ieee":"P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>, 2008.","chicago":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>, 2008. <a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">https://doi.org/10.1007/978-3-540-70575-8_66</a>."}},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540699002","9783540699033"]},"year":"2008","citation":{"ama":"Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem. In: <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>. ; 2008:378-389. doi:<a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">10.1007/978-3-540-69903-3_34</a>","ieee":"B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location Problem,” in <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>, 2008, pp. 378–389.","chicago":"Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “The Kinetic Facility Location Problem.” In <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>, 378–89, 2008. <a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">https://doi.org/10.1007/978-3-540-69903-3_34</a>.","bibtex":"@inproceedings{Degener_Gehweiler_Lammersen_2008, title={The Kinetic Facility Location Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">10.1007/978-3-540-69903-3_34</a>}, booktitle={Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)}, author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2008}, pages={378–389} }","mla":"Degener, Bastian, et al. “The Kinetic Facility Location Problem.” <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>, 2008, pp. 378–89, doi:<a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">10.1007/978-3-540-69903-3_34</a>.","short":"B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.","apa":"Degener, B., Gehweiler, J., &#38; Lammersen, C. (2008). The Kinetic Facility Location Problem. In <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i> (pp. 378–389). <a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">https://doi.org/10.1007/978-3-540-69903-3_34</a>"},"page":"378-389","date_updated":"2022-01-06T06:53:57Z","date_created":"2020-09-04T10:04:49Z","author":[{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"first_name":"Joachim","full_name":"Gehweiler, Joachim","last_name":"Gehweiler"},{"first_name":"Christiane","full_name":"Lammersen, Christiane","last_name":"Lammersen"}],"title":"The Kinetic Facility Location Problem","doi":"10.1007/978-3-540-69903-3_34","type":"conference","publication":"Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)","status":"public","_id":"19003","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"status":"public","publication":"The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)","type":"conference","language":[{"iso":"eng"}],"_id":"20367","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","year":"2008","page":"447--456","intvolume":"      5040","citation":{"ama":"Hamann H, Wörn H. Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In: <i>The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>. Vol 5040. ; 2008:447--456. doi:<a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">10.1007/978-3-540-69134-1_44</a>","chicago":"Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.” In <i>The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>, 5040:447--456, 2008. <a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">https://doi.org/10.1007/978-3-540-69134-1_44</a>.","ieee":"H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem,” in <i>The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>, 2008, vol. 5040, pp. 447--456.","bibtex":"@inproceedings{Hamann_Wörn_2008, title={Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem}, volume={5040}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">10.1007/978-3-540-69134-1_44</a>}, booktitle={The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)}, author={Hamann, Heiko and Wörn, Heinz}, year={2008}, pages={447--456} }","short":"H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, pp. 447--456.","mla":"Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.” <i>The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>, vol. 5040, 2008, pp. 447--456, doi:<a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">10.1007/978-3-540-69134-1_44</a>.","apa":"Hamann, H., &#38; Wörn, H. (2008). Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In <i>The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i> (Vol. 5040, pp. 447--456). <a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">https://doi.org/10.1007/978-3-540-69134-1_44</a>"},"publication_identifier":{"isbn":["9783540691334","9783540691341"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","title":"Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem","doi":"10.1007/978-3-540-69134-1_44","date_updated":"2022-01-06T06:54:26Z","volume":5040,"date_created":"2020-11-16T13:55:39Z","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Wörn","full_name":"Wörn, Heinz","first_name":"Heinz"}]},{"title":"On Faster Integer Calculations Using Non-arithmetic Primitives","doi":"10.1007/978-3-540-85194-3_11","date_updated":"2022-01-06T06:53:24Z","author":[{"first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina","last_name":"Lürwer-Brüggemeier"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_created":"2020-08-14T13:19:24Z","year":"2008","place":"Berlin, Heidelberg","citation":{"short":"K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin, Heidelberg, 2008.","bibtex":"@inbook{Lürwer-Brüggemeier_Ziegler_2008, place={Berlin, Heidelberg}, title={On Faster Integer Calculations Using Non-arithmetic Primitives}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>}, booktitle={Unconventional Computing}, author={Lürwer-Brüggemeier, Katharina and Ziegler, Martin}, year={2008} }","mla":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” <i>Unconventional Computing</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>.","apa":"Lürwer-Brüggemeier, K., &#38; Ziegler, M. (2008). On Faster Integer Calculations Using Non-arithmetic Primitives. In <i>Unconventional Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">https://doi.org/10.1007/978-3-540-85194-3_11</a>","ieee":"K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using Non-arithmetic Primitives,” in <i>Unconventional Computing</i>, Berlin, Heidelberg, 2008.","chicago":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” In <i>Unconventional Computing</i>. Berlin, Heidelberg, 2008. <a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">https://doi.org/10.1007/978-3-540-85194-3_11</a>.","ama":"Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic Primitives. In: <i>Unconventional Computing</i>. Berlin, Heidelberg; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540851936","9783540851943"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"17978","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Unconventional Computing","type":"book_chapter"},{"publication":"Lecture Notes in Computer Science","type":"conference","status":"public","abstract":[{"text":"We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource.\r\nBasing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm.\r\n","lang":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"24276","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"short":"M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.","bibtex":"@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg}, title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>}, booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and Kutyłowski, Jarosław}, year={2007} }","mla":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” <i>Lecture Notes in Computer Science</i>, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>.","apa":"Bienkowski, M., &#38; Kutyłowski, J. (2007). The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">https://doi.org/10.1007/978-3-540-73951-7_30</a>","ieee":"M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,” 2007, doi: <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>.","chicago":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">https://doi.org/10.1007/978-3-540-73951-7_30</a>.","ama":"Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. In: <i>Lecture Notes in Computer Science</i>. ; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>"},"year":"2007","place":"Berlin, Heidelberg","date_created":"2021-09-13T13:07:57Z","author":[{"first_name":"Marcin","full_name":"Bienkowski, Marcin","last_name":"Bienkowski"},{"first_name":"Jarosław","full_name":"Kutyłowski, Jarosław","last_name":"Kutyłowski"}],"date_updated":"2022-01-06T06:56:13Z","doi":"10.1007/978-3-540-73951-7_30","title":"The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces"}]