---
_id: '20961'
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"
author:
- first_name: Hella
  full_name: Seebach, Hella
  last_name: Seebach
- first_name: Florian
  full_name: Nafz, Florian
  last_name: Nafz
- first_name: Jörg
  full_name: Holtmann, Jörg
  id: '3875'
  last_name: Holtmann
  orcid: 0000-0001-6141-4571
- first_name: Jan
  full_name: Meyer, Jan
  last_name: Meyer
- 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
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>'
  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>
  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} }'
  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.
  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>.
  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.'
date_created: 2021-01-13T10:54:04Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '76'
doi: 10.1007/978-3-642-16576-4_4
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783642165757'
  - '9783642165764'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Designing Self-healing in Automotive Systems
type: book_chapter
user_id: '5786'
year: '2010'
...
---
_id: '19029'
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
- first_name: Parinya
  full_name: Chalermsook, Parinya
  last_name: Chalermsook
- first_name: Sanjeev
  full_name: Khanna, Sanjeev
  last_name: Khanna
- first_name: Bundit
  full_name: Laekhanukit, Bundit
  last_name: Laekhanukit
- first_name: Danupon
  full_name: Nanongkai, Danupon
  last_name: Nanongkai
citation:
  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>'
  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>
  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} }'
  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>.
  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.
  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>.
  short: 'P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in:
    Workshop on Internet and Network Economics (WINE), 2010.'
date_created: 2020-09-04T12:01:18Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/978-3-642-17572-5_37
language:
- iso: eng
publication: Workshop on Internet and Network Economics (WINE)
publication_identifier:
  isbn:
  - '9783642175718'
  - '9783642175725'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '16505'
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.
author:
- first_name: Benjamin
  full_name: Eikel, Benjamin
  last_name: Eikel
- first_name: Claudius
  full_name: Jähn, Claudius
  last_name: Jähn
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
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>'
  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>
  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} }'
  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>.
  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.
  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.'
date_created: 2020-04-14T13:06:51Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/978-3-642-17289-2_60
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
  isbn:
  - '9783642172885'
  - '9783642172892'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '15137'
author:
- first_name: Stefan
  full_name: Böttcher, Stefan
  id: '624'
  last_name: Böttcher
- first_name: Rita
  full_name: Hartel, Rita
  id: '14961'
  last_name: Hartel
- first_name: Christian
  full_name: Messinger, Christian
  last_name: Messinger
citation:
  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>'
  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>
  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} }'
  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>.
  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.
  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>.
  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.'
date_created: 2019-11-22T08:43:42Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '69'
doi: 10.1007/978-3-642-15684-7_9
language:
- iso: eng
page: 103-112
publication: Database and XML Technologies - 7th International XML Database Symposium,
  XSym 2010
publication_identifier:
  isbn:
  - '9783642156830'
  - '9783642156847'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Searchable Compression of Office Documents by XML Schema Subtraction
type: conference
user_id: '14961'
year: '2010'
...
---
_id: '16365'
author:
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Barbara
  full_name: Kempkes, Barbara
  last_name: Kempkes
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  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>'
  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>
  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} }'
  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>.
  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.
  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>.
  short: 'B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural
    Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.'
date_created: 2020-04-02T13:56:17Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1007/978-3-642-13284-1_14
language:
- iso: eng
page: 168-182
place: Berlin, Heidelberg
publication: Structural Information and Communication Complexity
publication_identifier:
  isbn:
  - '9783642132834'
  - '9783642132841'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
series_title: SIROCCO 2010
status: public
title: A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '16403'
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>
  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>
  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} }'
  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>.
  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.
  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>.
  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.
date_created: 2020-04-03T12:56:30Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-14162-1
editor:
- first_name: Samson
  full_name: Abramsky, Samson
  last_name: Abramsky
- first_name: Cyril
  full_name: Gavoille, Cyril
  last_name: Gavoille
- first_name: Claude
  full_name: Kirchner, Claude
  last_name: Kirchner
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Paul G.
  full_name: Spirakis, Paul G.
  last_name: Spirakis
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
  isbn:
  - '9783642141614'
  - '9783642141621'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
  Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
type: book_editor
user_id: '15415'
year: '2010'
...
---
_id: '16404'
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 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>
  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} }'
  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>.
  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.
  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.
date_created: 2020-04-03T12:58:05Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-14165-2
editor:
- first_name: Samson
  full_name: Abramsky, Samson
  last_name: Abramsky
- first_name: Cyril
  full_name: Gavoille, Cyril
  last_name: Gavoille
- first_name: Claude
  full_name: Kirchner, Claude
  last_name: Kirchner
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Paul G.
  full_name: Spirakis, Paul G.
  last_name: Spirakis
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
  isbn:
  - '9783642141614'
  - '9783642141621'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
  Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
type: book_editor
user_id: '15415'
year: '2010'
...
---
_id: '13301'
author:
- first_name: Matthias
  full_name: Trier, Matthias
  id: '72744'
  last_name: Trier
- first_name: Claudia
  full_name: Müller, Claudia
  last_name: Müller
citation:
  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>'
  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>
  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} }'
  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.
  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>.
  short: 'M. Trier, C. Müller, in: Practical Aspects of Knowledge Management, Berlin,
    Heidelberg, 2010.'
date_created: 2019-09-19T09:45:04Z
date_updated: 2022-01-06T06:51:32Z
department:
- _id: '198'
doi: 10.1007/978-3-540-30545-3_23
language:
- iso: eng
place: Berlin, Heidelberg
publication: Practical Aspects of Knowledge Management
publication_identifier:
  isbn:
  - '9783540240884'
  - '9783540305453'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes
type: book_chapter
user_id: '62809'
year: '2010'
...
---
_id: '19724'
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.
author:
- first_name: Olaf
  full_name: Bonorden, Olaf
  last_name: Bonorden
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Barbara
  full_name: Kempkes, Barbara
  last_name: Kempkes
- first_name: Peter
  full_name: Pietrzyk, Peter
  last_name: Pietrzyk
citation:
  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>'
  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>'
  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} }'
  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.'
  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>.
  short: 'O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects
    of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.'
date_created: 2020-09-28T10:25:34Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-642-05434-1_25
language:
- iso: eng
page: 252-262
place: Berlin, Heidelberg
publication: Algorithmic Aspects of Wireless Sensor Networks
publication_identifier:
  isbn:
  - '9783642054334'
  - '9783642054341'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Complexity and Approximation of a Geometric Local Robot Assignment Problem
type: book_chapter
user_id: '15415'
year: '2009'
...
---
_id: '2920'
author:
- first_name: Saqib
  full_name: Kakvi, Saqib
  last_name: Kakvi
citation:
  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>'
  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>'
  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} }'
  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.'
  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>.
  short: 'S. Kakvi, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2009, pp. 300–301.'
date_created: 2018-05-25T12:38:01Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-642-04052-8_43
extern: '1'
page: 300-301
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783642040511'
  - '9783642040528'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Reinforcement Learning for Blackjack
type: book_chapter
user_id: '25078'
year: '2009'
...
---
_id: '3000'
author:
- first_name: Jonas
  full_name: Schrieb, Jonas
  last_name: Schrieb
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: Daniel
  full_name: Wonisch, Daniel
  last_name: Wonisch
citation:
  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>'
  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} }'
  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.'
  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>.'
  short: 'J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer
    Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 106–122.'
date_created: 2018-06-05T08:09:11Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-642-05089-3_8
page: 106-122
place: Berlin, Heidelberg
publication: 'FM 2009: Formal Methods'
publication_identifier:
  isbn:
  - '9783642050886'
  - '9783642050893'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Three-Valued Spotlight Abstractions
type: book_chapter
user_id: '25078'
year: '2009'
...
---
_id: '23744'
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."
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
- first_name: Martin
  full_name: Hoefer, Martin
  last_name: Hoefer
- first_name: Luciano
  full_name: Gualà, Luciano
  last_name: Gualà
- first_name: Carmine
  full_name: Ventre, Carmine
  last_name: Ventre
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>'
  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>
  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} }'
  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>.
  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.
  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>.
  short: 'P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer
    Science, Berlin, Heidelberg, 2009.'
date_created: 2021-09-03T10:55:38Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
doi: 10.1007/978-3-642-10841-9_6
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: On Stackelberg Pricing with Computationally Bounded Consumers
type: book_chapter
user_id: '15415'
year: '2009'
...
---
_id: '1830'
author:
- first_name: Thorsten
  full_name: Biermann, Thorsten
  last_name: Biermann
- first_name: Arne
  full_name: Schwabe, Arne
  last_name: Schwabe
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  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>'
  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} }'
  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.'
  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>.
  short: 'T. Biermann, A. Schwabe, H. Karl, in: NETWORKING 2009, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2009, pp. 883–894.'
date_created: 2018-03-27T12:31:37Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '75'
doi: 10.1007/978-3-642-01399-7_69
page: 883-894
place: Berlin, Heidelberg
publication: NETWORKING 2009
publication_identifier:
  isbn:
  - '9783642013980'
  - '9783642013997'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE
type: book_chapter
user_id: '15572'
year: '2009'
...
---
_id: '9616'
author:
- first_name: Saqib
  full_name: Kakvi, Saqib
  id: '66268'
  last_name: Kakvi
citation:
  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>'
  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>
  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}
    }'
  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.
  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>.
  short: 'S. Kakvi, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.'
date_created: 2019-05-06T09:54:39Z
date_updated: 2022-01-06T07:04:17Z
department:
- _id: '558'
doi: 10.1007/978-3-642-04052-8_43
extern: '1'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783642040511'
  - '9783642040528'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Reinforcement Learning for Blackjack
type: book_chapter
user_id: '66268'
year: '2009'
...
---
_id: '61021'
alternative_title:
- 32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009.
  Proceedings
citation:
  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>'
  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>'
  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} }'
  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.'
  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.'
conference:
  name: KI 2009
date_created: 2025-08-26T11:28:37Z
date_updated: 2025-08-26T13:59:56Z
department:
- _id: '50'
doi: 10.1007/978-3-642-04617-9
editor:
- first_name: Bärbel
  full_name: Mertsching, Bärbel
  last_name: Mertsching
- first_name: Marcus
  full_name: Hund, Marcus
  id: '238'
  last_name: Hund
- first_name: Zaheer
  full_name: Aziz, Zaheer
  last_name: Aziz
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
  isbn:
  - '9783642046162'
  - '9783642046179'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: 'KI 2009: Advances in Artificial Intelligence'
type: conference_editor
user_id: '238'
year: '2009'
...
---
_id: '19686'
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
citation:
  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>'
  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>
  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} }'
  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>.
  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.
  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.'
date_created: 2020-09-25T09:45:40Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-540-70575-8_66
language:
- iso: eng
publication: Proceedings of the 35th InternationalColloquium on Automata, Languages
  and Programming (ICALP)
publication_identifier:
  isbn:
  - '9783540705741'
  - '9783540705758'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Uniform Budgets and the Envy-Free Pricing Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19003'
author:
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Joachim
  full_name: Gehweiler, Joachim
  last_name: Gehweiler
- first_name: Christiane
  full_name: Lammersen, Christiane
  last_name: Lammersen
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>'
  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>
  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} }'
  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>.
  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.
  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.'
date_created: 2020-09-04T10:04:49Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69903-3_34
language:
- iso: eng
page: 378-389
publication: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)
publication_identifier:
  isbn:
  - '9783540699002'
  - '9783540699033'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: The Kinetic Facility Location Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '20367'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Heinz
  full_name: Wörn, Heinz
  last_name: Wörn
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>'
  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>'
  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}
    }'
  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.'
  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>.'
  short: 'H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation
    of Adaptive Behavior (SAB’08), 2008, pp. 447--456.'
date_created: 2020-11-16T13:55:39Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-540-69134-1_44
intvolume: '      5040'
language:
- iso: eng
page: 447--456
publication: The tenth International Conference on Simulation of Adaptive Behavior
  (SAB'08)
publication_identifier:
  isbn:
  - '9783540691334'
  - '9783540691341'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: 'Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner
  Tree Problem'
type: conference
user_id: '15415'
volume: 5040
year: '2008'
...
---
_id: '17978'
author:
- first_name: Katharina
  full_name: Lürwer-Brüggemeier, Katharina
  last_name: Lürwer-Brüggemeier
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  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>'
  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>
  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} }'
  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>.
  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.
  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>.
  short: 'K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin,
    Heidelberg, 2008.'
date_created: 2020-08-14T13:19:24Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-85194-3_11
language:
- iso: eng
place: Berlin, Heidelberg
publication: Unconventional Computing
publication_identifier:
  isbn:
  - '9783540851936'
  - '9783540851943'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: On Faster Integer Calculations Using Non-arithmetic Primitives
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '24276'
abstract:
- lang: eng
  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"
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
citation:
  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>'
  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>
  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} }'
  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>.
  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>.'
  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>.
  short: 'M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin,
    Heidelberg, 2007.'
date_created: 2021-09-13T13:07:57Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73951-7_30
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
type: conference
user_id: '15415'
year: '2007'
...