---
_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'
...
---
_id: '16431'
citation:
ama: Meyer auf der Heide F, Bender MA, eds. Proceedings of the Twenty-First Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’09.; 2009.
doi:10.1145/1583991
apa: Meyer auf der Heide, F., & Bender, M. A. (Eds.). (2009). Proceedings
of the twenty-first annual symposium on Parallelism in algorithms and architectures
- SPAA ’09. https://doi.org/10.1145/1583991
bibtex: '@book{Meyer auf der Heide_Bender_2009, title={Proceedings of the twenty-first
annual symposium on Parallelism in algorithms and architectures - SPAA ’09}, DOI={10.1145/1583991}, year={2009} }'
chicago: Meyer auf der Heide, Friedhelm, and Michael A. Bender, eds. Proceedings
of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’09, 2009. https://doi.org/10.1145/1583991.
ieee: F. Meyer auf der Heide and M. A. Bender, Eds., Proceedings of the twenty-first
annual symposium on Parallelism in algorithms and architectures - SPAA ’09.
2009.
mla: Meyer auf der Heide, Friedhelm, and Michael A. Bender, editors. Proceedings
of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’09. 2009, doi:10.1145/1583991.
short: F. Meyer auf der Heide, M.A. Bender, eds., Proceedings of the Twenty-First
Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.
date_created: 2020-04-06T13:55:23Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1583991
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael A.
full_name: Bender, Michael A.
last_name: Bender
language:
- iso: eng
publication_identifier:
isbn:
- '9781605586069'
publication_status: published
status: public
title: Proceedings of the twenty-first annual symposium on Parallelism in algorithms
and architectures - SPAA '09
type: conference_editor
user_id: '15415'
year: '2009'
...
---
_id: '16398'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Jaroslaw
full_name: Byrka, Jaroslaw
last_name: Byrka
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Bienkowski M, Byrka J, Korzeniowski M, Meyer auf der Heide F. Optimal algorithms
for page migration in dynamic networks. Journal of Discrete Algorithms.
2009:545-569. doi:10.1016/j.jda.2008.07.006
apa: Bienkowski, M., Byrka, J., Korzeniowski, M., & Meyer auf der Heide, F.
(2009). Optimal algorithms for page migration in dynamic networks. Journal
of Discrete Algorithms, 545–569. https://doi.org/10.1016/j.jda.2008.07.006
bibtex: '@article{Bienkowski_Byrka_Korzeniowski_Meyer auf der Heide_2009, title={Optimal
algorithms for page migration in dynamic networks}, DOI={10.1016/j.jda.2008.07.006},
journal={Journal of Discrete Algorithms}, author={Bienkowski, Marcin and Byrka,
Jaroslaw and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2009},
pages={545–569} }'
chicago: Bienkowski, Marcin, Jaroslaw Byrka, Miroslaw Korzeniowski, and Friedhelm
Meyer auf der Heide. “Optimal Algorithms for Page Migration in Dynamic Networks.”
Journal of Discrete Algorithms, 2009, 545–69. https://doi.org/10.1016/j.jda.2008.07.006.
ieee: M. Bienkowski, J. Byrka, M. Korzeniowski, and F. Meyer auf der Heide, “Optimal
algorithms for page migration in dynamic networks,” Journal of Discrete Algorithms,
pp. 545–569, 2009.
mla: Bienkowski, Marcin, et al. “Optimal Algorithms for Page Migration in Dynamic
Networks.” Journal of Discrete Algorithms, 2009, pp. 545–69, doi:10.1016/j.jda.2008.07.006.
short: M. Bienkowski, J. Byrka, M. Korzeniowski, F. Meyer auf der Heide, Journal
of Discrete Algorithms (2009) 545–569.
date_created: 2020-04-03T10:40:45Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.jda.2008.07.006
language:
- iso: eng
page: 545-569
publication: Journal of Discrete Algorithms
publication_identifier:
issn:
- 1570-8667
publication_status: published
status: public
title: Optimal algorithms for page migration in dynamic networks
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '19615'
author:
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: Schomaker G. Distributed Resource Allocation and Management in Heterogeneous
Networks. Vol 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2008.
apa: Schomaker, G. (2008). Distributed Resource Allocation and Management in
Heterogeneous Networks (Vol. 259). Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn.
bibtex: '@book{Schomaker_2008, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Distributed Resource Allocation and Management in Heterogeneous
Networks}, volume={259}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Schomaker, Gunnar}, year={2008}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Schomaker, Gunnar. Distributed Resource Allocation and Management in
Heterogeneous Networks. Vol. 259. Verlagsschriftenreihe Des Heinz Nixdorf
Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008.
ieee: G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous
Networks, vol. 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008.
mla: Schomaker, Gunnar. Distributed Resource Allocation and Management in Heterogeneous
Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
short: G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous
Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
date_created: 2020-09-22T08:10:41Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 259'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-78-1
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-20090114013
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: Distributed Resource Allocation and Management in Heterogeneous Networks
type: dissertation
user_id: '5786'
volume: 259
year: '2008'
...
---
_id: '19686'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
citation:
ama: 'Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP).
; 2008. doi:10.1007/978-3-540-70575-8_66'
apa: Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP).
https://doi.org/10.1007/978-3-540-70575-8_66
bibtex: '@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing
Problem}, DOI={10.1007/978-3-540-70575-8_66},
booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages
and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }'
chicago: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In
Proceedings of the 35th InternationalColloquium on Automata, Languages and
Programming (ICALP), 2008. https://doi.org/10.1007/978-3-540-70575-8_66.
ieee: P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP),
2008.
mla: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP),
2008, doi:10.1007/978-3-540-70575-8_66.
short: 'P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata,
Languages and Programming (ICALP), 2008.'
date_created: 2020-09-25T09:45:40Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-540-70575-8_66
language:
- iso: eng
publication: Proceedings of the 35th InternationalColloquium on Automata, Languages
and Programming (ICALP)
publication_identifier:
isbn:
- '9783540705741'
- '9783540705758'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Uniform Budgets and the Envy-Free Pricing Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19687'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
- first_name: Moshe
full_name: Babaioff, Moshe
last_name: Babaioff
citation:
ama: 'Briest P, Krysta P, Babaioff M. On the Approximability of Combinatorial Exchange
Problems. In: Proceedings of the 1st International Symposium on Algorithmic
Game Theory (SAGT). Cham; 2008. doi:https://doi.org/10.1007/978-3-540-79309-0_9'
apa: Briest, P., Krysta, P., & Babaioff, M. (2008). On the Approximability of
Combinatorial Exchange Problems. In Proceedings of the 1st International Symposium
on Algorithmic Game Theory (SAGT). Cham. https://doi.org/10.1007/978-3-540-79309-0_9
bibtex: '@inproceedings{Briest_Krysta_Babaioff_2008, place={Cham}, title={On the
Approximability of Combinatorial Exchange Problems}, DOI={https://doi.org/10.1007/978-3-540-79309-0_9},
booktitle={Proceedings of the 1st International Symposium on Algorithmic Game
Theory (SAGT)}, author={Briest, Patrick and Krysta, Piotr and Babaioff, Moshe},
year={2008} }'
chicago: Briest, Patrick, Piotr Krysta, and Moshe Babaioff. “On the Approximability
of Combinatorial Exchange Problems.” In Proceedings of the 1st International
Symposium on Algorithmic Game Theory (SAGT). Cham, 2008. https://doi.org/10.1007/978-3-540-79309-0_9.
ieee: P. Briest, P. Krysta, and M. Babaioff, “On the Approximability of Combinatorial
Exchange Problems,” in Proceedings of the 1st International Symposium on Algorithmic
Game Theory (SAGT), 2008.
mla: Briest, Patrick, et al. “On the Approximability of Combinatorial Exchange Problems.”
Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT),
2008, doi:https://doi.org/10.1007/978-3-540-79309-0_9.
short: 'P. Briest, P. Krysta, M. Babaioff, in: Proceedings of the 1st International
Symposium on Algorithmic Game Theory (SAGT), Cham, 2008.'
date_created: 2020-09-25T09:49:43Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: https://doi.org/10.1007/978-3-540-79309-0_9
language:
- iso: eng
place: Cham
publication: Proceedings of the 1st International Symposium on Algorithmic Game Theory
(SAGT)
publication_status: published
status: public
title: On the Approximability of Combinatorial Exchange Problems
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19688'
abstract:
- lang: eng
text: "We study the problem of computing approximate Nash equilibria (epsilon-Nash\r\nequilibria)
in normal form games, where the number of players is a small\r\nconstant. We consider
the approach of looking for solutions with constant\r\nsupport size. It is known
from recent work that in the 2-player case, a\r\n1/2-Nash equilibrium can be easily
found, but in general one cannot achieve a\r\nsmaller value of epsilon than 1/2.
In this paper we extend those results to the\r\nk-player case, and find that epsilon
= 1-1/k is feasible, but cannot be\r\nimproved upon. We show how stronger results
for the 2-player case may be used\r\nin order to slightly improve upon the epsilon
= 1-1/k obtained in the k-player\r\ncase."
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Paul W.
full_name: Goldberg, Paul W.
last_name: Goldberg
- first_name: Heiko
full_name: Roeglin, Heiko
last_name: Roeglin
citation:
ama: Briest P, Goldberg PW, Roeglin H. Approximate Equilibria in Games with Few
Players.; 2008.
apa: Briest, P., Goldberg, P. W., & Roeglin, H. (2008). Approximate Equilibria
in Games with Few Players.
bibtex: '@book{Briest_Goldberg_Roeglin_2008, title={Approximate Equilibria in Games
with Few Players}, author={Briest, Patrick and Goldberg, Paul W. and Roeglin,
Heiko}, year={2008} }'
chicago: Briest, Patrick, Paul W. Goldberg, and Heiko Roeglin. Approximate Equilibria
in Games with Few Players, 2008.
ieee: P. Briest, P. W. Goldberg, and H. Roeglin, Approximate Equilibria in Games
with Few Players. 2008.
mla: Briest, Patrick, et al. Approximate Equilibria in Games with Few Players.
2008.
short: P. Briest, P.W. Goldberg, H. Roeglin, Approximate Equilibria in Games with
Few Players, 2008.
date_created: 2020-09-25T09:52:57Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
external_id:
arxiv:
- '0804.4524 '
language:
- iso: eng
status: public
title: Approximate Equilibria in Games with Few Players
type: report
user_id: '15415'
year: '2008'
...
---
_id: '19812'
abstract:
- lang: eng
text: 'Modern peer-to-peer networks consist of several network layers and distributed
algorithms providing features like indexing, resource balancing, entry protocols,
security, anonymity, and cryptography. Since peer-to-peer networks are highly
dynamic, a fundamental task in the design of these networks is to provide high
connectivity. We propose a solution by distributed random link exchange algorithms
such that the overlay network can be a connected random graph or use a random
graph as backbone. Random graphs are expander graphs have logarithmic diameter,
high node connectivity, excellent communication properties, and are expander graphs
with high probability. In summary: they are an excellent choice to improve the
stability and robustness of a dynamic network.'
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
citation:
ama: 'Schindelhauer C, Mahlmann P. Random Graphs for Peer-to-Peer Overlays. In:
The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2008:1-22.'
apa: Schindelhauer, C., & Mahlmann, P. (2008). Random Graphs for Peer-to-Peer
Overlays. The European Integrated Project "Dynamically Evolving, Large Scale
Information Systems (DELIS), Proceedings of the Final Workshop, 222,
1–22.
bibtex: '@inproceedings{Schindelhauer_Mahlmann_2008, title={Random Graphs for Peer-to-Peer
Overlays}, number={222}, booktitle={The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schindelhauer,
Christian and Mahlmann, Peter}, year={2008}, pages={1–22} }'
chicago: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
Overlays.” In The European Integrated Project "Dynamically Evolving, Large
Scale Information Systems (DELIS), Proceedings of the Final Workshop, 1–22.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
ieee: C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,”
in The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop, 2008, no. 222, pp. 1–22.
mla: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
Overlays.” The European Integrated Project "Dynamically Evolving, Large Scale
Information Systems (DELIS), Proceedings of the Final Workshop, no. 222, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.
short: 'C. Schindelhauer, P. Mahlmann, in: The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.'
date_created: 2020-09-30T13:24:15Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '26'
issue: '222'
language:
- iso: eng
page: 1-22
publication: The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Random Graphs for Peer-to-Peer Overlays
type: conference
user_id: '5786'
year: '2008'
...
---
_id: '19813'
abstract:
- lang: eng
text: 'Autonomous robotic systems have been gaining the attention of research community
in mobile ad hoc network since the past few years. While motion cost and communications
cost constitute the primary energy consumers, each of them is investigated independently.
By taking into account the power consumption of both entities, the overall energy
efficiency of a system can be further improved. In this paper, the energy optimization
problem of radio communication and motion is examined. We consider a hybrid wireless network
that consists of a single autonomous mobile node and multiple relay nodes. The
mobile node interacts with the relays within its vicinity by continuously communicating
high-bandwidth data, e.g. triggered by a multimedia application like video surveillance.
The goal is to find the best path such that the energy consumption for both mobility
and communications is minimized. We introduce the Radio-Energy-Aware (REA) path
computation strategy by utilizing node mobility. Given the starting point, the
target point and the position of the relays, our simulation results show that
the proposed strategy improves the energy efficiency of mobile node compared to
the Motion-Energy-Aware (MEA) path constructed based only on the mobility cost. '
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. Detours Save Energy in Mobile Wireless Networks.
In: MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008). Springer;
2008. doi:10.1007/978-0-387-84839-6_6'
apa: 'Ooi, C. C., & Schindelhauer, C. (2008). Detours Save Energy in Mobile
Wireless Networks. In MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
2008). Springer. https://doi.org/10.1007/978-0-387-84839-6_6'
bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Detours Save Energy in Mobile
Wireless Networks}, DOI={10.1007/978-0-387-84839-6_6},
booktitle={MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)}, publisher={Springer},
author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2008} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in
Mobile Wireless Networks.” In MWCN’08: Proc. of IFIP Joint Conference on Mobile
Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
(PWC 2008). Springer, 2008. https://doi.org/10.1007/978-0-387-84839-6_6.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Detours Save Energy in Mobile Wireless Networks,”
in MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), 2008.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile
Wireless Networks.” MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
2008), Springer, 2008, doi:10.1007/978-0-387-84839-6_6.'
short: 'C.C. Ooi, C. Schindelhauer, in: MWCN’08: Proc. of IFIP Joint Conference
on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
(PWC 2008), Springer, 2008.'
date_created: 2020-09-30T13:27:54Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-0-387-84839-6_6
language:
- iso: eng
publication: 'MWCN''08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)'
publication_identifier:
isbn:
- '9780387848389'
- '9780387848396'
issn:
- 1571-5736
publication_status: published
publisher: Springer
status: public
title: Detours Save Energy in Mobile Wireless Networks
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19832'
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. Energy-Efficient Distributed Target Tracking Using
Wireless Relay Robots. In: ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008). ; 2008. doi:10.1007/978-3-642-00644-9_4'
apa: 'Ooi, C. C., & Schindelhauer, C. (2008). Energy-Efficient Distributed Target
Tracking Using Wireless Relay Robots. In ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008). https://doi.org/10.1007/978-3-642-00644-9_4'
bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots}, DOI={10.1007/978-3-642-00644-9_4},
booktitle={ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous
Robotic Systems (DARS 2008)}, author={Ooi, Chia Ching and Schindelhauer, Christian},
year={2008} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots.” In ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008. https://doi.org/10.1007/978-3-642-00644-9_4.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Energy-Efficient Distributed Target Tracking
Using Wireless Relay Robots,” in ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008), 2008.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots.” ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008, doi:10.1007/978-3-642-00644-9_4.'
short: 'C.C. Ooi, C. Schindelhauer, in: ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008), 2008.'
date_created: 2020-10-01T10:14:06Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-3-642-00644-9_4
language:
- iso: eng
publication: 'ARS''08: Proc. of the 9th International Symposium on Distributed Autonomous
Robotic Systems (DARS 2008)'
publication_identifier:
isbn:
- '9783642006432'
- '9783642006449'
publication_status: published
status: public
title: Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19950'
author:
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: Pietrzyk P. Lokale Strategien Zur Optimierung von Kommunikationsketten.;
2008.
apa: Pietrzyk, P. (2008). Lokale Strategien zur Optimierung von Kommunikationsketten.
bibtex: '@book{Pietrzyk_2008, title={Lokale Strategien zur Optimierung von Kommunikationsketten},
author={Pietrzyk, Peter}, year={2008} }'
chicago: Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten,
2008.
ieee: P. Pietrzyk, Lokale Strategien zur Optimierung von Kommunikationsketten.
2008.
mla: Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten.
2008.
short: P. Pietrzyk, Lokale Strategien Zur Optimierung von Kommunikationsketten,
2008.
date_created: 2020-10-07T14:23:26Z
date_updated: 2022-01-06T06:54:16Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-10-07T14:22:49Z
date_updated: 2020-10-07T14:22:49Z
file_id: '19951'
file_name: pub-hni-3364.pdf
file_size: 638802
relation: main_file
success: 1
file_date_updated: 2020-10-07T14:22:49Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Lokale Strategien zur Optimierung von Kommunikationsketten
type: mastersthesis
user_id: '15415'
year: '2008'
...
---
_id: '20262'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: Hamann H. Space-Time Continuous Models of Swarm Robotic Systems.; 2008.
doi:10.1007/978-3-642-13377-0
apa: Hamann, H. (2008). Space-Time Continuous Models of Swarm Robotic Systems.
https://doi.org/10.1007/978-3-642-13377-0
bibtex: '@book{Hamann_2008, title={Space-Time Continuous Models of Swarm Robotic
Systems}, DOI={10.1007/978-3-642-13377-0},
author={Hamann, Heiko}, year={2008} }'
chicago: Hamann, Heiko. Space-Time Continuous Models of Swarm Robotic Systems,
2008. https://doi.org/10.1007/978-3-642-13377-0.
ieee: H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems. 2008.
mla: Hamann, Heiko. Space-Time Continuous Models of Swarm Robotic Systems.
2008, doi:10.1007/978-3-642-13377-0.
short: H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems, 2008.
date_created: 2020-11-02T14:23:36Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-13377-0
language:
- iso: eng
publication_identifier:
isbn:
- '9783642133763'
- '9783642133770'
issn:
- 1867-4925
- 1867-4933
publication_status: published
status: public
title: Space-Time Continuous Models of Swarm Robotic Systems
type: dissertation
user_id: '15415'
year: '2008'
...
---
_id: '26235'
abstract:
- lang: eng
text: "Kolmogorov Complexity constitutes an integral part of computability theory,\r\ninformation
theory, and computational complexity theory -- in the discrete\r\nsetting of bits
and Turing machines. Over real numbers, on the other hand, the\r\nBSS-machine
(aka real-RAM) has been established as a major model of\r\ncomputation. This real
realm has turned out to exhibit natural counterparts to\r\nmany notions and results
in classical complexity and recursion theory; although\r\nusually with considerably
different proofs. The present work investigates\r\nsimilarities and differences
between discrete and real Kolmogorov Complexity as\r\nintroduced by Montana and
Pardo (1998)."
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Wouter M.
full_name: Koolen, Wouter M.
last_name: Koolen
citation:
ama: Ziegler M, Koolen WM. Kolmogorov Complexity Theory over the Reals. arXiv:08022027.
Published online 2008.
apa: Ziegler, M., & Koolen, W. M. (2008). Kolmogorov Complexity Theory over
the Reals. In arXiv:0802.2027.
bibtex: '@article{Ziegler_Koolen_2008, title={Kolmogorov Complexity Theory over
the Reals}, journal={arXiv:0802.2027}, author={Ziegler, Martin and Koolen, Wouter
M.}, year={2008} }'
chicago: Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over
the Reals.” ArXiv:0802.2027, 2008.
ieee: M. Ziegler and W. M. Koolen, “Kolmogorov Complexity Theory over the Reals,”
arXiv:0802.2027. 2008.
mla: Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over the
Reals.” ArXiv:0802.2027, 2008.
short: M. Ziegler, W.M. Koolen, ArXiv:0802.2027 (2008).
date_created: 2021-10-15T09:34:19Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:0802.2027
status: public
title: Kolmogorov Complexity Theory over the Reals
type: preprint
user_id: '15415'
year: '2008'
...
---
_id: '26243'
abstract:
- lang: eng
text: "Operations on univariate dense polynomials—multiplication, division with
remainder, multipoint\r\nevaluation—constitute central primitives entering as
build-up blocks into many higher applications and\r\nalgorithms. Fast Fourier
Transform permits to accelerate them from naive quadratic to running time\r\nO(n·polylogn),
that is softly linear in the degree n of the input. This is routinely employed
in complexity\r\ntheoretic considerations and, over integers and finite fields,
in practical number theoretic calculations.\r\nThe present work explores the benefit
of fast polynomial arithmetic over the field of real numbers\r\nwhere the precision
of approximation becomes crucial. To this end, we study the computability of the\r\nabove
operations in the sense of Recursive Analysis as an effective refinement of continuity.
This theo-\r\nretical worst-case stability analysis is then complemented by an
empirical evaluation: We use GMP and\r\nthe iRRAM to find the precision required
for the intermediate calculations in order to achieve a desired\r\noutput accuracy."
author:
- first_name: Sven
full_name: Köhler, Sven
last_name: Köhler
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Köhler S, Ziegler M. On the Stability of Fast Polynomial Arithmetic. In: Proc.
8th Conference on Real Numbers and Computers. ; 2008:147-156.'
apa: Köhler, S., & Ziegler, M. (2008). On the Stability of Fast Polynomial Arithmetic.
Proc. 8th Conference on Real Numbers and Computers, 147–156.
bibtex: '@inproceedings{Köhler_Ziegler_2008, title={On the Stability of Fast Polynomial
Arithmetic}, booktitle={Proc. 8th Conference on Real Numbers and Computers}, author={Köhler,
Sven and Ziegler, Martin}, year={2008}, pages={147–156} }'
chicago: Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial
Arithmetic.” In Proc. 8th Conference on Real Numbers and Computers, 147–56,
2008.
ieee: S. Köhler and M. Ziegler, “On the Stability of Fast Polynomial Arithmetic,”
in Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–156.
mla: Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial Arithmetic.”
Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–56.
short: 'S. Köhler, M. Ziegler, in: Proc. 8th Conference on Real Numbers and Computers,
2008, pp. 147–156.'
date_created: 2021-10-15T09:57:36Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
language:
- iso: eng
page: 147-156
publication: Proc. 8th Conference on Real Numbers and Computers
status: public
title: On the Stability of Fast Polynomial Arithmetic
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '26255'
abstract:
- lang: eng
text: "We turn the physical Church-Turing Hypothesis from an ambiguous source of
sensational\r\nspeculations into a (collection of) sound and well-defined scientific
problem(s):\r\nExamining recent controversies and causes for misunderstanding
concerning the state of the Church-\r\nTuring Hypothesis (CTH), it is suggested
to study the CTH ‘sharpened’ relative to an arbitrary but\r\nspecific physical
theory—rather than vaguely referring to “nature” in general. For this purpose
we\r\ncombine physical structuralism with computational complexity theory. The
benefits of this approach\r\nare illustrated by some exemplary results on computability
and complexity in computational physics."
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Physically-Relativized Church-Turing Hypotheses. Applied Mathematics
and Computation. Published online 2008.
apa: Ziegler, M. (2008). Physically-Relativized Church-Turing Hypotheses. Applied
Mathematics and Computation.
bibtex: '@article{Ziegler_2008, title={Physically-Relativized Church-Turing Hypotheses},
journal={Applied Mathematics and Computation}, author={Ziegler, Martin}, year={2008}
}'
chicago: Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” Applied
Mathematics and Computation, 2008.
ieee: M. Ziegler, “Physically-Relativized Church-Turing Hypotheses,” Applied
Mathematics and Computation, 2008.
mla: Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” Applied
Mathematics and Computation, 2008.
short: M. Ziegler, Applied Mathematics and Computation (2008).
date_created: 2021-10-15T10:10:04Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
external_id:
arxiv:
- '0805.1292'
language:
- iso: eng
publication: Applied Mathematics and Computation
status: public
title: Physically-Relativized Church-Turing Hypotheses
type: journal_article
user_id: '15415'
year: '2008'
...
---
_id: '26262'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. A Meta-Theory of Physics and Computation. In: Verhandlungen
Der Deutschen Physikalischen Gesellschaft. Deutsche Physikalische Gesellschaft
(DPG); 2008:145.'
apa: Ziegler, M. (2008). A Meta-Theory of Physics and Computation. In Verhandlungen
der Deutschen Physikalischen Gesellschaft (p. 145). Deutsche Physikalische
Gesellschaft (DPG).
bibtex: '@inbook{Ziegler_2008, title={A Meta-Theory of Physics and Computation},
booktitle={Verhandlungen der Deutschen Physikalischen Gesellschaft}, publisher={Deutsche
Physikalische Gesellschaft (DPG)}, author={Ziegler, Martin}, year={2008}, pages={145}
}'
chicago: Ziegler, Martin. “A Meta-Theory of Physics and Computation.” In Verhandlungen
Der Deutschen Physikalischen Gesellschaft, 145. Deutsche Physikalische Gesellschaft
(DPG), 2008.
ieee: M. Ziegler, “A Meta-Theory of Physics and Computation,” in Verhandlungen
der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft
(DPG), 2008, p. 145.
mla: Ziegler, Martin. “A Meta-Theory of Physics and Computation.” Verhandlungen
Der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft
(DPG), 2008, p. 145.
short: 'M. Ziegler, in: Verhandlungen Der Deutschen Physikalischen Gesellschaft,
Deutsche Physikalische Gesellschaft (DPG), 2008, p. 145.'
date_created: 2021-10-15T10:35:55Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: '145'
publication: Verhandlungen der Deutschen Physikalischen Gesellschaft
publisher: Deutsche Physikalische Gesellschaft (DPG)
status: public
title: A Meta-Theory of Physics and Computation
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '26280'
author:
- first_name: Klaus
full_name: Meer, Klaus
last_name: Meer
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Meer K, Ziegler M. An explicit solution to Post’s Problem over the reals. Journal
of Complexity. Published online 2008:3-15. doi:10.1016/j.jco.2006.09.004
apa: Meer, K., & Ziegler, M. (2008). An explicit solution to Post’s Problem
over the reals. Journal of Complexity, 3–15. https://doi.org/10.1016/j.jco.2006.09.004
bibtex: '@article{Meer_Ziegler_2008, title={An explicit solution to Post’s Problem
over the reals}, DOI={10.1016/j.jco.2006.09.004},
journal={Journal of Complexity}, author={Meer, Klaus and Ziegler, Martin}, year={2008},
pages={3–15} }'
chicago: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem
over the Reals.” Journal of Complexity, 2008, 3–15. https://doi.org/10.1016/j.jco.2006.09.004.
ieee: 'K. Meer and M. Ziegler, “An explicit solution to Post’s Problem over the
reals,” Journal of Complexity, pp. 3–15, 2008, doi: 10.1016/j.jco.2006.09.004.'
mla: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over
the Reals.” Journal of Complexity, 2008, pp. 3–15, doi:10.1016/j.jco.2006.09.004.
short: K. Meer, M. Ziegler, Journal of Complexity (2008) 3–15.
date_created: 2021-10-15T12:42:15Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
doi: 10.1016/j.jco.2006.09.004
language:
- iso: eng
page: 3-15
publication: Journal of Complexity
publication_identifier:
issn:
- 0885-064X
publication_status: published
status: public
title: An explicit solution to Post's Problem over the reals
type: journal_article
user_id: '15415'
year: '2008'
...
---
_id: '17416'
abstract:
- lang: eng
text: "In this paper we present a system for the simultaneous visualization of several
parallel executed simulation replications. By aggregating the scenes of multiple
similar simulations into one single scene it is possible to make a visual statistical
analysis of a set of discrete event simulations as well as to easily compare different
system parameterizations. The aim of our system is to enhance the model analysis,
verification and validation process in terms of speed and ease. The parallel execution
of several simulations of complex models and the visualization of these cannot
be done on one computer, thus a parallel approach is necessary. Our system uses
a thin-client and multiple processors on a PC-cluster. The rendering and the simulation
execution are done on processors of the cluster. The client is used only for the
visualization of the images transmitted by the cluster and for user interaction.\r\n"
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Daniel
full_name: Huber, Daniel
last_name: Huber
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Suess T, Huber D, Fischer M, Laroque C, Dangelmaier W. A System for Aggregated
Visualization of Multiple Parallel Discrete Event Simulations. In: IEEE International
Symposium on Parallel and Distributed Processing with Applications. ; 2008.
doi:10.1109/ispa.2008.30'
apa: Suess, T., Huber, D., Fischer, M., Laroque, C., & Dangelmaier, W. (2008).
A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations.
IEEE International Symposium on Parallel and Distributed Processing with Applications.
https://doi.org/10.1109/ispa.2008.30
bibtex: '@inproceedings{Suess_Huber_Fischer_Laroque_Dangelmaier_2008, title={A System
for Aggregated Visualization of Multiple Parallel Discrete Event Simulations},
DOI={10.1109/ispa.2008.30},
booktitle={IEEE International Symposium on Parallel and Distributed Processing
with Applications}, author={Suess, Tim and Huber, Daniel and Fischer, Matthias
and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2008} }'
chicago: Suess, Tim, Daniel Huber, Matthias Fischer, Christoph Laroque, and Wilhelm
Dangelmaier. “A System for Aggregated Visualization of Multiple Parallel Discrete
Event Simulations.” In IEEE International Symposium on Parallel and Distributed
Processing with Applications, 2008. https://doi.org/10.1109/ispa.2008.30.
ieee: 'T. Suess, D. Huber, M. Fischer, C. Laroque, and W. Dangelmaier, “A System
for Aggregated Visualization of Multiple Parallel Discrete Event Simulations,”
2008, doi: 10.1109/ispa.2008.30.'
mla: Suess, Tim, et al. “A System for Aggregated Visualization of Multiple Parallel
Discrete Event Simulations.” IEEE International Symposium on Parallel and Distributed
Processing with Applications, 2008, doi:10.1109/ispa.2008.30.
short: 'T. Suess, D. Huber, M. Fischer, C. Laroque, W. Dangelmaier, in: IEEE International
Symposium on Parallel and Distributed Processing with Applications, 2008.'
date_created: 2020-07-27T12:56:15Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
doi: 10.1109/ispa.2008.30
language:
- iso: eng
publication: IEEE International Symposium on Parallel and Distributed Processing with
Applications
publication_identifier:
isbn:
- '9780769534718'
publication_status: published
status: public
title: A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '17566'
alternative_title:
- ' Proceedings of the Final Workshop, Barcelona, February 27-28, 2008'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Meyer auf der Heide F. The European Integrated Project "Dynamically Evolving,
Large Scale Information Systems (DELIS). Vol 222. Paderborn: Fakultät für
Elektrotechnik, Informatik und Mathematik, Universität Paderborn; 2008.'
apa: 'Meyer auf der Heide, F. (2008). The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS) (Vol. 222). Paderborn: Fakultät
für Elektrotechnik, Informatik und Mathematik, Universität Paderborn.'
bibtex: '@book{Meyer auf der Heide_2008, place={Paderborn}, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, title={The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS)}, volume={222}, publisher={Fakultät
für Elektrotechnik, Informatik und Mathematik, Universität Paderborn}, author={Meyer
auf der Heide, Friedhelm}, year={2008}, collection={Verlagsschriftenreihe des
Heinz Nixdorf Instituts} }'
chicago: 'Meyer auf der Heide, Friedhelm. The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS). Vol. 222. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts. Paderborn: Fakultät für Elektrotechnik, Informatik
und Mathematik, Universität Paderborn, 2008.'
ieee: 'F. Meyer auf der Heide, The European Integrated Project "Dynamically Evolving,
Large Scale Information Systems (DELIS), vol. 222. Paderborn: Fakultät für
Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.'
mla: Meyer auf der Heide, Friedhelm. The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS). Vol. 222, Fakultät für
Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.
short: F. Meyer auf der Heide, The European Integrated Project "Dynamically Evolving,
Large Scale Information Systems (DELIS), Fakultät für Elektrotechnik, Informatik
und Mathematik, Universität Paderborn, Paderborn, 2008.
date_created: 2020-08-03T14:19:28Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
intvolume: ' 222'
language:
- iso: eng
place: Paderborn
publication_identifier:
isbn:
- ISBN 978-3-939350-41-5
publisher: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS)
type: book
user_id: '15415'
volume: 222
year: '2008'
...
---
_id: '17868'
abstract:
- lang: eng
text: 'The paper describes an approach for an aggregated animation of a simulation
experiment in an interactive 3D environment, visualizing multiple, distributed
simulation runs. Although the general approach of a 3-dimensional visualization
of material flow simulation helps to understand the dynamic behavior of a system
better as well as faster, it remains unclear, how typical the animated simulation
represents the model, if there is a stochastic influence for even some parameters.
By the integrated visualization of multiple distributed simulation runs, this
uncertainty can be solved, which will be shown in this paper for a typical simulation
study of a queuing system. '
author:
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- 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: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: 'Dangelmaier W, Fischer M, Huber D, Laroque C, Suess T. Aggregated 3D-visualization
of a distributed simulation experiment of a queuing system. In: 2008 Winter
Simulation Conference. ; 2008:2012-2020. doi:10.1109/wsc.2008.4736296'
apa: Dangelmaier, W., Fischer, M., Huber, D., Laroque, C., & Suess, T. (2008).
Aggregated 3D-visualization of a distributed simulation experiment of a queuing
system. 2008 Winter Simulation Conference, 2012–2020. https://doi.org/10.1109/wsc.2008.4736296
bibtex: '@inproceedings{Dangelmaier_Fischer_Huber_Laroque_Suess_2008, place={Miami,
FL., USA}, title={Aggregated 3D-visualization of a distributed simulation experiment
of a queuing system}, DOI={10.1109/wsc.2008.4736296},
booktitle={2008 Winter Simulation Conference}, author={Dangelmaier, Wilhelm and
Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Suess, Tim}, year={2008},
pages={2012–2020} }'
chicago: Dangelmaier, Wilhelm, Matthias Fischer, Daniel Huber, Christoph Laroque,
and Tim Suess. “Aggregated 3D-Visualization of a Distributed Simulation Experiment
of a Queuing System.” In 2008 Winter Simulation Conference, 2012–20. Miami,
FL., USA, 2008. https://doi.org/10.1109/wsc.2008.4736296.
ieee: 'W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, and T. Suess, “Aggregated
3D-visualization of a distributed simulation experiment of a queuing system,”
in 2008 Winter Simulation Conference, 2008, pp. 2012–2020, doi: 10.1109/wsc.2008.4736296.'
mla: Dangelmaier, Wilhelm, et al. “Aggregated 3D-Visualization of a Distributed
Simulation Experiment of a Queuing System.” 2008 Winter Simulation Conference,
2008, pp. 2012–20, doi:10.1109/wsc.2008.4736296.
short: 'W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, T. Suess, in: 2008 Winter
Simulation Conference, Miami, FL., USA, 2008, pp. 2012–2020.'
date_created: 2020-08-12T13:39:37Z
date_updated: 2022-01-06T06:53:22Z
department:
- _id: '63'
doi: 10.1109/wsc.2008.4736296
language:
- iso: eng
page: 2012-2020
place: Miami, FL., USA
publication: 2008 Winter Simulation Conference
publication_identifier:
isbn:
- '9781424427079'
publication_status: published
status: public
title: Aggregated 3D-visualization of a distributed simulation experiment of a queuing
system
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19003'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
citation:
ama: 'Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem.
In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT).
; 2008:378-389. doi:10.1007/978-3-540-69903-3_34'
apa: Degener, B., Gehweiler, J., & Lammersen, C. (2008). The Kinetic Facility
Location Problem. In Proceedings of the 11th Scandinavian Workshop on Algorithm
Theory (SWAT) (pp. 378–389). https://doi.org/10.1007/978-3-540-69903-3_34
bibtex: '@inproceedings{Degener_Gehweiler_Lammersen_2008, title={The Kinetic Facility
Location Problem}, DOI={10.1007/978-3-540-69903-3_34},
booktitle={Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)},
author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2008},
pages={378–389} }'
chicago: Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “The Kinetic
Facility Location Problem.” In Proceedings of the 11th Scandinavian Workshop
on Algorithm Theory (SWAT), 378–89, 2008. https://doi.org/10.1007/978-3-540-69903-3_34.
ieee: B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location
Problem,” in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory
(SWAT), 2008, pp. 378–389.
mla: Degener, Bastian, et al. “The Kinetic Facility Location Problem.” Proceedings
of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89,
doi:10.1007/978-3-540-69903-3_34.
short: 'B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian
Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.'
date_created: 2020-09-04T10:04:49Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69903-3_34
language:
- iso: eng
page: 378-389
publication: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)
publication_identifier:
isbn:
- '9783540699002'
- '9783540699033'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: The Kinetic Facility Location Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19004'
abstract:
- lang: eng
text: "We present a deterministic kinetic data structure for the facility location
problem that maintains a subset of the moving points as facilities such that,
at any point of time, the sum of the maintenance cost for the facilities and the
connection cost for the clients is at most a constant factor larger than the current
optimal cost. In our scenario, each point can open a facility and moves continuously
along a known trajectory in a d-dimensional Euclidean space where d is a constant.\r\n\r\nOur
kinetic data structure has a storage requirement of O(n (log^d(n)+log(nR))), where
n is the number of points and R is the ratio of the product of the maximum maintenance
cost and demand to the product of their corresponding minimum values. In the case
that each trajectory can be described by a bounded degree polynomial, the data
structure processes O(n^2 log^2(nR)) events, each requiring only O(log(nR)) facility
changes and O(log^(d+1)(n) log(nR)) time. This results in a total processing time
of O(n^2 log^(d+1)(n) log^3(nR)). To the best of our knowledge, this is the first
kinetic data structure for the facility location problem."
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
citation:
ama: 'Gehweiler J, Lammersen C, Degener B. The Kinetic Facility Location Problem.
In: Proceedings of the 24th European Workshop on Computational Geometry.
; 2008:251-254.'
apa: Gehweiler, J., Lammersen, C., & Degener, B. (2008). The Kinetic Facility
Location Problem. In Proceedings of the 24th European Workshop on Computational
Geometry (pp. 251–254).
bibtex: '@inproceedings{Gehweiler_Lammersen_Degener_2008, title={The Kinetic Facility
Location Problem}, booktitle={Proceedings of the 24th European Workshop on Computational
Geometry}, author={Gehweiler, Joachim and Lammersen, Christiane and Degener, Bastian},
year={2008}, pages={251–254} }'
chicago: Gehweiler, Joachim, Christiane Lammersen, and Bastian Degener. “The Kinetic
Facility Location Problem.” In Proceedings of the 24th European Workshop on
Computational Geometry, 251–54, 2008.
ieee: J. Gehweiler, C. Lammersen, and B. Degener, “The Kinetic Facility Location
Problem,” in Proceedings of the 24th European Workshop on Computational Geometry,
2008, pp. 251–254.
mla: Gehweiler, Joachim, et al. “The Kinetic Facility Location Problem.” Proceedings
of the 24th European Workshop on Computational Geometry, 2008, pp. 251–54.
short: 'J. Gehweiler, C. Lammersen, B. Degener, in: Proceedings of the 24th European
Workshop on Computational Geometry, 2008, pp. 251–254.'
date_created: 2020-09-04T10:11:39Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
language:
- iso: eng
page: 251-254
publication: Proceedings of the 24th European Workshop on Computational Geometry
status: public
title: The Kinetic Facility Location Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '1940'
author:
- first_name: Mario
full_name: Mense, Mario
last_name: Mense
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage
in dynamic heterogeneous storage systems. In: Proceedings of the Nineteenth
Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California,
USA, January 20-22, 2008. SIAM; 2008:1135--1144.'
apa: 'Mense, M., & Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant
and fair storage in dynamic heterogeneous storage systems. In Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008 (pp. 1135--1144). SIAM.'
bibtex: '@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme
for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense,
Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }'
chicago: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for
Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008, 1135--1144. SIAM, 2008.'
ieee: 'M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and
fair storage in dynamic heterogeneous storage systems,” in Proceedings of the
Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco,
California, USA, January 20-22, 2008, 2008, pp. 1135--1144.'
mla: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant
and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.'
short: 'M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM
Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January
20-22, 2008, SIAM, 2008, pp. 1135--1144.'
date_created: 2018-03-29T09:30:18Z
date_updated: 2022-01-06T06:54:03Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:03:13Z
date_updated: 2018-04-13T10:03:13Z
file_id: '2341'
file_name: SODA08.pdf
file_size: 211264
relation: main_file
file_date_updated: 2018-04-13T10:03:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 1135--1144
publication: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms,
SODA 2008, San Francisco, California, USA, January 20-22, 2008
publisher: SIAM
status: public
title: 'SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous
storage systems'
type: conference
urn: '19408'
user_id: '14955'
year: '2008'
...
---
_id: '20367'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
citation:
ama: 'Hamann H, Wörn H. Aggregating Robots Compute: An Adaptive Heuristic for the
Euclidean Steiner Tree Problem. In: The Tenth International Conference on Simulation
of Adaptive Behavior (SAB’08). Vol 5040. ; 2008:447--456. doi:10.1007/978-3-540-69134-1_44'
apa: 'Hamann, H., & Wörn, H. (2008). Aggregating Robots Compute: An Adaptive
Heuristic for the Euclidean Steiner Tree Problem. In The tenth International
Conference on Simulation of Adaptive Behavior (SAB’08) (Vol. 5040, pp. 447--456).
https://doi.org/10.1007/978-3-540-69134-1_44'
bibtex: '@inproceedings{Hamann_Wörn_2008, title={Aggregating Robots Compute: An
Adaptive Heuristic for the Euclidean Steiner Tree Problem}, volume={5040}, DOI={10.1007/978-3-540-69134-1_44},
booktitle={The tenth International Conference on Simulation of Adaptive Behavior
(SAB’08)}, author={Hamann, Heiko and Wörn, Heinz}, year={2008}, pages={447--456}
}'
chicago: 'Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive
Heuristic for the Euclidean Steiner Tree Problem.” In The Tenth International
Conference on Simulation of Adaptive Behavior (SAB’08), 5040:447--456, 2008.
https://doi.org/10.1007/978-3-540-69134-1_44.'
ieee: 'H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic
for the Euclidean Steiner Tree Problem,” in The tenth International Conference
on Simulation of Adaptive Behavior (SAB’08), 2008, vol. 5040, pp. 447--456.'
mla: 'Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic
for the Euclidean Steiner Tree Problem.” The Tenth International Conference
on Simulation of Adaptive Behavior (SAB’08), vol. 5040, 2008, pp. 447--456,
doi:10.1007/978-3-540-69134-1_44.'
short: 'H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation
of Adaptive Behavior (SAB’08), 2008, pp. 447--456.'
date_created: 2020-11-16T13:55:39Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-540-69134-1_44
intvolume: ' 5040'
language:
- iso: eng
page: 447--456
publication: The tenth International Conference on Simulation of Adaptive Behavior
(SAB'08)
publication_identifier:
isbn:
- '9783540691334'
- '9783540691341'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner
Tree Problem'
type: conference
user_id: '15415'
volume: 5040
year: '2008'
...
---
_id: '20368'
abstract:
- lang: eng
text: 'We present a comparative study of two spatially resolved macroscopic models
of an autonomous robotic swarm. In previous experiments, the collective behavior
of 15 autonomous swarm robots, driven by a simple bio-inspired control algorithm,
was investigated: in two different environmental conditions, the ability of the
robots to aggregate below a light source was tested. Distinct approaches to predict
the dynamics of the spatial distribution were made by two different modeling approaches:
one model was constructed in a compartmental manner (ODEs). In parallel, a space-continuous
model (PDEs) was constructed. Both models show a high degree of similarity concerning
the modeling of concrete environmental factors (light), but due to their different
basic approaches, show also significant differences in their implementation. However,
the predictions of both models compare well to the observed behavior of the robotic
swarm, thus both models can be used to develop further extensions of the algorithm
as well as different experimental setups without the need to run extensive real
robotic preliminary experiments.'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Hamann H, Schmickl T, Wörn H, Crailsheim K. Spatial Macroscopic Models of
a Bio-Inspired Robotic Swarm Algorithm. In: IEEE/RSJ 2008 International Conference
on Intelligent Robots and Systems (IROS’08). IEEE Press; 2008:1415--1420.
doi:10.1109/IROS.2008.4651038'
apa: Hamann, H., Schmickl, T., Wörn, H., & Crailsheim, K. (2008). Spatial Macroscopic
Models of a Bio-Inspired Robotic Swarm Algorithm. In IEEE/RSJ 2008 International
Conference on Intelligent Robots and Systems (IROS’08) (pp. 1415--1420). IEEE
Press. https://doi.org/10.1109/IROS.2008.4651038
bibtex: '@inproceedings{Hamann_Schmickl_Wörn_Crailsheim_2008, title={Spatial Macroscopic
Models of a Bio-Inspired Robotic Swarm Algorithm}, DOI={10.1109/IROS.2008.4651038},
booktitle={IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems
(IROS’08)}, publisher={IEEE Press}, author={Hamann, Heiko and Schmickl, Thomas
and Wörn, Heinz and Crailsheim, Karl}, year={2008}, pages={1415--1420} }'
chicago: Hamann, Heiko, Thomas Schmickl, Heinz Wörn, and Karl Crailsheim. “Spatial
Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm.” In IEEE/RSJ
2008 International Conference on Intelligent Robots and Systems (IROS’08),
1415--1420. IEEE Press, 2008. https://doi.org/10.1109/IROS.2008.4651038.
ieee: H. Hamann, T. Schmickl, H. Wörn, and K. Crailsheim, “Spatial Macroscopic Models
of a Bio-Inspired Robotic Swarm Algorithm,” in IEEE/RSJ 2008 International
Conference on Intelligent Robots and Systems (IROS’08), 2008, pp. 1415--1420.
mla: Hamann, Heiko, et al. “Spatial Macroscopic Models of a Bio-Inspired Robotic
Swarm Algorithm.” IEEE/RSJ 2008 International Conference on Intelligent Robots
and Systems (IROS’08), IEEE Press, 2008, pp. 1415--1420, doi:10.1109/IROS.2008.4651038.
short: 'H. Hamann, T. Schmickl, H. Wörn, K. Crailsheim, in: IEEE/RSJ 2008 International
Conference on Intelligent Robots and Systems (IROS’08), IEEE Press, 2008, pp.
1415--1420.'
date_created: 2020-11-16T14:03:10Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/IROS.2008.4651038
language:
- iso: eng
page: 1415--1420
publication: IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems
(IROS'08)
publisher: IEEE Press
status: public
title: Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '20369'
abstract:
- lang: eng
text: Designing and analyzing self-organizing systems such as robotic swarms is
a challenging task even though we have complete knowledge about the robot’s interior.
It is difficult to determine the individual robot’s behavior based on the swarm
behavior and vice versa due to the high number of agent–agent interactions. A
step towards a solution of this problem is the development of appropriate models
which accurately predict the swarm behavior based on a specified control algorithm.
Such models would reduce the necessary number of time-consuming simulations and
experiments during the design process of an algorithm. In this paper we propose
a model with focus on an explicit representation of space because the effectiveness
of many swarm robotic scenarios depends on spatial inhomogeneity. We use methods
of statistical physics to address spatiality. Starting from a description of a
single robot we derive an abstract model of swarm motion. The model is then extended
to a generic model framework of communicating robots. In two examples we validate
models against simulation results. Our experience shows that qualitative correctness
is easily achieved, while quantitative correctness is disproportionately more
difficult but still possible.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
citation:
ama: Hamann H, Wörn H. A framework of space–time continuous models for algorithm
design in swarm robotics. Swarm Intelligence. 2008;2(2-4):209-239. doi:10.1007/s11721-008-0015-3
apa: Hamann, H., & Wörn, H. (2008). A framework of space–time continuous models
for algorithm design in swarm robotics. Swarm Intelligence, 2(2–4),
209–239. https://doi.org/10.1007/s11721-008-0015-3
bibtex: '@article{Hamann_Wörn_2008, title={A framework of space–time continuous
models for algorithm design in swarm robotics}, volume={2}, DOI={10.1007/s11721-008-0015-3},
number={2–4}, journal={Swarm Intelligence}, author={Hamann, Heiko and Wörn, Heinz},
year={2008}, pages={209–239} }'
chicago: 'Hamann, Heiko, and Heinz Wörn. “A Framework of Space–Time Continuous Models
for Algorithm Design in Swarm Robotics.” Swarm Intelligence 2, no. 2–4
(2008): 209–39. https://doi.org/10.1007/s11721-008-0015-3.'
ieee: H. Hamann and H. Wörn, “A framework of space–time continuous models for algorithm
design in swarm robotics,” Swarm Intelligence, vol. 2, no. 2–4, pp. 209–239,
2008.
mla: Hamann, Heiko, and Heinz Wörn. “A Framework of Space–Time Continuous Models
for Algorithm Design in Swarm Robotics.” Swarm Intelligence, vol. 2, no.
2–4, 2008, pp. 209–39, doi:10.1007/s11721-008-0015-3.
short: H. Hamann, H. Wörn, Swarm Intelligence 2 (2008) 209–239.
date_created: 2020-11-16T14:05:49Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/s11721-008-0015-3
intvolume: ' 2'
issue: 2-4
language:
- iso: eng
page: 209-239
publication: Swarm Intelligence
publication_identifier:
issn:
- 1935-3812
- 1935-3820
publication_status: published
status: public
title: A framework of space–time continuous models for algorithm design in swarm robotics
type: journal_article
user_id: '15415'
volume: 2
year: '2008'
...
---
_id: '17978'
author:
- first_name: Katharina
full_name: Lürwer-Brüggemeier, Katharina
last_name: Lürwer-Brüggemeier
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic
Primitives. In: Unconventional Computing. Berlin, Heidelberg; 2008. doi:10.1007/978-3-540-85194-3_11'
apa: Lürwer-Brüggemeier, K., & Ziegler, M. (2008). On Faster Integer Calculations
Using Non-arithmetic Primitives. In Unconventional Computing. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-540-85194-3_11
bibtex: '@inbook{Lürwer-Brüggemeier_Ziegler_2008, place={Berlin, Heidelberg}, title={On
Faster Integer Calculations Using Non-arithmetic Primitives}, DOI={10.1007/978-3-540-85194-3_11},
booktitle={Unconventional Computing}, author={Lürwer-Brüggemeier, Katharina and
Ziegler, Martin}, year={2008} }'
chicago: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
Using Non-Arithmetic Primitives.” In Unconventional Computing. Berlin,
Heidelberg, 2008. https://doi.org/10.1007/978-3-540-85194-3_11.
ieee: K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using
Non-arithmetic Primitives,” in Unconventional Computing, Berlin, Heidelberg,
2008.
mla: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
Using Non-Arithmetic Primitives.” Unconventional Computing, 2008, doi:10.1007/978-3-540-85194-3_11.
short: 'K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin,
Heidelberg, 2008.'
date_created: 2020-08-14T13:19:24Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-85194-3_11
language:
- iso: eng
place: Berlin, Heidelberg
publication: Unconventional Computing
publication_identifier:
isbn:
- '9783540851936'
- '9783540851943'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: On Faster Integer Calculations Using Non-arithmetic Primitives
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '18139'
abstract:
- lang: eng
text: 'This paper describes a method for the animation of a large number of objects
within a dynamic 3D visualization of a material flow simulation model. It uses
key-frame based animation. The number of animated objects may grow constantly
in complex simulation models, which might lead to an amount of animations that
is too big to be computed in real-time. By the use of a dynamic adjustment, the
presented algorithm prefers important animations. Less relevant animations are
updated rarely, whereby the selection itself is taken by multiple indicators,
e.g. the visible size of the animated object on the screen, in order to keep a
good optical impression. Dependent on the computing power of the computer, the
algorithm controls the animations in such a way, that the fluid visualization
of a large number of objects is still possible. Though the algorithm is to be
used within a material flow simulator, it is moreover implemented in a specific
animation editor, which allows the design and control of animation schemes. It
supports the use of grouping to allow the creation of hierarchical structures
for complex animations in a fast and easy manner. The evaluation of the algorithm
is proven by a test scene, consisting of tens of thousands animated objects. '
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
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
citation:
ama: 'Laroque C, Fischer M, Dangelmaier W, Eikel B. Dynamic Control of Animation
Schemes for the Efficient 3D-Visualization of Material Flow Simulations. In: Industrial
Simulation Conference (ISC 2008). EUROSIS-ETI; 2008:306-310.'
apa: Laroque, C., Fischer, M., Dangelmaier, W., & Eikel, B. (2008). Dynamic
Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow
Simulations. In Industrial Simulation Conference (ISC 2008) (pp. 306–310).
EUROSIS-ETI.
bibtex: '@inproceedings{Laroque_Fischer_Dangelmaier_Eikel_2008, title={Dynamic Control
of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations},
booktitle={Industrial Simulation Conference (ISC 2008)}, publisher={EUROSIS-ETI},
author={Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm and
Eikel, Benjamin}, year={2008}, pages={306–310} }'
chicago: Laroque, Christoph, Matthias Fischer, Wilhelm Dangelmaier, and Benjamin
Eikel. “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization
of Material Flow Simulations.” In Industrial Simulation Conference (ISC 2008),
306–10. EUROSIS-ETI, 2008.
ieee: C. Laroque, M. Fischer, W. Dangelmaier, and B. Eikel, “Dynamic Control of
Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations,”
in Industrial Simulation Conference (ISC 2008), 2008, pp. 306–310.
mla: Laroque, Christoph, et al. “Dynamic Control of Animation Schemes for the Efficient
3D-Visualization of Material Flow Simulations.” Industrial Simulation Conference
(ISC 2008), EUROSIS-ETI, 2008, pp. 306–10.
short: 'C. Laroque, M. Fischer, W. Dangelmaier, B. Eikel, in: Industrial Simulation
Conference (ISC 2008), EUROSIS-ETI, 2008, pp. 306–310.'
date_created: 2020-08-24T07:49:59Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
page: 306-310
publication: Industrial Simulation Conference (ISC 2008)
publisher: EUROSIS-ETI
status: public
title: Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of
Material Flow Simulations
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '18141'
abstract:
- lang: ger
text: Dieser Artikel beschreibt eine Methode zur Animation einer großen Anzahl von
Objekten zur dynamischen 3D-Visualisierung eines Simulationsmodells mittels der
Materialflusssimulation auf Basis von Schlüsselbildern. Die Anzahl zu animierender
Objekte ist in komplexen Modellen zu groß, um alle Animationen flüssig darzustellen.
Dynamisch abgestuft wählt das entwickelte Verfahren gezielt wichtige Animationen
aus, weniger relevante Animationen werden entsprechend seltener animiert. Die
Selektion der Animationen erfolgt nach der projizierten Größe der Objekte auf
das Ausgabegerät, um einen guten optischen Eindruck beizubehalten. Angepasst an
die Leistungsfähigkeit des Rechners wird das Verfahren so geregelt, dass die Visualisierung
einer hohen Anzahl von Objekten in Echtzeit möglich bleibt. Das Verfahren ist
in einem Editor prototypisch implementiert, mit dem Schlüsselbilder für Objekte
erzeugt werden können. Das Gruppieren von Objekten wird erlaubt, so dass eine
Hierarchie von Bewegungspfaden definierbar ist. Die Evaluierung der Methode wird
mittels Testszenen durchgeführt, die aus mehreren zehntausend animierten Objekten
bestehen.
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: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
citation:
ama: 'Laroque C, Fischer M, Eikel B. Regelung von Animationen in Simulationen von
hochdynamischen Fabrikszenen . In: Augmented & Virtual Reality in Der Produktentstehung.
Vol 232. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008:193--206.'
apa: Laroque, C., Fischer, M., & Eikel, B. (2008). Regelung von Animationen
in Simulationen von hochdynamischen Fabrikszenen . Augmented & Virtual
Reality in Der Produktentstehung, 232, 193--206.
bibtex: '@inproceedings{Laroque_Fischer_Eikel_2008, title={Regelung von Animationen
in Simulationen von hochdynamischen Fabrikszenen }, volume={232}, booktitle={Augmented
& Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Laroque, Christoph and Fischer,
Matthias and Eikel, Benjamin}, year={2008}, pages={193--206} }'
chicago: Laroque, Christoph, Matthias Fischer, and Benjamin Eikel. “Regelung von
Animationen in Simulationen von Hochdynamischen Fabrikszenen .” In Augmented
& Virtual Reality in Der Produktentstehung, 232:193--206. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2008.
ieee: C. Laroque, M. Fischer, and B. Eikel, “Regelung von Animationen in Simulationen
von hochdynamischen Fabrikszenen ,” in Augmented & Virtual Reality in
der Produktentstehung, 2008, vol. 232, pp. 193--206.
mla: Laroque, Christoph, et al. “Regelung von Animationen in Simulationen von Hochdynamischen
Fabrikszenen .” Augmented & Virtual Reality in Der Produktentstehung,
vol. 232, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008,
pp. 193--206.
short: 'C. Laroque, M. Fischer, B. Eikel, in: Augmented & Virtual Reality in
Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008, pp. 193--206.'
date_created: 2020-08-24T07:56:43Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 232'
language:
- iso: eng
page: 193--206
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: 'Regelung von Animationen in Simulationen von hochdynamischen Fabrikszenen '
type: conference
user_id: '5786'
volume: 232
year: '2008'
...
---
_id: '18143'
author:
- first_name: Stéphane
full_name: Le Roux, Stéphane
last_name: Le Roux
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Le Roux S, Ziegler M. Singular Coverings and Non-Uniform Notions of Closed
Set Computability. Electronic Notes in Theoretical Computer Science. Published
online 2008:73-88. doi:10.1016/j.entcs.2008.03.009
apa: Le Roux, S., & Ziegler, M. (2008). Singular Coverings and Non-Uniform Notions
of Closed Set Computability. Electronic Notes in Theoretical Computer Science,
73–88. https://doi.org/10.1016/j.entcs.2008.03.009
bibtex: '@article{Le Roux_Ziegler_2008, title={Singular Coverings and Non-Uniform
Notions of Closed Set Computability}, DOI={10.1016/j.entcs.2008.03.009},
journal={Electronic Notes in Theoretical Computer Science}, author={Le Roux, Stéphane
and Ziegler, Martin}, year={2008}, pages={73–88} }'
chicago: Le Roux, Stéphane, and Martin Ziegler. “Singular Coverings and Non-Uniform
Notions of Closed Set Computability.” Electronic Notes in Theoretical Computer
Science, 2008, 73–88. https://doi.org/10.1016/j.entcs.2008.03.009.
ieee: 'S. Le Roux and M. Ziegler, “Singular Coverings and Non-Uniform Notions of
Closed Set Computability,” Electronic Notes in Theoretical Computer Science,
pp. 73–88, 2008, doi: 10.1016/j.entcs.2008.03.009.'
mla: Le Roux, Stéphane, and Martin Ziegler. “Singular Coverings and Non-Uniform
Notions of Closed Set Computability.” Electronic Notes in Theoretical Computer
Science, 2008, pp. 73–88, doi:10.1016/j.entcs.2008.03.009.
short: S. Le Roux, M. Ziegler, Electronic Notes in Theoretical Computer Science
(2008) 73–88.
date_created: 2020-08-24T08:07:43Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1016/j.entcs.2008.03.009
language:
- iso: eng
page: 73-88
publication: Electronic Notes in Theoretical Computer Science
publication_identifier:
issn:
- 1571-0661
publication_status: published
status: public
title: Singular Coverings and Non-Uniform Notions of Closed Set Computability
type: journal_article
user_id: '15415'
year: '2008'
...
---
_id: '18570'
abstract:
- lang: eng
text: "We present a game theoretic study of hybrid communication networks in which
mobile devices can connect in an ad hoc fashion to a base station, possibly via
a few hops using other mobile devices as intermediate nodes. The maximal number
of allowed hops might be bounded with the motivation to guarantee small latency.
We introduce hybrid connectivity games to study the impact of selfishness on this
kind of infrastructure.\r\n\r\nMobile devices are represented by selfish players,
each of which aims at establishing an uplink path to the base station minimizing
its individual cost. Our model assumes that intermediate nodes on an uplink path
are reimbursed for transmitting the packets of other devices. The reimbursements
can be paid either by a benevolent network operator or by the senders of the packets
using micropayments via a clearing agency that possibly collects a small percentage
as commission. These different ways to implement the payments lead to different
variants of the hybrid connectivity game. Our main findings are: (1) If there
is no constraint on the number of allowed hops on the path to the base station,
then the existence of equilibria is guaranteed regardless of whether the network
operator or the senders pay for forwarding packets. (2) If the network operator
pays, then the existence of equilibria is guaranteed only if at most one intermediate
node is allowed, i.e., for at most two hops on the uplink path of a device, but
not if the maximal number of allowed hops is three or larger. (3) In contrast,
if the senders pay for forwarding their packets, then equilibria are guaranteed
to exist given any bound on the number of allowed hops.\r\n\r\nThe equilibrium
analysis presented in this paper gives a first game theoretical motivation for
the implementation of micropayment schemes in which senders pay for forwarding
their packets. We further support this evidence by giving an upper bound on the
Price of Anarchy for this kind of hybrid connectivity games that is independent
of the number of nodes, but only depends on the number of hops and the power gradient."
author:
- first_name: Heiner
full_name: Ackermann, Heiner
last_name: Ackermann
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Alexander
full_name: Fanghänel, Alexander
last_name: Fanghänel
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Ackermann H, Briest P, Fanghänel A, Vöcking B. Who Should Pay for Forwarding
Packets? Internet Mathematics. 2008;5(4):459-475. doi:10.1007/978-3-540-77105-0_21
apa: Ackermann, H., Briest, P., Fanghänel, A., & Vöcking, B. (2008). Who Should
Pay for Forwarding Packets? Internet Mathematics, 5(4), 459–475.
https://doi.org/10.1007/978-3-540-77105-0_21
bibtex: '@article{Ackermann_Briest_Fanghänel_Vöcking_2008, title={Who Should Pay
for Forwarding Packets?}, volume={5}, DOI={10.1007/978-3-540-77105-0_21},
number={4}, journal={Internet Mathematics}, publisher={Springer}, author={Ackermann,
Heiner and Briest, Patrick and Fanghänel, Alexander and Vöcking, Berthold}, year={2008},
pages={459–475} }'
chicago: 'Ackermann, Heiner, Patrick Briest, Alexander Fanghänel, and Berthold Vöcking.
“Who Should Pay for Forwarding Packets?” Internet Mathematics 5, no. 4
(2008): 459–75. https://doi.org/10.1007/978-3-540-77105-0_21.'
ieee: H. Ackermann, P. Briest, A. Fanghänel, and B. Vöcking, “Who Should Pay for
Forwarding Packets?,” Internet Mathematics, vol. 5, no. 4, pp. 459–475,
2008.
mla: Ackermann, Heiner, et al. “Who Should Pay for Forwarding Packets?” Internet
Mathematics, vol. 5, no. 4, Springer, 2008, pp. 459–75, doi:10.1007/978-3-540-77105-0_21.
short: H. Ackermann, P. Briest, A. Fanghänel, B. Vöcking, Internet Mathematics 5
(2008) 459–475.
date_created: 2020-08-28T12:29:59Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
doi: 10.1007/978-3-540-77105-0_21
intvolume: ' 5'
issue: '4'
language:
- iso: eng
page: 459-475
publication: Internet Mathematics
publication_identifier:
isbn:
- '9783540771043'
publication_status: published
publisher: Springer
status: public
title: Who Should Pay for Forwarding Packets?
type: journal_article
user_id: '15415'
volume: 5
year: '2008'
...