---
_id: '19618'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
citation:
ama: 'Bonorden O. Versatility of Bulk Synchronous Parallel Computing: From the
Heterogeneous Cluster to the System on Chip. Vol 257. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2009.'
apa: 'Bonorden, O. (2009). Versatility of Bulk Synchronous Parallel Computing:
From the Heterogeneous Cluster to the System on Chip (Vol. 257). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.'
bibtex: '@book{Bonorden_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Versatility of Bulk Synchronous Parallel Computing: From the
Heterogeneous Cluster to the System on Chip}, volume={257}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Bonorden, Olaf}, year={2009},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: 'Bonorden, Olaf. Versatility of Bulk Synchronous Parallel Computing:
From the Heterogeneous Cluster to the System on Chip. Vol. 257. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2009.'
ieee: 'O. Bonorden, Versatility of Bulk Synchronous Parallel Computing: From
the Heterogeneous Cluster to the System on Chip, vol. 257. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009.'
mla: 'Bonorden, Olaf. Versatility of Bulk Synchronous Parallel Computing: From
the Heterogeneous Cluster to the System on Chip. Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn, 2009.'
short: 'O. Bonorden, Versatility of Bulk Synchronous Parallel Computing: From the
Heterogeneous Cluster to the System on Chip, Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2009.'
date_created: 2020-09-22T08:44:45Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 257'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-76-7
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080623016
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: 'Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous
Cluster to the System on Chip'
type: dissertation
user_id: '5786'
volume: 257
year: '2009'
...
---
_id: '19722'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
citation:
ama: Bonorden O, Degener B, Pietrzyk P, Kempkes B. Complexity and Approximation
of a Geometric Local Robot Assignment Problem.; 2009.
apa: Bonorden, O., Degener, B., Pietrzyk, P., & Kempkes, B. (2009). Complexity
and approximation of a geometric local robot assignment problem.
bibtex: '@book{Bonorden_Degener_Pietrzyk_Kempkes_2009, title={Complexity and approximation
of a geometric local robot assignment problem}, author={Bonorden, Olaf and Degener,
Bastian and Pietrzyk, Peter and Kempkes, Barbara}, year={2009} }'
chicago: Bonorden, Olaf, Bastian Degener, Peter Pietrzyk, and Barbara Kempkes. Complexity
and Approximation of a Geometric Local Robot Assignment Problem, 2009.
ieee: O. Bonorden, B. Degener, P. Pietrzyk, and B. Kempkes, Complexity and approximation
of a geometric local robot assignment problem. 2009.
mla: Bonorden, Olaf, et al. Complexity and Approximation of a Geometric Local
Robot Assignment Problem. 2009.
short: O. Bonorden, B. Degener, P. Pietrzyk, B. Kempkes, Complexity and Approximation
of a Geometric Local Robot Assignment Problem, 2009.
date_created: 2020-09-28T10:19:43Z
date_updated: 2022-01-06T06:54:10Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-28T10:19:26Z
date_updated: 2020-09-28T10:19:26Z
file_id: '19723'
file_name: pub-hni-3956.pdf
file_size: 258114
relation: main_file
success: 1
file_date_updated: 2020-09-28T10:19:26Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Complexity and approximation of a geometric local robot assignment problem
type: report
user_id: '15415'
year: '2009'
...
---
_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'
...
---
_id: '19825'
abstract:
- lang: eng
text: Categorizing peer-to-peer networks from an algorithmic point of view the two
extremes of the spectrum are unstructured networks and networks based on plain
distributed hash tables (DHT). Unstructured networks stand out with their simplicity,
robustness, and support for complex queries. Though, they lack efficient query
algorithms providing guarantees. On the other hand, DHT based networks feature
efficient lookup algorithms with typically logarithmic hop distance and provide
simple and efficient load balancing. Yet, they are limited to exact match queries
and in many cases hard to maintain under churn.
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Thomas
full_name: Janson, Thomas
last_name: Janson
citation:
ama: 'Schindelhauer C, Mahlmann P, Janson T. 3nuts: A Locality-Aware Peer-to-Peer
Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany;
2009.'
apa: 'Schindelhauer, C., Mahlmann, P., & Janson, T. (2009). 3nuts: A Locality-Aware
Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn,
Germany.'
bibtex: '@book{Schindelhauer_Mahlmann_Janson_2009, title={3nuts: A Locality-Aware
Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, publisher={Paderborn,
Germany}, author={Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas},
year={2009} }'
chicago: 'Schindelhauer, Christian, Peter Mahlmann, and Thomas Janson. 3nuts:
A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees,
and DHTs. Paderborn, Germany, 2009.'
ieee: 'C. Schindelhauer, P. Mahlmann, and T. Janson, 3nuts: A Locality-Aware
Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn,
Germany, 2009.'
mla: 'Schindelhauer, Christian, et al. 3nuts: A Locality-Aware Peer-to-Peer Network
Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany, 2009.'
short: 'C. Schindelhauer, P. Mahlmann, T. Janson, 3nuts: A Locality-Aware Peer-to-Peer
Network Combining Random Networks, Search Trees, and DHTs, Paderborn, Germany,
2009.'
date_created: 2020-10-01T09:47:54Z
date_updated: 2022-01-06T06:54:13Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-10-01T09:47:33Z
date_updated: 2020-10-01T09:47:33Z
file_id: '19826'
file_name: pub-hni-4130.pdf
file_size: 753215
relation: main_file
success: 1
file_date_updated: 2020-10-01T09:47:33Z
has_accepted_license: '1'
language:
- iso: eng
publisher: Paderborn, Germany
status: public
title: '3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search
Trees, and DHTs'
type: report
user_id: '15415'
year: '2009'
...
---
_id: '19830'
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots.
Mobile Networks and Applications (MONET). 2009:309-321. doi:10.1007/s11036-008-0150-5
apa: Ooi, C. C., & Schindelhauer, C. (2009). Minimal Energy Path Planning for
Wireless Robots. Mobile Networks and Applications (MONET), 309–321. https://doi.org/10.1007/s11036-008-0150-5
bibtex: '@article{Ooi_Schindelhauer_2009, title={Minimal Energy Path Planning for
Wireless Robots}, DOI={10.1007/s11036-008-0150-5},
journal={Mobile Networks and Applications (MONET)}, author={Ooi, Chia Ching and
Schindelhauer, Christian}, year={2009}, pages={309–321} }'
chicago: Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
for Wireless Robots.” Mobile Networks and Applications (MONET), 2009, 309–21.
https://doi.org/10.1007/s11036-008-0150-5.
ieee: C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless
Robots,” Mobile Networks and Applications (MONET), pp. 309–321, 2009.
mla: Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
for Wireless Robots.” Mobile Networks and Applications (MONET), 2009, pp.
309–21, doi:10.1007/s11036-008-0150-5.
short: C.C. Ooi, C. Schindelhauer, Mobile Networks and Applications (MONET) (2009)
309–321.
date_created: 2020-10-01T10:05:47Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/s11036-008-0150-5
language:
- iso: eng
page: 309-321
publication: Mobile Networks and Applications (MONET)
publication_identifier:
issn:
- 1383-469X
- 1572-8153
publication_status: published
status: public
title: Minimal Energy Path Planning for Wireless Robots
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '19831'
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Ooi CC, Schindelhauer C. Utilizing detours for energy conservation in mobile
wireless networks. Telecommunication Systems. 2009;43:25-37. doi:10.1007/s11235-009-9188-3
apa: Ooi, C. C., & Schindelhauer, C. (2009). Utilizing detours for energy conservation
in mobile wireless networks. Telecommunication Systems, 43, 25–37.
https://doi.org/10.1007/s11235-009-9188-3
bibtex: '@article{Ooi_Schindelhauer_2009, title={Utilizing detours for energy conservation
in mobile wireless networks}, volume={43}, DOI={10.1007/s11235-009-9188-3},
journal={Telecommunication Systems}, author={Ooi, Chia Ching and Schindelhauer,
Christian}, year={2009}, pages={25–37} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy
Conservation in Mobile Wireless Networks.” Telecommunication Systems 43
(2009): 25–37. https://doi.org/10.1007/s11235-009-9188-3.'
ieee: C. C. Ooi and C. Schindelhauer, “Utilizing detours for energy conservation
in mobile wireless networks,” Telecommunication Systems, vol. 43, pp. 25–37,
2009.
mla: Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy
Conservation in Mobile Wireless Networks.” Telecommunication Systems, vol.
43, 2009, pp. 25–37, doi:10.1007/s11235-009-9188-3.
short: C.C. Ooi, C. Schindelhauer, Telecommunication Systems 43 (2009) 25–37.
date_created: 2020-10-01T10:10:10Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/s11235-009-9188-3
intvolume: ' 43'
language:
- iso: eng
page: 25-37
publication: Telecommunication Systems
publication_identifier:
issn:
- 1018-4864
- 1572-9451
publication_status: published
status: public
title: Utilizing detours for energy conservation in mobile wireless networks
type: journal_article
user_id: '15415'
volume: 43
year: '2009'
...
---
_id: '19901'
author:
- first_name: Christoforos L.
full_name: Raptopoulos, Christoforos L.
last_name: Raptopoulos
- first_name: Sotiris E.
full_name: Nikoletseas, Sotiris E.
last_name: Nikoletseas
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
citation:
ama: 'Raptopoulos CL, Nikoletseas SE, Spirakis PG. Colouring Non-sparse Random Intersection
Graphs. In: 34st International Symposium on Mathematical Foundations of Computer
Science. ; 2009:600--611. doi:10.1007/978-1-4939-2864-4_597'
apa: Raptopoulos, C. L., Nikoletseas, S. E., & Spirakis, P. G. (2009). Colouring
Non-sparse Random Intersection Graphs. In 34st International Symposium on Mathematical
Foundations of Computer Science (pp. 600--611). https://doi.org/10.1007/978-1-4939-2864-4_597
bibtex: '@inproceedings{Raptopoulos_Nikoletseas_Spirakis_2009, title={Colouring
Non-sparse Random Intersection Graphs}, DOI={10.1007/978-1-4939-2864-4_597},
booktitle={34st International Symposium on Mathematical Foundations of Computer
Science}, author={Raptopoulos, Christoforos L. and Nikoletseas, Sotiris E. and
Spirakis, Paul G.}, year={2009}, pages={600--611} }'
chicago: Raptopoulos, Christoforos L., Sotiris E. Nikoletseas, and Paul G. Spirakis.
“Colouring Non-Sparse Random Intersection Graphs.” In 34st International Symposium
on Mathematical Foundations of Computer Science, 600--611, 2009. https://doi.org/10.1007/978-1-4939-2864-4_597.
ieee: C. L. Raptopoulos, S. E. Nikoletseas, and P. G. Spirakis, “Colouring Non-sparse
Random Intersection Graphs,” in 34st International Symposium on Mathematical
Foundations of Computer Science, 2009, pp. 600--611.
mla: Raptopoulos, Christoforos L., et al. “Colouring Non-Sparse Random Intersection
Graphs.” 34st International Symposium on Mathematical Foundations of Computer
Science, 2009, pp. 600--611, doi:10.1007/978-1-4939-2864-4_597.
short: 'C.L. Raptopoulos, S.E. Nikoletseas, P.G. Spirakis, in: 34st International
Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611.'
date_created: 2020-10-06T10:09:51Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1007/978-1-4939-2864-4_597
language:
- iso: eng
page: 600--611
publication: 34st International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9781493928637'
- '9781493928644'
publication_status: published
status: public
title: Colouring Non-sparse Random Intersection Graphs
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '19904'
author:
- first_name: Sotiris E.
full_name: Nikoletseas, Sotiris E.
last_name: Nikoletseas
- first_name: Christoforos L.
full_name: Raptopoulos, Christoforos L.
last_name: Raptopoulos
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
citation:
ama: 'Nikoletseas SE, Raptopoulos CL, Spirakis PG. Combinatorial Properties for
Efficient Communication in Distributed Networks with Local Interactions. In:
Proceedings of IPDPS - IEEE International Parallel & Distributed Processing
Symposium. ; 2009:1--11. doi:10.1109/IPDPS.2009.5161002'
apa: Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2009). Combinatorial
Properties for Efficient Communication in Distributed Networks with Local Interactions.
In Proceedings of IPDPS - IEEE International Parallel & Distributed Processing
Symposium (pp. 1--11). https://doi.org/10.1109/IPDPS.2009.5161002
bibtex: '@inproceedings{Nikoletseas_Raptopoulos_Spirakis_2009, title={Combinatorial
Properties for Efficient Communication in Distributed Networks with Local Interactions},
DOI={10.1109/IPDPS.2009.5161002},
booktitle={ Proceedings of IPDPS - IEEE International Parallel & Distributed
Processing Symposium}, author={Nikoletseas, Sotiris E. and Raptopoulos, Christoforos
L. and Spirakis, Paul G.}, year={2009}, pages={1--11} }'
chicago: Nikoletseas, Sotiris E., Christoforos L. Raptopoulos, and Paul G. Spirakis.
“Combinatorial Properties for Efficient Communication in Distributed Networks
with Local Interactions.” In Proceedings of IPDPS - IEEE International Parallel
& Distributed Processing Symposium, 1--11, 2009. https://doi.org/10.1109/IPDPS.2009.5161002.
ieee: S. E. Nikoletseas, C. L. Raptopoulos, and P. G. Spirakis, “Combinatorial Properties
for Efficient Communication in Distributed Networks with Local Interactions,”
in Proceedings of IPDPS - IEEE International Parallel & Distributed Processing
Symposium, 2009, pp. 1--11.
mla: Nikoletseas, Sotiris E., et al. “Combinatorial Properties for Efficient Communication
in Distributed Networks with Local Interactions.” Proceedings of IPDPS - IEEE
International Parallel & Distributed Processing Symposium, 2009, pp. 1--11,
doi:10.1109/IPDPS.2009.5161002.
short: 'S.E. Nikoletseas, C.L. Raptopoulos, P.G. Spirakis, in: Proceedings of IPDPS
- IEEE International Parallel & Distributed Processing Symposium, 2009, pp.
1--11.'
date_created: 2020-10-06T10:23:53Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1109/IPDPS.2009.5161002
language:
- iso: eng
page: 1--11
publication: ' Proceedings of IPDPS - IEEE International Parallel & Distributed Processing
Symposium'
status: public
title: Combinatorial Properties for Efficient Communication in Distributed Networks
with Local Interactions
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '19934'
author:
- first_name: Deniz
full_name: Deveci, Deniz
last_name: Deveci
- first_name: Michael
full_name: Kortenjan, Michael
last_name: Kortenjan
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: 'Deveci D, Kortenjan M, Schomaker G. Distributed Heterogeneous Hashing and
Deterministic Dynamical Decompositions. In: Parallel and Distributed Computing
and Systems, Nr. 21. ; 2009.'
apa: Deveci, D., Kortenjan, M., & Schomaker, G. (2009). Distributed Heterogeneous
Hashing and Deterministic Dynamical Decompositions. In Parallel and Distributed
Computing and Systems, Nr. 21.
bibtex: '@inproceedings{Deveci_Kortenjan_Schomaker_2009, title={Distributed Heterogeneous
Hashing and Deterministic Dynamical Decompositions}, booktitle={ Parallel and
Distributed Computing and Systems, Nr. 21}, author={Deveci, Deniz and Kortenjan,
Michael and Schomaker, Gunnar}, year={2009} }'
chicago: Deveci, Deniz, Michael Kortenjan, and Gunnar Schomaker. “Distributed Heterogeneous
Hashing and Deterministic Dynamical Decompositions.” In Parallel and Distributed
Computing and Systems, Nr. 21, 2009.
ieee: D. Deveci, M. Kortenjan, and G. Schomaker, “Distributed Heterogeneous Hashing
and Deterministic Dynamical Decompositions,” in Parallel and Distributed Computing
and Systems, Nr. 21, 2009.
mla: Deveci, Deniz, et al. “Distributed Heterogeneous Hashing and Deterministic
Dynamical Decompositions.” Parallel and Distributed Computing and Systems,
Nr. 21, 2009.
short: 'D. Deveci, M. Kortenjan, G. Schomaker, in: Parallel and Distributed Computing
and Systems, Nr. 21, 2009.'
date_created: 2020-10-06T14:12:26Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
- _id: '70'
language:
- iso: eng
publication: ' Parallel and Distributed Computing and Systems, Nr. 21'
status: public
title: Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '20254'
abstract:
- lang: eng
text: One of the prominent challenges in mobile robotics is to develop control methodologies
that allow the adaptation to dynamic and unforeseen environments. The classic
approach of hand-coded controllers is very efficient for well-defined tasks and
specific environments but poor in adapting to changing environmental conditions.
One alternative approach is the application of evolutionary algorithms which need,
in turn, easily evolvable representations of controllers. In this paper, we investigate
one promising approach of an artificial hormone system as a control paradigm which
is believed to be easily optimized by evolutionary processes. In a first step
of this research, we focus on the simple task of collision avoidance. We present
a brief mathematical analysis of this controller approach and an implementation
of the controller on a mobile robot to check the feasibility in principle of our
approach. The task is successfully accomplished and we conclude with a discussion
of the hormone dynamics in the robot.
author:
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Stradner J, Hamann H, Schmickl T, Crailsheim K. Analysis and implementation
of an Artificial Homeostatic Hormone System: A first case study in robotic hardware.
In: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.
; 2009. doi:10.1109/iros.2009.5354056'
apa: 'Stradner, J., Hamann, H., Schmickl, T., & Crailsheim, K. (2009). Analysis
and implementation of an Artificial Homeostatic Hormone System: A first case study
in robotic hardware. In 2009 IEEE/RSJ International Conference on Intelligent
Robots and Systems. https://doi.org/10.1109/iros.2009.5354056'
bibtex: '@inproceedings{Stradner_Hamann_Schmickl_Crailsheim_2009, title={Analysis
and implementation of an Artificial Homeostatic Hormone System: A first case study
in robotic hardware}, DOI={10.1109/iros.2009.5354056},
booktitle={2009 IEEE/RSJ International Conference on Intelligent Robots and Systems},
author={Stradner, Jürgen and Hamann, Heiko and Schmickl, Thomas and Crailsheim,
Karl}, year={2009} }'
chicago: 'Stradner, Jürgen, Heiko Hamann, Thomas Schmickl, and Karl Crailsheim.
“Analysis and Implementation of an Artificial Homeostatic Hormone System: A First
Case Study in Robotic Hardware.” In 2009 IEEE/RSJ International Conference
on Intelligent Robots and Systems, 2009. https://doi.org/10.1109/iros.2009.5354056.'
ieee: 'J. Stradner, H. Hamann, T. Schmickl, and K. Crailsheim, “Analysis and implementation
of an Artificial Homeostatic Hormone System: A first case study in robotic hardware,”
in 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems,
2009.'
mla: 'Stradner, Jürgen, et al. “Analysis and Implementation of an Artificial Homeostatic
Hormone System: A First Case Study in Robotic Hardware.” 2009 IEEE/RSJ International
Conference on Intelligent Robots and Systems, 2009, doi:10.1109/iros.2009.5354056.'
short: 'J. Stradner, H. Hamann, T. Schmickl, K. Crailsheim, in: 2009 IEEE/RSJ International
Conference on Intelligent Robots and Systems, 2009.'
date_created: 2020-11-02T14:04:46Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/iros.2009.5354056
language:
- iso: eng
publication: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems
publication_identifier:
isbn:
- '9781424438037'
publication_status: published
status: public
title: 'Analysis and implementation of an Artificial Homeostatic Hormone System: A
first case study in robotic hardware'
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '20255'
abstract:
- lang: eng
text: 'By compiling macroscopic models we analyze the adaptive behavior in a swarm
of autonomous robots generated by a bio-inspired, distributed control algorithm.
We developed two macroscopic models by taking two different perspectives: A Stock
& Flow model, which is simple to implement and fast to simulate, and a spatially
resolved model based on diffusion processes. These two models were compared concerning
their prediction quality and their analytical power: One model allowed easy identification
of the major feedback loops governing the swarm behavior. The other model allowed
analysis of the expected shapes and positions of observable robot clusters. We
found a high correlation in the challenges posed by both modeling techniques and
we highlighted the inherent problems of inferring emergent macroscopic rules from
a microscopic description of swarm behavior.'
author:
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: Schmickl T, Hamann H, Wörn H, Crailsheim K. Two different approaches to a macroscopic
model of a bio-inspired robotic swarm. Robotics and Autonomous Systems.
2009;6(9):913-921. doi:10.1016/j.robot.2009.06.002
apa: Schmickl, T., Hamann, H., Wörn, H., & Crailsheim, K. (2009). Two different
approaches to a macroscopic model of a bio-inspired robotic swarm. Robotics
and Autonomous Systems, 6(9), 913–921. https://doi.org/10.1016/j.robot.2009.06.002
bibtex: '@article{Schmickl_Hamann_Wörn_Crailsheim_2009, title={Two different approaches
to a macroscopic model of a bio-inspired robotic swarm}, volume={6}, DOI={10.1016/j.robot.2009.06.002},
number={9}, journal={Robotics and Autonomous Systems}, author={Schmickl, Thomas
and Hamann, Heiko and Wörn, Heinz and Crailsheim, Karl}, year={2009}, pages={913–921}
}'
chicago: 'Schmickl, Thomas, Heiko Hamann, Heinz Wörn, and Karl Crailsheim. “Two
Different Approaches to a Macroscopic Model of a Bio-Inspired Robotic Swarm.”
Robotics and Autonomous Systems 6, no. 9 (2009): 913–21. https://doi.org/10.1016/j.robot.2009.06.002.'
ieee: T. Schmickl, H. Hamann, H. Wörn, and K. Crailsheim, “Two different approaches
to a macroscopic model of a bio-inspired robotic swarm,” Robotics and Autonomous
Systems, vol. 6, no. 9, pp. 913–921, 2009.
mla: Schmickl, Thomas, et al. “Two Different Approaches to a Macroscopic Model of
a Bio-Inspired Robotic Swarm.” Robotics and Autonomous Systems, vol. 6,
no. 9, 2009, pp. 913–21, doi:10.1016/j.robot.2009.06.002.
short: T. Schmickl, H. Hamann, H. Wörn, K. Crailsheim, Robotics and Autonomous Systems
6 (2009) 913–921.
date_created: 2020-11-02T14:07:44Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
doi: 10.1016/j.robot.2009.06.002
intvolume: ' 6'
issue: '9'
language:
- iso: eng
page: 913-921
publication: Robotics and Autonomous Systems
publication_identifier:
issn:
- 0921-8890
publication_status: published
status: public
title: Two different approaches to a macroscopic model of a bio-inspired robotic swarm
type: journal_article
user_id: '15415'
volume: 6
year: '2009'
...
---
_id: '20259'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Inge
full_name: Troch, Inge
last_name: Troch
- first_name: F.
full_name: Breitenecker, F.
last_name: Breitenecker
citation:
ama: 'Hamann H, Troch I, Breitenecker F. Pattern Formation as a Transient Phenomenon
in the Nonlinear Dynamics of a Multi-Agent System. In: MATHMOD 2009 - 6th Vienna
International Conference on Mathematical Modelling. ; 2009.'
apa: Hamann, H., Troch, I., & Breitenecker, F. (2009). Pattern Formation as
a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System. In MATHMOD
2009 - 6th Vienna International Conference on Mathematical Modelling.
bibtex: '@inproceedings{Hamann_Troch_Breitenecker_2009, title={Pattern Formation
as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System},
booktitle={MATHMOD 2009 - 6th Vienna International Conference on Mathematical
Modelling}, author={Hamann, Heiko and Troch, Inge and Breitenecker, F.}, year={2009}
}'
chicago: Hamann, Heiko, Inge Troch, and F. Breitenecker. “Pattern Formation as a
Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System.” In MATHMOD
2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.
ieee: H. Hamann, I. Troch, and F. Breitenecker, “Pattern Formation as a Transient
Phenomenon in the Nonlinear Dynamics of a Multi-Agent System,” in MATHMOD 2009
- 6th Vienna International Conference on Mathematical Modelling, 2009.
mla: Hamann, Heiko, et al. “Pattern Formation as a Transient Phenomenon in the Nonlinear
Dynamics of a Multi-Agent System.” MATHMOD 2009 - 6th Vienna International
Conference on Mathematical Modelling, 2009.
short: 'H. Hamann, I. Troch, F. Breitenecker, in: MATHMOD 2009 - 6th Vienna International
Conference on Mathematical Modelling, 2009.'
date_created: 2020-11-02T14:18:27Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling
status: public
title: Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a
Multi-Agent System
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '17453'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Franz-Josef
full_name: Rammig, Franz-Josef
last_name: Rammig
citation:
ama: 'Meyer auf der Heide F, Rammig F-J. Self-Organisation and Self-Optimization.
Public Service Review: Science and Technology. 2009;04.'
apa: 'Meyer auf der Heide, F., & Rammig, F.-J. (2009). Self-Organisation and
Self-Optimization. Public Service Review: Science and Technology, 04.'
bibtex: '@article{Meyer auf der Heide_Rammig_2009, title={Self-Organisation and
Self-Optimization}, volume={04}, journal={Public Service Review: Science and Technology},
author={Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef}, year={2009} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation
and Self-Optimization.” Public Service Review: Science and Technology 04
(2009).'
ieee: 'F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,”
Public Service Review: Science and Technology, vol. 04, 2009.'
mla: 'Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation
and Self-Optimization.” Public Service Review: Science and Technology,
vol. 04, 2009.'
short: 'F. Meyer auf der Heide, F.-J. Rammig, Public Service Review: Science and
Technology 04 (2009).'
date_created: 2020-07-29T13:51:54Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
intvolume: ' 4'
language:
- iso: eng
publication: 'Public Service Review: Science and Technology'
status: public
title: Self-Organisation and Self-Optimization
type: journal_article
user_id: '15415'
volume: '04'
year: '2009'
...
---
_id: '19031'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
citation:
ama: Briest P. Algorithmische und komplexitätstheoretische Aspekte kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). it
- Information Technology. 2009;51(1):62-65. doi:10.1524/itit.2009.0524
apa: Briest, P. (2009). Algorithmische und komplexitätstheoretische Aspekte kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). It
- Information Technology, 51(1), 62–65. https://doi.org/10.1524/itit.2009.0524
bibtex: '@article{Briest_2009, title={Algorithmische und komplexitätstheoretische
Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial
Pricing Problems)}, volume={51}, DOI={10.1524/itit.2009.0524},
number={1}, journal={it - Information Technology}, author={Briest, Patrick}, year={2009},
pages={62–65} }'
chicago: 'Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte
Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing
Problems).” It - Information Technology 51, no. 1 (2009): 62–65. https://doi.org/10.1524/itit.2009.0524.'
ieee: P. Briest, “Algorithmische und komplexitätstheoretische Aspekte kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems),” it
- Information Technology, vol. 51, no. 1, pp. 62–65, 2009.
mla: Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).” It
- Information Technology, vol. 51, no. 1, 2009, pp. 62–65, doi:10.1524/itit.2009.0524.
short: P. Briest, It - Information Technology 51 (2009) 62–65.
date_created: 2020-09-04T12:05:57Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1524/itit.2009.0524
intvolume: ' 51'
issue: '1'
language:
- iso: eng
page: 62-65
publication: it - Information Technology
publication_identifier:
issn:
- 1611-2776
publication_status: published
status: public
title: Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung
(Computational Aspects of Combinatorial Pricing Problems)
type: journal_article
user_id: '15415'
volume: 51
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: Lecture Notes in Computer Science. Berlin, Heidelberg;
2009. doi:10.1007/978-3-642-10841-9_6'
apa: Briest, P., Hoefer, M., Gualà, L., & Ventre, C. (2009). On Stackelberg
Pricing with Computationally Bounded Consumers. In Lecture Notes in Computer
Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_6
bibtex: '@inbook{Briest_Hoefer_Gualà_Ventre_2009, place={Berlin, Heidelberg}, title={On
Stackelberg Pricing with Computationally Bounded Consumers}, DOI={10.1007/978-3-642-10841-9_6},
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 Lecture Notes
in Computer Science. Berlin, Heidelberg, 2009. https://doi.org/10.1007/978-3-642-10841-9_6.
ieee: P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with
Computationally Bounded Consumers,” in Lecture Notes in Computer Science,
Berlin, Heidelberg, 2009.
mla: Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded
Consumers.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.
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: '18138'
abstract:
- lang: eng
text: Modern companies are nowadays confronted with an increasing demand of multiple
products, where they need to perform more flexible every day. Cost-intensive decisions
are to be confirmed in short times, in order to minimize risks and secure efficient
production programs as well as material flows. Tools for this digital planning
via simulation methods are one well established possibility to receive decision
support. Nevertheless, the creation of the necessary simulation models is a complicated
and error-prone process, where complexity of modeling, validation and verification
depends on the used tool and its functionalities. This paper presents implemented
concepts for an innovative user support in his tasks of verification and validation
of simulation models during the execution of a simulation run. Time-intensive
procedures like stopping simulation, parameterization and restarting within the
problem analysis are simplified. So the user is able to focus on the real problem
solving task.
author:
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation
during Simulation Runtime. In: European Simulation and Modelling Conference
(ESM 2009). EUROSIS-ETI; 2009.'
apa: Laroque, C., Fischer, M., & Dangelmaier, W. (2009). Concepts for Model
Verification and Validation during Simulation Runtime. In European Simulation
and Modelling Conference (ESM 2009). EUROSIS-ETI.
bibtex: '@inproceedings{Laroque_Fischer_Dangelmaier_2009, title={Concepts for Model
Verification and Validation during Simulation Runtime}, booktitle={European Simulation
and Modelling Conference (ESM 2009)}, publisher={EUROSIS-ETI}, author={Laroque,
Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2009} }'
chicago: Laroque, Christoph, Matthias Fischer, and Wilhelm Dangelmaier. “Concepts
for Model Verification and Validation during Simulation Runtime.” In European
Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI, 2009.
ieee: C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification
and Validation during Simulation Runtime,” in European Simulation and Modelling
Conference (ESM 2009), 2009.
mla: Laroque, Christoph, et al. “Concepts for Model Verification and Validation
during Simulation Runtime.” European Simulation and Modelling Conference (ESM
2009), EUROSIS-ETI, 2009.
short: 'C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling
Conference (ESM 2009), EUROSIS-ETI, 2009.'
date_created: 2020-08-24T07:28:23Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
publication: European Simulation and Modelling Conference (ESM 2009)
publisher: EUROSIS-ETI
status: public
title: Concepts for Model Verification and Validation during Simulation Runtime
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '18291'
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Huber, Daniel
last_name: Huber
- first_name: 'Christoph '
full_name: 'Laroque, Christoph '
last_name: Laroque
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Suess T, Fischer M, Huber D, Laroque C, Dangelmaier W. Ein System zur aggregierten
Visualisierung verteilter Materialflusssimulationen. In: Augmented & Virtual
Reality in Der Produktentstehung. Vol 252. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2009:111--126.'
apa: Suess, T., Fischer, M., Huber, D., Laroque, C., & Dangelmaier, W. (2009).
Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen.
In Augmented & Virtual Reality in der Produktentstehung (Vol. 252,
pp. 111--126). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@inbook{Suess_Fischer_Huber_Laroque_Dangelmaier_2009, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Ein System zur aggregierten Visualisierung
verteilter Materialflusssimulationen}, volume={252}, booktitle={Augmented &
Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn}, author={Suess, Tim and Fischer, Matthias
and Huber, Daniel and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2009},
pages={111--126}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Suess, Tim, Matthias Fischer, Daniel Huber, Christoph Laroque, and Wilhelm
Dangelmaier. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.”
In Augmented & Virtual Reality in Der Produktentstehung, 252:111--126.
Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009.
ieee: T. Suess, M. Fischer, D. Huber, C. Laroque, and W. Dangelmaier, “Ein System
zur aggregierten Visualisierung verteilter Materialflusssimulationen,” in Augmented
& Virtual Reality in der Produktentstehung, vol. 252, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.
mla: Suess, Tim, et al. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.”
Augmented & Virtual Reality in Der Produktentstehung, vol. 252, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.
short: 'T. Suess, M. Fischer, D. Huber, C. Laroque, W. Dangelmaier, in: Augmented
& Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 2009, pp. 111--126.'
date_created: 2020-08-25T14:25:41Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 252'
language:
- iso: eng
page: 111--126
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen
type: book_chapter
user_id: '5786'
volume: 252
year: '2009'
...
---
_id: '18346'
abstract:
- lang: eng
text: "For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition
p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others)
from p? The present work explores the trade-off between query time\r\nand preprocessing
space for these quantities in 2D: exactly, in the approximate\r\ndeterministic,
and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space
data structure for S that, given p and time O(log n), allows\r\nto approximate
the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here
m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically
is just linear in the size n of the scene S. On the other hand,\r\nwe present
a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing
time and space with similar approximation properties and query\r\ntime O(k*polylog
n), where kProc. 25th European Workshop on Computational Geometry. ;
2009:203-206.'
apa: Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler,
M. (2009). Planar Visibility Counting. In Proc. 25th European Workshop on Computational
Geometry (pp. 203–206).
bibtex: '@inproceedings{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2009, title={Planar
Visibility Counting}, booktitle={Proc. 25th European Workshop on Computational
Geometry}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and
Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2009}, pages={203–206}
}'
chicago: Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf
der Heide, and Martin Ziegler. “Planar Visibility Counting.” In Proc. 25th
European Workshop on Computational Geometry, 203–6, 2009.
ieee: M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar
Visibility Counting,” in Proc. 25th European Workshop on Computational Geometry,
2009, pp. 203–206.
mla: Fischer, Matthias, et al. “Planar Visibility Counting.” Proc. 25th European
Workshop on Computational Geometry, 2009, pp. 203–06.
short: 'M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, in:
Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206.'
date_created: 2020-08-26T08:49:50Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '63'
language:
- iso: eng
page: 203-206
publication: Proc. 25th European Workshop on Computational Geometry
status: public
title: Planar Visibility Counting
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '16429'
author:
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Kutyłowski J, Meyer auf der Heide F. Optimal strategies for maintaining a chain
of relays between an explorer and a base camp. Theoretical Computer Science.
2009:3391-3405. doi:10.1016/j.tcs.2008.04.010
apa: Kutyłowski, J., & Meyer auf der Heide, F. (2009). Optimal strategies for
maintaining a chain of relays between an explorer and a base camp. Theoretical
Computer Science, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010
bibtex: '@article{Kutyłowski_Meyer auf der Heide_2009, title={Optimal strategies
for maintaining a chain of relays between an explorer and a base camp}, DOI={10.1016/j.tcs.2008.04.010},
journal={Theoretical Computer Science}, author={Kutyłowski, Jarosław and Meyer
auf der Heide, Friedhelm}, year={2009}, pages={3391–3405} }'
chicago: Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies
for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical
Computer Science, 2009, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010.
ieee: J. Kutyłowski and F. Meyer auf der Heide, “Optimal strategies for maintaining
a chain of relays between an explorer and a base camp,” Theoretical Computer
Science, pp. 3391–3405, 2009.
mla: Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies
for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical
Computer Science, 2009, pp. 3391–405, doi:10.1016/j.tcs.2008.04.010.
short: J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009)
3391–3405.
date_created: 2020-04-06T13:52:18Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2008.04.010
language:
- iso: eng
page: 3391-3405
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Optimal strategies for maintaining a chain of relays between an explorer and
a base camp
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '16430'
author:
- first_name: Jan
full_name: Mehler, Jan
last_name: Mehler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Mehler J, Meyer auf der Heide F. Power-aware online file allocation in mobile
ad hoc networks. In: Proceedings of the Twenty-First Annual Symposium on Parallelism
in Algorithms and Architectures - SPAA ’09. ; 2009. doi:10.1145/1583991.1584072'
apa: Mehler, J., & Meyer auf der Heide, F. (2009). Power-aware online file allocation
in mobile ad hoc networks. In Proceedings of the twenty-first annual symposium
on Parallelism in algorithms and architectures - SPAA ’09. https://doi.org/10.1145/1583991.1584072
bibtex: '@inproceedings{Mehler_Meyer auf der Heide_2009, title={Power-aware online
file allocation in mobile ad hoc networks}, DOI={10.1145/1583991.1584072},
booktitle={Proceedings of the twenty-first annual symposium on Parallelism in
algorithms and architectures - SPAA ’09}, author={Mehler, Jan and Meyer auf der
Heide, Friedhelm}, year={2009} }'
chicago: Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File
Allocation in Mobile Ad Hoc Networks.” In Proceedings of the Twenty-First Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.
https://doi.org/10.1145/1583991.1584072.
ieee: J. Mehler and F. Meyer auf der Heide, “Power-aware online file allocation
in mobile ad hoc networks,” in Proceedings of the twenty-first annual symposium
on Parallelism in algorithms and architectures - SPAA ’09, 2009.
mla: Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation
in Mobile Ad Hoc Networks.” Proceedings of the Twenty-First Annual Symposium
on Parallelism in Algorithms and Architectures - SPAA ’09, 2009, doi:10.1145/1583991.1584072.
short: 'J. Mehler, F. Meyer auf der Heide, in: Proceedings of the Twenty-First Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.'
date_created: 2020-04-06T13:53:57Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1583991.1584072
language:
- iso: eng
publication: Proceedings of the twenty-first annual symposium on Parallelism in algorithms
and architectures - SPAA '09
publication_identifier:
isbn:
- '9781605586069'
publication_status: published
status: public
title: Power-aware online file allocation in mobile ad hoc networks
type: conference
user_id: '15415'
year: '2009'
...