---
_id: '6300'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Karsten
full_name: Nebe, Karsten
last_name: Nebe
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
citation:
ama: 'Fischer HG, Nebe K, Klompmaker F. A Holistic Model for Integrating Usability
Engineering and Software Engineering Enriched with Marketing Activities. In: Kurosu
M, ed. Human Centered Design. Vol 6776. Lecture Notes in Computer Science.
Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:28-37. doi:10.1007/978-3-642-21753-1_4'
apa: 'Fischer, H. G., Nebe, K., & Klompmaker, F. (2011). A Holistic Model for
Integrating Usability Engineering and Software Engineering Enriched with Marketing
Activities. In M. Kurosu (Ed.), Human Centered Design (Vol. 6776, pp. 28–37).
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-21753-1_4'
bibtex: '@inbook{Fischer_Nebe_Klompmaker_2011, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={A Holistic Model for Integrating Usability
Engineering and Software Engineering Enriched with Marketing Activities}, volume={6776},
DOI={10.1007/978-3-642-21753-1_4},
booktitle={Human Centered Design}, publisher={Springer Berlin Heidelberg}, author={Fischer,
Holger Gerhard and Nebe, Karsten and Klompmaker, Florian}, editor={Kurosu, MasaakiEditor},
year={2011}, pages={28–37}, collection={Lecture Notes in Computer Science} }'
chicago: 'Fischer, Holger Gerhard, Karsten Nebe, and Florian Klompmaker. “A Holistic
Model for Integrating Usability Engineering and Software Engineering Enriched
with Marketing Activities.” In Human Centered Design, edited by Masaaki
Kurosu, 6776:28–37. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2011. https://doi.org/10.1007/978-3-642-21753-1_4.'
ieee: 'H. G. Fischer, K. Nebe, and F. Klompmaker, “A Holistic Model for Integrating
Usability Engineering and Software Engineering Enriched with Marketing Activities,”
in Human Centered Design, vol. 6776, M. Kurosu, Ed. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2011, pp. 28–37.'
mla: Fischer, Holger Gerhard, et al. “A Holistic Model for Integrating Usability
Engineering and Software Engineering Enriched with Marketing Activities.” Human
Centered Design, edited by Masaaki Kurosu, vol. 6776, Springer Berlin Heidelberg,
2011, pp. 28–37, doi:10.1007/978-3-642-21753-1_4.
short: 'H.G. Fischer, K. Nebe, F. Klompmaker, in: M. Kurosu (Ed.), Human Centered
Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 28–37.'
conference:
end_date: 2011-07-14
location: Orlando, USA
name: International Conference on Human Centered Design (HCD) as part of HCI International
2011
start_date: 2011-07-09
date_created: 2018-12-18T13:04:39Z
date_updated: 2022-01-06T07:03:00Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-642-21753-1_4
editor:
- first_name: Masaaki
full_name: Kurosu, Masaaki
last_name: Kurosu
intvolume: ' 6776'
language:
- iso: eng
page: 28-37
place: Berlin, Heidelberg
publication: Human Centered Design
publication_identifier:
isbn:
- '9783642217524'
- '9783642217531'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: A Holistic Model for Integrating Usability Engineering and Software Engineering
Enriched with Marketing Activities
type: book_chapter
user_id: '30457'
volume: 6776
year: '2011'
...
---
_id: '16410'
abstract:
- lang: eng
text: 'Gathering n mobile robots in one single point in the Euclidean plane is a
widely studied problem from the area of robot formation problems. Classically,
the robots are assumed to have no physical extent, and they are able to share
a position with other robots. We drop these assumptions and investigate a similar
problem for robots with (a spherical) extent: the goal is to gather the robots
as close together as possible. More exactly, we want the robots to form a sphere
with minimum radius around a predefined point. We propose an algorithm for this
problem which synchronously moves the robots towards the center of the sphere
unless they block each other. In this case, if possible, the robots spin around
the center of the sphere. We analyze this algorithm experimentally in the plane.
If R is the distance of the farthest robot to the center of the sphere, the simulations
indicate a runtime which is linear in n and R. Additionally, we prove a theoretic
upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations
also suggest a runtime of O(n + R) for the discrete version.'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots
with an Extent. In: 37th International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM 2011). Springer; 2011:178-189. doi:10.1007/978-3-642-18381-2_15'
apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In
37th International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM 2011) (pp. 178–189). Springer. https://doi.org/10.1007/978-3-642-18381-2_15
bibtex: '@inproceedings{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, title={Collisionless Gathering of Robots with an Extent},
DOI={10.1007/978-3-642-18381-2_15},
number={6543}, booktitle={37th International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM 2011)}, publisher={Springer}, author={Cord-Landwehr,
Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and Meyer auf der Heide, Friedhelm and et al.}, year={2011}, pages={178–189} }'
chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering
of Robots with an Extent.” In 37th International Conference on Current Trends
in Theory and Practice of Computer Science (SOFSEM 2011), 178–89. Springer,
2011. https://doi.org/10.1007/978-3-642-18381-2_15.
ieee: A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an
Extent,” in 37th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189.
mla: Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.”
37th International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM 2011), no. 6543, Springer, 2011, pp. 178–89, doi:10.1007/978-3-642-18381-2_15.
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: 37th International Conference on Current
Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011,
pp. 178–189.'
date_created: 2020-04-06T07:52:42Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-18381-2_15
issue: '6543'
language:
- iso: eng
page: 178-189
publication: 37th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM 2011)
publication_identifier:
isbn:
- '9783642183805'
- '9783642183812'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Collisionless Gathering of Robots with an Extent
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '16459'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-Efficient Strategies
for Building Short Chains of Mobile Robots Locally. In: Structural Information
and Communication Complexity. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22212-2_13'
apa: Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011).
Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.
In Structural Information and Communication Complexity. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-22212-2_13
bibtex: '@inbook{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, place={Berlin,
Heidelberg}, title={Energy-Efficient Strategies for Building Short Chains of Mobile
Robots Locally}, DOI={10.1007/978-3-642-22212-2_13},
booktitle={Structural Information and Communication Complexity}, author={Brandes,
Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
year={2011} }'
chicago: Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer
auf der Heide. “Energy-Efficient Strategies for Building Short Chains of Mobile
Robots Locally.” In Structural Information and Communication Complexity.
Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22212-2_13.
ieee: P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient
Strategies for Building Short Chains of Mobile Robots Locally,” in Structural
Information and Communication Complexity, Berlin, Heidelberg, 2011.
mla: Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains
of Mobile Robots Locally.” Structural Information and Communication Complexity,
2011, doi:10.1007/978-3-642-22212-2_13.
short: 'P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural
Information and Communication Complexity, Berlin, Heidelberg, 2011.'
date_created: 2020-04-08T06:52:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-22212-2_13
language:
- iso: eng
place: Berlin, Heidelberg
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783642222115'
- '9783642222122'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally
type: book_chapter
user_id: '15415'
year: '2011'
...
---
_id: '15097'
author:
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- 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
citation:
ama: 'Benter M, Böttcher S, Hartel R. Mixing Bottom-Up and Top-Down XPath Query
Evaluation. In: East European Conference on Advances in Databases and Information
Systems. Springer; 2011:27-41. doi:10.1007/978-3-642-23737-9_3'
apa: Benter, M., Böttcher, S., & Hartel, R. (2011). Mixing Bottom-Up and Top-Down
XPath Query Evaluation. In East European Conference on Advances in Databases
and Information Systems (pp. 27–41). Springer. https://doi.org/10.1007/978-3-642-23737-9_3
bibtex: '@inproceedings{Benter_Böttcher_Hartel_2011, title={Mixing Bottom-Up and
Top-Down XPath Query Evaluation}, DOI={10.1007/978-3-642-23737-9_3},
booktitle={East European Conference on Advances in Databases and Information Systems},
publisher={Springer}, author={Benter, Markus and Böttcher, Stefan and Hartel,
Rita}, year={2011}, pages={27–41} }'
chicago: Benter, Markus, Stefan Böttcher, and Rita Hartel. “Mixing Bottom-Up and
Top-Down XPath Query Evaluation.” In East European Conference on Advances in
Databases and Information Systems, 27–41. Springer, 2011. https://doi.org/10.1007/978-3-642-23737-9_3.
ieee: M. Benter, S. Böttcher, and R. Hartel, “Mixing Bottom-Up and Top-Down XPath
Query Evaluation,” in East European Conference on Advances in Databases and
Information Systems, 2011, pp. 27–41.
mla: Benter, Markus, et al. “Mixing Bottom-Up and Top-Down XPath Query Evaluation.”
East European Conference on Advances in Databases and Information Systems,
Springer, 2011, pp. 27–41, doi:10.1007/978-3-642-23737-9_3.
short: 'M. Benter, S. Böttcher, R. Hartel, in: East European Conference on Advances
in Databases and Information Systems, Springer, 2011, pp. 27–41.'
date_created: 2019-11-21T15:27:31Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-642-23737-9_3
language:
- iso: eng
page: 27-41
publication: East European Conference on Advances in Databases and Information Systems
publication_identifier:
isbn:
- '9783642237362'
- '9783642237379'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Mixing Bottom-Up and Top-Down XPath Query Evaluation
type: conference
user_id: '14961'
year: '2011'
...
---
_id: '15099'
author:
- first_name: Alexander
full_name: Bätz, Alexander
last_name: Bätz
- 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
citation:
ama: 'Bätz A, Böttcher S, Hartel R. Updates on Grammar-Compressed XML Data. In:
Advances in Databases - 28th British National Conference on Databases, BNCOD
28, Revised Selected Papers. Springer; 2011:154-166. doi:10.1007/978-3-642-24577-0_17'
apa: Bätz, A., Böttcher, S., & Hartel, R. (2011). Updates on Grammar-Compressed
XML Data. In Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers (pp. 154–166). Springer. https://doi.org/10.1007/978-3-642-24577-0_17
bibtex: '@inproceedings{Bätz_Böttcher_Hartel_2011, title={Updates on Grammar-Compressed
XML Data}, DOI={10.1007/978-3-642-24577-0_17},
booktitle={Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers}, publisher={Springer}, author={Bätz, Alexander
and Böttcher, Stefan and Hartel, Rita}, year={2011}, pages={154–166} }'
chicago: Bätz, Alexander, Stefan Böttcher, and Rita Hartel. “Updates on Grammar-Compressed
XML Data.” In Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers, 154–66. Springer, 2011. https://doi.org/10.1007/978-3-642-24577-0_17.
ieee: A. Bätz, S. Böttcher, and R. Hartel, “Updates on Grammar-Compressed XML Data,”
in Advances in Databases - 28th British National Conference on Databases, BNCOD
28, Revised Selected Papers, 2011, pp. 154–166.
mla: Bätz, Alexander, et al. “Updates on Grammar-Compressed XML Data.” Advances
in Databases - 28th British National Conference on Databases, BNCOD 28, Revised
Selected Papers, Springer, 2011, pp. 154–66, doi:10.1007/978-3-642-24577-0_17.
short: 'A. Bätz, S. Böttcher, R. Hartel, in: Advances in Databases - 28th British
National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer,
2011, pp. 154–166.'
date_created: 2019-11-21T15:30:41Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-642-24577-0_17
language:
- iso: eng
page: 154-166
publication: Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers
publication_identifier:
isbn:
- '9783642245763'
- '9783642245770'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Updates on Grammar-Compressed XML Data
type: conference
user_id: '14961'
year: '2011'
...
---
_id: '15100'
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: Sebastian
full_name: Stey, Sebastian
last_name: Stey
citation:
ama: 'Böttcher S, Hartel R, Stey S. TraCX: Transformation of Compressed XML. In:
Advances in Databases - 28th British National Conference on Databases, BNCOD
28, Revised Selected Papers. Springer; 2011:182-193. doi:10.1007/978-3-642-24577-0_19'
apa: 'Böttcher, S., Hartel, R., & Stey, S. (2011). TraCX: Transformation of
Compressed XML. In Advances in Databases - 28th British National Conference
on Databases, BNCOD 28, Revised Selected Papers (pp. 182–193). Springer. https://doi.org/10.1007/978-3-642-24577-0_19'
bibtex: '@inproceedings{Böttcher_Hartel_Stey_2011, title={TraCX: Transformation
of Compressed XML}, DOI={10.1007/978-3-642-24577-0_19},
booktitle={Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers}, publisher={Springer}, author={Böttcher, Stefan
and Hartel, Rita and Stey, Sebastian}, year={2011}, pages={182–193} }'
chicago: 'Böttcher, Stefan, Rita Hartel, and Sebastian Stey. “TraCX: Transformation
of Compressed XML.” In Advances in Databases - 28th British National Conference
on Databases, BNCOD 28, Revised Selected Papers, 182–93. Springer, 2011. https://doi.org/10.1007/978-3-642-24577-0_19.'
ieee: 'S. Böttcher, R. Hartel, and S. Stey, “TraCX: Transformation of Compressed
XML,” in Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers, 2011, pp. 182–193.'
mla: 'Böttcher, Stefan, et al. “TraCX: Transformation of Compressed XML.” Advances
in Databases - 28th British National Conference on Databases, BNCOD 28, Revised
Selected Papers, Springer, 2011, pp. 182–93, doi:10.1007/978-3-642-24577-0_19.'
short: 'S. Böttcher, R. Hartel, S. Stey, in: Advances in Databases - 28th British
National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer,
2011, pp. 182–193.'
date_created: 2019-11-21T15:31:36Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-642-24577-0_19
language:
- iso: eng
page: 182-193
publication: Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers
publication_identifier:
isbn:
- '9783642245763'
- '9783642245770'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: 'TraCX: Transformation of Compressed XML'
type: conference
user_id: '14961'
year: '2011'
...
---
_id: '16409'
abstract:
- lang: eng
text: "Given a set of n mobile robots in the d-dimensional Euclidean space, the
goal is to let them converge to a single not predefined point. The challenge is
that the robots are limited in their capabilities. Robots can, upon activation,
compute the positions of all other robots using an individual affine coordinate
system. The robots are indistinguishable, oblivious and may have different affine
coordinate systems. A very general discrete time model assumes that robots are
activated in arbitrary order. Further, the computation of a new target point may
happen much earlier than the movement, so that the movement is based on outdated
information about other robot's positions. Time is measured as the number of rounds,
where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg:
Convergence properties of gravitational algorithms in asynchronous robot systems],
the Center of Gravity is considered as target function, convergence was proven,
and the number of rounds needed for halving the diameter of the convex hull of
the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check
property of target functions that guarantee convergence and yields upper time
bounds. This property intuitively says that when a robot computes a new target
point, this point is significantly within the current axes aligned minimal box
containing all robots. This property holds, e.g., for the above-mentioned target
function, and improves the above O(n^2) to an asymptotically optimal O(n) upper
bound. Our technique also yields a constant time bound for a target function that
requires all robots having identical coordinate axes.\r\n"
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing
Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming.
Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52'
apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms
for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-22012-8_52
bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for
Analyzing Convergence Algorithms for Mobile Robots}, DOI={10.1007/978-3-642-22012-8_52},
booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas
and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }'
chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing
Convergence Algorithms for Mobile Robots.” In Automata, Languages and Programming.
Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52.
ieee: A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence
Algorithms for Mobile Robots,” in Automata, Languages and Programming,
Berlin, Heidelberg, 2011.
mla: Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms
for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming,
Berlin, Heidelberg, 2011.'
date_created: 2020-04-06T07:47:55Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-22012-8_52
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '9783642220111'
- '9783642220128'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A New Approach for Analyzing Convergence Algorithms for Mobile Robots
type: book_chapter
user_id: '15415'
year: '2011'
...
---
_id: '19796'
abstract:
- lang: eng
text: "We introduce the Read-Write-Coding-System (RWC) \x96 a very flexible class
of linear block codes that generate efficient and flexible erasure codes for storage
networks. In particular, given a message x of k symbols and a codeword y of n
symbols, an RW code defines additional parameters k \\leq r,w \\leq n that offer
enhanced possibilities to adjust the fault-tolerance capability of the code. More
precisely, an RWC provides linear $\\left(n,k,d\\right)$-codes that have (a) minimum
distance d=n-r+1 for any two codewords, and (b) for each codeword there exists
a codeword for each other message with distance of at most w. Furthermore, depending
on the values r,w and the code alphabet, different block codes such as parity
codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be
generated. In storage networks in which I/O accesses are very costly and redundancy
is crucial, this flexibility has considerable advantages as r and w can optimally
be adapted to read or write intensive applications; only w symbols must be updated
if the message x changes completely, what is different from other codes which
always need to rewrite y completely as x changes. In this paper, we first state
a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce
special RW codes in which all mentioned parameters are adjustable even online,
that is, those RW codes are adaptive to changing demands. At last, we point out
some useful properties regarding safety and security of the stored data."
author:
- first_name: Mario
full_name: Mense, Mario
last_name: Mense
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Mense M, Schindelhauer C. Read-Write-Codes: An Erasure Resilient Encoding
System for Flexible Reading and Writing in Storage Networks. In: Proceedings
of 11th International Symposium on Stabilization, Safety, and Security of Distributed
Systems. Vol 5873. Lecture Notes in Computer Science. ; 2010:624--639. doi:10.1007/978-3-642-05118-0_43'
apa: 'Mense, M., & Schindelhauer, C. (2010). Read-Write-Codes: An Erasure Resilient
Encoding System for Flexible Reading and Writing in Storage Networks. In Proceedings
of 11th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (Vol. 5873, pp. 624--639). https://doi.org/10.1007/978-3-642-05118-0_43'
bibtex: '@inproceedings{Mense_Schindelhauer_2010, series={Lecture Notes in Computer
Science}, title={Read-Write-Codes: An Erasure Resilient Encoding System for Flexible
Reading and Writing in Storage Networks}, volume={5873}, DOI={10.1007/978-3-642-05118-0_43},
booktitle={Proceedings of 11th International Symposium on Stabilization, Safety,
and Security of Distributed Systems}, author={Mense, Mario and Schindelhauer,
Christian}, year={2010}, pages={624--639}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure
Resilient Encoding System for Flexible Reading and Writing in Storage Networks.”
In Proceedings of 11th International Symposium on Stabilization, Safety, and
Security of Distributed Systems, 5873:624--639. Lecture Notes in Computer
Science, 2010. https://doi.org/10.1007/978-3-642-05118-0_43.'
ieee: 'M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding
System for Flexible Reading and Writing in Storage Networks,” in Proceedings
of 11th International Symposium on Stabilization, Safety, and Security of Distributed
Systems, 2010, vol. 5873, pp. 624--639.'
mla: 'Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient
Encoding System for Flexible Reading and Writing in Storage Networks.” Proceedings
of 11th International Symposium on Stabilization, Safety, and Security of Distributed
Systems, vol. 5873, 2010, pp. 624--639, doi:10.1007/978-3-642-05118-0_43.'
short: 'M. Mense, C. Schindelhauer, in: Proceedings of 11th International Symposium
on Stabilization, Safety, and Security of Distributed Systems, 2010, pp. 624--639.'
date_created: 2020-09-30T12:12:33Z
date_updated: 2022-01-06T06:54:12Z
department:
- _id: '63'
doi: 10.1007/978-3-642-05118-0_43
intvolume: ' 5873'
language:
- iso: eng
page: 624--639
publication: Proceedings of 11th International Symposium on Stabilization, Safety,
and Security of Distributed Systems
publication_identifier:
isbn:
- '9783642051173'
- '9783642051180'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science
status: public
title: 'Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading
and Writing in Storage Networks'
type: conference
user_id: '15415'
volume: 5873
year: '2010'
...
---
_id: '20226'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Bernd
full_name: Meyer, Bernd
last_name: Meyer
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Hamann H, Meyer B, Schmickl T, Crailsheim K. A Model of Symmetry Breaking
in Collective Decision-Making. In: From Animals to Animats 11. Vol 6226.
Springer; 2010:639-648. doi:10.1007/978-3-642-15193-4_60'
apa: Hamann, H., Meyer, B., Schmickl, T., & Crailsheim, K. (2010). A Model of
Symmetry Breaking in Collective Decision-Making. In From Animals to Animats
11 (Vol. 6226, pp. 639–648). Springer. https://doi.org/10.1007/978-3-642-15193-4_60
bibtex: '@inproceedings{Hamann_Meyer_Schmickl_Crailsheim_2010, title={A Model of
Symmetry Breaking in Collective Decision-Making}, volume={6226}, DOI={10.1007/978-3-642-15193-4_60},
booktitle={From Animals to Animats 11}, publisher={Springer}, author={Hamann,
Heiko and Meyer, Bernd and Schmickl, Thomas and Crailsheim, Karl}, year={2010},
pages={639–648} }'
chicago: Hamann, Heiko, Bernd Meyer, Thomas Schmickl, and Karl Crailsheim. “A Model
of Symmetry Breaking in Collective Decision-Making.” In From Animals to Animats
11, 6226:639–48. Springer, 2010. https://doi.org/10.1007/978-3-642-15193-4_60.
ieee: H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry
Breaking in Collective Decision-Making,” in From Animals to Animats 11,
2010, vol. 6226, pp. 639–648.
mla: Hamann, Heiko, et al. “A Model of Symmetry Breaking in Collective Decision-Making.”
From Animals to Animats 11, vol. 6226, Springer, 2010, pp. 639–48, doi:10.1007/978-3-642-15193-4_60.
short: 'H. Hamann, B. Meyer, T. Schmickl, K. Crailsheim, in: From Animals to Animats
11, Springer, 2010, pp. 639–648.'
date_created: 2020-10-29T14:22:12Z
date_updated: 2022-01-06T06:54:24Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-15193-4_60
intvolume: ' 6226'
language:
- iso: eng
page: 639-648
publication: From Animals to Animats 11
publication_identifier:
isbn:
- '9783642151927'
- '9783642151934'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: A Model of Symmetry Breaking in Collective Decision-Making
type: conference
user_id: '15415'
volume: 6226
year: '2010'
...
---
_id: '24282'
author:
- first_name: Ryszard
full_name: Grza̧ślewicz, Ryszard
last_name: Grza̧ślewicz
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Mirosław
full_name: Kutyłowski, Mirosław
last_name: Kutyłowski
- first_name: Wojciech
full_name: Pietkiewicz, Wojciech
last_name: Pietkiewicz
citation:
ama: 'Grza̧ślewicz R, Kutyłowski J, Kutyłowski M, Pietkiewicz W. Robust Undetectable
Interference Watermarks. ICCSA’05: Proceedings of the 2005 international conference
on Computational Science and Its Applications. Published online 2010. doi:10.1007/11424826_55'
apa: 'Grza̧ślewicz, R., Kutyłowski, J., Kutyłowski, M., & Pietkiewicz, W. (2010).
Robust Undetectable Interference Watermarks. ICCSA’05: Proceedings of the 2005
International Conference on Computational Science and Its Applications. https://doi.org/10.1007/11424826_55'
bibtex: '@article{Grza̧ślewicz_Kutyłowski_Kutyłowski_Pietkiewicz_2010, title={Robust
Undetectable Interference Watermarks}, DOI={10.1007/11424826_55},
journal={ICCSA’05: Proceedings of the 2005 international conference on Computational
Science and Its Applications}, author={Grza̧ślewicz, Ryszard and Kutyłowski, Jarosław
and Kutyłowski, Mirosław and Pietkiewicz, Wojciech}, year={2010} }'
chicago: 'Grza̧ślewicz, Ryszard, Jarosław Kutyłowski, Mirosław Kutyłowski, and Wojciech
Pietkiewicz. “Robust Undetectable Interference Watermarks.” ICCSA’05: Proceedings
of the 2005 International Conference on Computational Science and Its Applications,
2010. https://doi.org/10.1007/11424826_55.'
ieee: 'R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, and W. Pietkiewicz, “Robust
Undetectable Interference Watermarks,” ICCSA’05: Proceedings of the 2005 international
conference on Computational Science and Its Applications, 2010, doi: 10.1007/11424826_55.'
mla: 'Grza̧ślewicz, Ryszard, et al. “Robust Undetectable Interference Watermarks.”
ICCSA’05: Proceedings of the 2005 International Conference on Computational
Science and Its Applications, 2010, doi:10.1007/11424826_55.'
short: 'R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, W. Pietkiewicz, ICCSA’05:
Proceedings of the 2005 International Conference on Computational Science and
Its Applications (2010).'
date_created: 2021-09-13T14:53:37Z
date_updated: 2022-01-06T06:56:17Z
department:
- _id: '63'
doi: 10.1007/11424826_55
language:
- iso: eng
publication: 'ICCSA''05: Proceedings of the 2005 international conference on Computational
Science and Its Applications'
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Robust Undetectable Interference Watermarks
type: journal_article
user_id: '15415'
year: '2010'
...
---
_id: '2988'
author:
- first_name: Marcel R.
full_name: Ackermann, Marcel R.
last_name: Ackermann
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: 'Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: SWAT
2010. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2010:212-223. doi:10.1007/978-3-642-13731-0_21'
apa: 'Ackermann, M. R., & Blömer, J. (2010). Bregman Clustering for Separable
Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin
Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_21'
bibtex: '@inbook{Ackermann_Blömer_2010, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={Bregman Clustering for Separable Instances},
DOI={10.1007/978-3-642-13731-0_21},
booktitle={SWAT 2010}, publisher={Springer Berlin Heidelberg}, author={Ackermann,
Marcel R. and Blömer, Johannes}, year={2010}, pages={212–223}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable
Instances.” In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin,
Heidelberg: Springer Berlin Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13731-0_21.'
ieee: 'M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,”
in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp.
212–223.'
mla: Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable
Instances.” SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.
short: 'M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin,
Heidelberg, 2010, pp. 212–223.'
date_created: 2018-06-05T07:51:51Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-642-13731-0_21
page: 212-223
place: Berlin, Heidelberg
publication: SWAT 2010
publication_identifier:
isbn:
- '9783642137303'
- '9783642137310'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: Bregman Clustering for Separable Instances
type: book_chapter
user_id: '25078'
year: '2010'
...
---
_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: Lecture Notes in Computer Science. ; 2010. doi:10.1007/978-3-642-16576-4_4'
apa: Seebach, H., Nafz, F., Holtmann, J., Meyer, J., Tichy, M., Reif, W., &
Schäfer, W. (2010). Designing Self-healing in Automotive Systems. In Lecture
Notes in Computer Science. https://doi.org/10.1007/978-3-642-16576-4_4
bibtex: '@inbook{Seebach_Nafz_Holtmann_Meyer_Tichy_Reif_Schäfer_2010, place={Berlin,
Heidelberg}, title={Designing Self-healing in Automotive Systems}, DOI={10.1007/978-3-642-16576-4_4},
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 Lecture Notes in Computer Science. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-16576-4_4.
ieee: H. Seebach et al., “Designing Self-healing in Automotive Systems,”
in Lecture Notes in Computer Science, Berlin, Heidelberg, 2010.
mla: Seebach, Hella, et al. “Designing Self-Healing in Automotive Systems.” Lecture
Notes in Computer Science, 2010, doi:10.1007/978-3-642-16576-4_4.
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: Workshop on Internet
and Network Economics (WINE). ; 2010. doi:10.1007/978-3-642-17572-5_37'
apa: Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., & Nanongkai,
D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.
In Workshop on Internet and Network Economics (WINE). https://doi.org/10.1007/978-3-642-17572-5_37
bibtex: '@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved
Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={10.1007/978-3-642-17572-5_37},
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 Workshop on Internet and Network Economics (WINE), 2010. https://doi.org/10.1007/978-3-642-17572-5_37.
ieee: P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved
Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in Workshop
on Internet and Network Economics (WINE), 2010.
mla: Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg
Shortest-Path Pricing.” Workshop on Internet and Network Economics (WINE),
2010, doi:10.1007/978-3-642-17572-5_37.
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: Advances in Visual Computing. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-17289-2_60'
apa: Eikel, B., Jähn, C., & Fischer, M. (2010). Preprocessed Global Visibility
for Real-Time Rendering on Low-End Hardware. In Advances in Visual Computing.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17289-2_60
bibtex: '@inbook{Eikel_Jähn_Fischer_2010, place={Berlin, Heidelberg}, title={Preprocessed
Global Visibility for Real-Time Rendering on Low-End Hardware}, DOI={10.1007/978-3-642-17289-2_60},
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 Advances in Visual
Computing. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-17289-2_60.
ieee: B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time
Rendering on Low-End Hardware,” in Advances in Visual Computing, Berlin,
Heidelberg, 2010.
mla: Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering
on Low-End Hardware.” Advances in Visual Computing, 2010, doi:10.1007/978-3-642-17289-2_60.
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: Database and XML Technologies - 7th International
XML Database Symposium, XSym 2010. Springer; 2010:103-112. doi:10.1007/978-3-642-15684-7_9'
apa: Böttcher, S., Hartel, R., & Messinger, C. (2010). Searchable Compression
of Office Documents by XML Schema Subtraction. In Database and XML Technologies
- 7th International XML Database Symposium, XSym 2010 (pp. 103–112). Springer.
https://doi.org/10.1007/978-3-642-15684-7_9
bibtex: '@inproceedings{Böttcher_Hartel_Messinger_2010, title={Searchable Compression
of Office Documents by XML Schema Subtraction}, DOI={10.1007/978-3-642-15684-7_9},
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 Database and XML Technologies
- 7th International XML Database Symposium, XSym 2010, 103–12. Springer, 2010.
https://doi.org/10.1007/978-3-642-15684-7_9.
ieee: S. Böttcher, R. Hartel, and C. Messinger, “Searchable Compression of Office
Documents by XML Schema Subtraction,” in Database and XML Technologies - 7th
International XML Database Symposium, XSym 2010, 2010, pp. 103–112.
mla: Böttcher, Stefan, et al. “Searchable Compression of Office Documents by XML
Schema Subtraction.” Database and XML Technologies - 7th International XML
Database Symposium, XSym 2010, Springer, 2010, pp. 103–12, doi:10.1007/978-3-642-15684-7_9.
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: Structural Information
and Communication Complexity. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182.
doi:10.1007/978-3-642-13284-1_14'
apa: Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2010).
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.
In Structural Information and Communication Complexity (pp. 168–182). Berlin,
Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_14
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={10.1007/978-3-642-13284-1_14},
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 Structural Information and Communication Complexity, 168–82.
SIROCCO 2010. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13284-1_14.
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 Structural
Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.
mla: Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short
Chain of Mobile Robots.” Structural Information and Communication Complexity,
2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.
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.
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-14162-1
apa: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis,
P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International
Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1
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={10.1007/978-3-642-14162-1},
year={2010} }'
chicago: Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf
der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part II. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14162-1.
ieee: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and 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.
mla: Abramsky, Samson, et al., editors. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1.
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.
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-14165-2
apa: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis,
P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International
Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2
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={10.1007/978-3-642-14165-2},
year={2010} }'
chicago: Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf
der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part I. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14165-2.
ieee: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and 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.
mla: Abramsky, Samson, et al., editors. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.
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: Practical Aspects of Knowledge Management. Berlin,
Heidelberg; 2010. doi:10.1007/978-3-540-30545-3_23'
apa: Trier, M., & Müller, C. (2010). Towards a Systematic Approach for Capturing
Knowledge-Intensive Business Processes. In Practical Aspects of Knowledge Management.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30545-3_23
bibtex: '@inbook{Trier_Müller_2010, place={Berlin, Heidelberg}, title={Towards a
Systematic Approach for Capturing Knowledge-Intensive Business Processes}, DOI={10.1007/978-3-540-30545-3_23},
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 Practical Aspects of
Knowledge Management. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-540-30545-3_23.
ieee: M. Trier and C. Müller, “Towards a Systematic Approach for Capturing Knowledge-Intensive
Business Processes,” 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.” Practical Aspects of Knowledge Management,
2010, doi:10.1007/978-3-540-30545-3_23.
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: Algorithmic Aspects of Wireless
Sensor Networks. Berlin, Heidelberg: Springer; 2009:252-262. doi:10.1007/978-3-642-05434-1_25'
apa: 'Bonorden, O., Degener, B., Kempkes, B., & Pietrzyk, P. (2009). Complexity
and Approximation of a Geometric Local Robot Assignment Problem. In Algorithmic
Aspects of Wireless Sensor Networks (pp. 252–262). Berlin, Heidelberg: Springer.
https://doi.org/10.1007/978-3-642-05434-1_25'
bibtex: '@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg},
title={Complexity and Approximation of a Geometric Local Robot Assignment Problem},
DOI={10.1007/978-3-642-05434-1_25},
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 Algorithmic Aspects of Wireless Sensor Networks, 252–62. Berlin, Heidelberg:
Springer, 2009. https://doi.org/10.1007/978-3-642-05434-1_25.'
ieee: 'O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation
of a Geometric Local Robot Assignment Problem,” in Algorithmic Aspects of Wireless
Sensor Networks, Berlin, Heidelberg: Springer, 2009, pp. 252–262.'
mla: Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot
Assignment Problem.” Algorithmic Aspects of Wireless Sensor Networks, Springer,
2009, pp. 252–62, doi:10.1007/978-3-642-05434-1_25.
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'
...