---
_id: '19829'
author:
- first_name: Huawei
full_name: Miao, Huawei
last_name: Miao
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Xiaowen
full_name: Wu, Xiaowen
last_name: Wu
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Miao H, Ooi CC, Wu X, Schindelhauer C. Coverage-hole trap model in target
tracking using distributed relay-robot network. In: Proceedings of the 2010
ACM Symposium on Applied Computing - SAC ’10. ; 2010:1299-1304. doi:10.1145/1774088.1774365'
apa: Miao, H., Ooi, C. C., Wu, X., & Schindelhauer, C. (2010). Coverage-hole
trap model in target tracking using distributed relay-robot network. In Proceedings
of the 2010 ACM Symposium on Applied Computing - SAC ’10 (pp. 1299–1304).
https://doi.org/10.1145/1774088.1774365
bibtex: '@inproceedings{Miao_Ooi_Wu_Schindelhauer_2010, title={Coverage-hole trap
model in target tracking using distributed relay-robot network}, DOI={10.1145/1774088.1774365},
booktitle={Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10},
author={Miao, Huawei and Ooi, Chia Ching and Wu, Xiaowen and Schindelhauer, Christian},
year={2010}, pages={1299–1304} }'
chicago: Miao, Huawei, Chia Ching Ooi, Xiaowen Wu, and Christian Schindelhauer.
“Coverage-Hole Trap Model in Target Tracking Using Distributed Relay-Robot Network.”
In Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10,
1299–1304, 2010. https://doi.org/10.1145/1774088.1774365.
ieee: H. Miao, C. C. Ooi, X. Wu, and C. Schindelhauer, “Coverage-hole trap model
in target tracking using distributed relay-robot network,” in Proceedings of
the 2010 ACM Symposium on Applied Computing - SAC ’10, 2010, pp. 1299–1304.
mla: Miao, Huawei, et al. “Coverage-Hole Trap Model in Target Tracking Using Distributed
Relay-Robot Network.” Proceedings of the 2010 ACM Symposium on Applied Computing
- SAC ’10, 2010, pp. 1299–304, doi:10.1145/1774088.1774365.
short: 'H. Miao, C.C. Ooi, X. Wu, C. Schindelhauer, in: Proceedings of the 2010
ACM Symposium on Applied Computing - SAC ’10, 2010, pp. 1299–1304.'
date_created: 2020-10-01T10:00:25Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1774088.1774365
language:
- iso: eng
page: 1299-1304
publication: Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10
publication_identifier:
isbn:
- '9781605586397'
publication_status: published
status: public
title: Coverage-hole trap model in target tracking using distributed relay-robot network
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19933'
author:
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
- first_name: Simon
full_name: Oberthur, Simon
last_name: Oberthur
- first_name: Michael
full_name: Kortenjan, Michael
last_name: Kortenjan
citation:
ama: 'Schomaker G, Oberthur S, Kortenjan M. Distributed and dynamic resource management
for self-optimizing mechatronic systems. In: 8th IEEE International Conference
on Industrial Informatics (INDIN’2010). ; 2010. doi:10.1109/indin.2010.5549647'
apa: Schomaker, G., Oberthur, S., & Kortenjan, M. (2010). Distributed and dynamic
resource management for self-optimizing mechatronic systems. In 8th IEEE International
Conference on Industrial Informatics (INDIN’2010). https://doi.org/10.1109/indin.2010.5549647
bibtex: '@inproceedings{Schomaker_Oberthur_Kortenjan_2010, title={Distributed and
dynamic resource management for self-optimizing mechatronic systems}, DOI={10.1109/indin.2010.5549647},
booktitle={8th IEEE International Conference on Industrial Informatics (INDIN’2010)},
author={Schomaker, Gunnar and Oberthur, Simon and Kortenjan, Michael}, year={2010}
}'
chicago: Schomaker, Gunnar, Simon Oberthur, and Michael Kortenjan. “Distributed
and Dynamic Resource Management for Self-Optimizing Mechatronic Systems.” In 8th
IEEE International Conference on Industrial Informatics (INDIN’2010), 2010.
https://doi.org/10.1109/indin.2010.5549647.
ieee: G. Schomaker, S. Oberthur, and M. Kortenjan, “Distributed and dynamic resource
management for self-optimizing mechatronic systems,” in 8th IEEE International
Conference on Industrial Informatics (INDIN’2010), 2010.
mla: Schomaker, Gunnar, et al. “Distributed and Dynamic Resource Management for
Self-Optimizing Mechatronic Systems.” 8th IEEE International Conference on
Industrial Informatics (INDIN’2010), 2010, doi:10.1109/indin.2010.5549647.
short: 'G. Schomaker, S. Oberthur, M. Kortenjan, in: 8th IEEE International Conference
on Industrial Informatics (INDIN’2010), 2010.'
date_created: 2020-10-06T14:01:21Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
- _id: '70'
doi: 10.1109/indin.2010.5549647
language:
- iso: eng
publication: 8th IEEE International Conference on Industrial Informatics (INDIN'2010)
publication_identifier:
isbn:
- '9781424472987'
publication_status: published
status: public
title: Distributed and dynamic resource management for self-optimizing mechatronic
systems
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '20182'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Hamann H. Space-Time Continuous Models of Swarm Robotics Systems: Supporting
Global-to-Local Programming. Berlin, Germany: Springer; 2010. doi:10.1007/978-3-642-13377-0'
apa: 'Hamann, H. (2010). Space-Time Continuous Models of Swarm Robotics Systems:
Supporting Global-to-Local Programming. Berlin, Germany: Springer. https://doi.org/10.1007/978-3-642-13377-0'
bibtex: '@book{Hamann_2010, place={Berlin, Germany}, title={Space-Time Continuous
Models of Swarm Robotics Systems: Supporting Global-to-Local Programming}, DOI={10.1007/978-3-642-13377-0},
publisher={Springer}, author={Hamann, Heiko}, year={2010} }'
chicago: 'Hamann, Heiko. Space-Time Continuous Models of Swarm Robotics Systems:
Supporting Global-to-Local Programming. Berlin, Germany: Springer, 2010. https://doi.org/10.1007/978-3-642-13377-0.'
ieee: 'H. Hamann, Space-Time Continuous Models of Swarm Robotics Systems: Supporting
Global-to-Local Programming. Berlin, Germany: Springer, 2010.'
mla: 'Hamann, Heiko. Space-Time Continuous Models of Swarm Robotics Systems:
Supporting Global-to-Local Programming. Springer, 2010, doi:10.1007/978-3-642-13377-0.'
short: 'H. Hamann, Space-Time Continuous Models of Swarm Robotics Systems: Supporting
Global-to-Local Programming, Springer, Berlin, Germany, 2010.'
date_created: 2020-10-22T12:25:10Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-13377-0
language:
- iso: eng
place: Berlin, Germany
publisher: Springer
status: public
title: 'Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local
Programming'
type: book
user_id: '15415'
year: '2010'
...
---
_id: '20220'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Hamann H, Schmickl T, Stradner J, Crailsheim K. A Hormone-Based Controller
for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning.
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10).
; 2010:244--251. doi:10.1109/CEC.2010.5585994'
apa: 'Hamann, H., Schmickl, T., Stradner, J., & Crailsheim, K. (2010). A Hormone-Based
Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait
Learning. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10)
(pp. 244--251). https://doi.org/10.1109/CEC.2010.5585994'
bibtex: '@inproceedings{Hamann_Schmickl_Stradner_Crailsheim_2010, title={A Hormone-Based
Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait
Learning}, DOI={10.1109/CEC.2010.5585994},
booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10)},
author={Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim,
Karl}, year={2010}, pages={244--251} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, and Karl Crailsheim.
“A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single
Modules to Gait Learning.” In Proceedings of the IEEE Congress on Evolutionary
Computation (CEC’10), 244--251, 2010. https://doi.org/10.1109/CEC.2010.5585994.'
ieee: 'H. Hamann, T. Schmickl, J. Stradner, and K. Crailsheim, “A Hormone-Based
Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait
Learning,” in Proceedings of the IEEE Congress on Evolutionary Computation
(CEC’10), 2010, pp. 244--251.'
mla: 'Hamann, Heiko, et al. “A Hormone-Based Controller for Evolutionary Multi-Modular
Robotics: From Single Modules to Gait Learning.” Proceedings of the IEEE Congress
on Evolutionary Computation (CEC’10), 2010, pp. 244--251, doi:10.1109/CEC.2010.5585994.'
short: 'H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, in: Proceedings of the
IEEE Congress on Evolutionary Computation (CEC’10), 2010, pp. 244--251.'
date_created: 2020-10-28T14:37:09Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/CEC.2010.5585994
language:
- iso: eng
page: 244--251
publication: Proceedings of the IEEE Congress on Evolutionary Computation (CEC'10)
status: public
title: 'A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single
Modules to Gait Learning'
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '20222'
author:
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Ralf
full_name: Mayet, Ralf
last_name: Mayet
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Schmickl T, Hamann H, Stradner J, Mayet R, Crailsheim K. Complex Taxis-Behaviour
in a Novel Bio-Inspired Robot Controller. In: Proc. of the ALife XII Conference.
MIT Press; 2010:648--655.'
apa: Schmickl, T., Hamann, H., Stradner, J., Mayet, R., & Crailsheim, K. (2010).
Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller. In Proc.
of the ALife XII Conference (pp. 648--655). MIT Press.
bibtex: '@inproceedings{Schmickl_Hamann_Stradner_Mayet_Crailsheim_2010, title={Complex
Taxis-Behaviour in a Novel Bio-Inspired Robot Controller}, booktitle={Proc. of
the ALife XII Conference}, publisher={MIT Press}, author={Schmickl, Thomas and
Hamann, Heiko and Stradner, Jürgen and Mayet, Ralf and Crailsheim, Karl}, year={2010},
pages={648--655} }'
chicago: Schmickl, Thomas, Heiko Hamann, Jürgen Stradner, Ralf Mayet, and Karl Crailsheim.
“Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller.” In Proc.
of the ALife XII Conference, 648--655. MIT Press, 2010.
ieee: T. Schmickl, H. Hamann, J. Stradner, R. Mayet, and K. Crailsheim, “Complex
Taxis-Behaviour in a Novel Bio-Inspired Robot Controller,” in Proc. of the
ALife XII Conference, 2010, pp. 648--655.
mla: Schmickl, Thomas, et al. “Complex Taxis-Behaviour in a Novel Bio-Inspired Robot
Controller.” Proc. of the ALife XII Conference, MIT Press, 2010, pp. 648--655.
short: 'T. Schmickl, H. Hamann, J. Stradner, R. Mayet, K. Crailsheim, in: Proc.
of the ALife XII Conference, MIT Press, 2010, pp. 648--655.'
date_created: 2020-10-29T14:09:39Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 648--655
publication: Proc. of the ALife XII Conference
publisher: MIT Press
status: public
title: Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '20223'
abstract:
- lang: eng
text: "The semi-automatic or automatic synthesis of robot controller software is\r\nboth
desirable and challenging. Synthesis of rather simple behaviors such as\r\ncollision
avoidance by applying artificial evolution has been shown multiple\r\ntimes. However,
the difficulty of this synthesis increases heavily with\r\nincreasing complexity
of the task that should be performed by the robot. We try\r\nto tackle this problem
of complexity with Artificial Homeostatic Hormone\r\nSystems (AHHS), which provide
both intrinsic, homeostatic processes and\r\n(transient) intrinsic, variant behavior.
By using AHHS the need for pre-defined\r\ncontroller topologies or information
about the field of application is\r\nminimized. We investigate how the principle
design of the controller and the\r\nhormone network size affects the overall performance
of the artificial\r\nevolution (i.e., evolvability). This is done by comparing
two variants of AHHS\r\nthat show different effects when mutated. We evolve a
controller for a robot\r\nbuilt from five autonomous, cooperating modules. The
desired behavior is a form\r\nof gait resulting in fast locomotion by using the
modules' main hinges."
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Hamann H, Stradner J, Schmickl T, Crailsheim K. Artificial Hormone Reaction
Networks: Towards Higher Evolvability in Evolutionary Multi-Modular Robotics.
In: Artificial Life XII (ALife XII), Odense, Denmark. MIT Press; 2010:773-780.'
apa: 'Hamann, H., Stradner, J., Schmickl, T., & Crailsheim, K. (2010). Artificial
Hormone Reaction Networks: Towards Higher Evolvability in Evolutionary Multi-Modular
Robotics. In Artificial Life XII (ALife XII), Odense, Denmark (pp. 773–780).
MIT Press.'
bibtex: '@inproceedings{Hamann_Stradner_Schmickl_Crailsheim_2010, title={Artificial
Hormone Reaction Networks: Towards Higher Evolvability in Evolutionary Multi-Modular
Robotics}, booktitle={Artificial Life XII (ALife XII), Odense, Denmark}, publisher={MIT
Press}, author={Hamann, Heiko and Stradner, Jürgen and Schmickl, Thomas and Crailsheim,
Karl}, year={2010}, pages={773–780} }'
chicago: 'Hamann, Heiko, Jürgen Stradner, Thomas Schmickl, and Karl Crailsheim.
“Artificial Hormone Reaction Networks: Towards Higher Evolvability in Evolutionary
Multi-Modular Robotics.” In Artificial Life XII (ALife XII), Odense, Denmark,
773–80. MIT Press, 2010.'
ieee: 'H. Hamann, J. Stradner, T. Schmickl, and K. Crailsheim, “Artificial Hormone
Reaction Networks: Towards Higher Evolvability in Evolutionary Multi-Modular
Robotics,” in Artificial Life XII (ALife XII), Odense, Denmark, 2010, pp.
773–780.'
mla: 'Hamann, Heiko, et al. “Artificial Hormone Reaction Networks: Towards Higher
Evolvability in Evolutionary Multi-Modular Robotics.” Artificial Life XII
(ALife XII), Odense, Denmark, MIT Press, 2010, pp. 773–80.'
short: 'H. Hamann, J. Stradner, T. Schmickl, K. Crailsheim, in: Artificial Life
XII (ALife XII), Odense, Denmark, MIT Press, 2010, pp. 773–780.'
date_created: 2020-10-29T14:11:25Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '63'
- _id: '238'
external_id:
arxiv:
- '1011.3912'
language:
- iso: eng
page: 773-780
publication: Artificial Life XII (ALife XII), Odense, Denmark
publisher: MIT Press
status: public
title: 'Artificial Hormone Reaction Networks: Towards Higher Evolvability in Evolutionary
Multi-Modular Robotics'
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '20226'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Bernd
full_name: Meyer, Bernd
last_name: Meyer
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Hamann H, Meyer B, Schmickl T, Crailsheim K. A Model of Symmetry Breaking
in Collective Decision-Making. In: From Animals to Animats 11. Vol 6226.
Springer; 2010:639-648. doi:10.1007/978-3-642-15193-4_60'
apa: Hamann, H., Meyer, B., Schmickl, T., & Crailsheim, K. (2010). A Model of
Symmetry Breaking in Collective Decision-Making. In From Animals to Animats
11 (Vol. 6226, pp. 639–648). Springer. https://doi.org/10.1007/978-3-642-15193-4_60
bibtex: '@inproceedings{Hamann_Meyer_Schmickl_Crailsheim_2010, title={A Model of
Symmetry Breaking in Collective Decision-Making}, volume={6226}, DOI={10.1007/978-3-642-15193-4_60},
booktitle={From Animals to Animats 11}, publisher={Springer}, author={Hamann,
Heiko and Meyer, Bernd and Schmickl, Thomas and Crailsheim, Karl}, year={2010},
pages={639–648} }'
chicago: Hamann, Heiko, Bernd Meyer, Thomas Schmickl, and Karl Crailsheim. “A Model
of Symmetry Breaking in Collective Decision-Making.” In From Animals to Animats
11, 6226:639–48. Springer, 2010. https://doi.org/10.1007/978-3-642-15193-4_60.
ieee: H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry
Breaking in Collective Decision-Making,” in From Animals to Animats 11,
2010, vol. 6226, pp. 639–648.
mla: Hamann, Heiko, et al. “A Model of Symmetry Breaking in Collective Decision-Making.”
From Animals to Animats 11, vol. 6226, Springer, 2010, pp. 639–48, doi:10.1007/978-3-642-15193-4_60.
short: 'H. Hamann, B. Meyer, T. Schmickl, K. Crailsheim, in: From Animals to Animats
11, Springer, 2010, pp. 639–648.'
date_created: 2020-10-29T14:22:12Z
date_updated: 2022-01-06T06:54:24Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-15193-4_60
intvolume: ' 6226'
language:
- iso: eng
page: 639-648
publication: From Animals to Animats 11
publication_identifier:
isbn:
- '9783642151927'
- '9783642151934'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: A Model of Symmetry Breaking in Collective Decision-Making
type: conference
user_id: '15415'
volume: 6226
year: '2010'
...
---
_id: '20258'
abstract:
- lang: eng
text: Self-organization in natural systems demonstrates very reliable and scalable
collective behavior without using any central elements. When providing collective
robotic systems with self-organizing principles, we are facing new problems of
making self-organization purposeful, self-adapting to changing environments and
faster, in order to meet requirements from a technical perspective. This paper
describes on-going work of creating such an artificial self-organization within
artificial robot organisms, performed in the framework of several European projects.
author:
- first_name: Serge
full_name: Kernbach, Serge
last_name: Kernbach
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Ronald
full_name: Thenius, Ronald
last_name: Thenius
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
- first_name: A.C. van
full_name: Rossum, A.C. van
last_name: Rossum
- first_name: Michele
full_name: Sebag, Michele
last_name: Sebag
- first_name: Nicolas
full_name: Bredeche, Nicolas
last_name: Bredeche
- first_name: Yao
full_name: Yao, Yao
last_name: Yao
- first_name: Guy
full_name: Baele, Guy
last_name: Baele
- first_name: Yves Van de
full_name: Peer, Yves Van de
last_name: Peer
- first_name: Jon
full_name: Timmis, Jon
last_name: Timmis
- first_name: Maizura
full_name: Mohktar, Maizura
last_name: Mohktar
- first_name: Andy
full_name: Tyrrell, Andy
last_name: Tyrrell
- first_name: A.E.
full_name: Eiben, A.E.
last_name: Eiben
- first_name: S.P.
full_name: McKibbin, S.P.
last_name: McKibbin
- first_name: Wenguo
full_name: Liu, Wenguo
last_name: Liu
- first_name: Alan F.T.
full_name: Winfield, Alan F.T.
last_name: Winfield
citation:
ama: 'Kernbach S, Hamann H, Stradner J, et al. On Adaptive Self-Organization in
Artificial Robot Organisms. In: 2009 Computation World: Future Computing, Service
Computation, Cognitive, Adaptive, Content, Patterns. ; 2010. doi:10.1109/computationworld.2009.9'
apa: 'Kernbach, S., Hamann, H., Stradner, J., Thenius, R., Schmickl, T., Crailsheim,
K., … Winfield, A. F. T. (2010). On Adaptive Self-Organization in Artificial Robot
Organisms. In 2009 Computation World: Future Computing, Service Computation,
Cognitive, Adaptive, Content, Patterns. https://doi.org/10.1109/computationworld.2009.9'
bibtex: '@inproceedings{Kernbach_Hamann_Stradner_Thenius_Schmickl_Crailsheim_Rossum_Sebag_Bredeche_Yao_et
al._2010, title={On Adaptive Self-Organization in Artificial Robot Organisms},
DOI={10.1109/computationworld.2009.9},
booktitle={2009 Computation World: Future Computing, Service Computation, Cognitive,
Adaptive, Content, Patterns}, author={Kernbach, Serge and Hamann, Heiko and Stradner,
Jürgen and Thenius, Ronald and Schmickl, Thomas and Crailsheim, Karl and Rossum,
A.C. van and Sebag, Michele and Bredeche, Nicolas and Yao, Yao and et al.}, year={2010}
}'
chicago: 'Kernbach, Serge, Heiko Hamann, Jürgen Stradner, Ronald Thenius, Thomas
Schmickl, Karl Crailsheim, A.C. van Rossum, et al. “On Adaptive Self-Organization
in Artificial Robot Organisms.” In 2009 Computation World: Future Computing,
Service Computation, Cognitive, Adaptive, Content, Patterns, 2010. https://doi.org/10.1109/computationworld.2009.9.'
ieee: 'S. Kernbach et al., “On Adaptive Self-Organization in Artificial Robot
Organisms,” in 2009 Computation World: Future Computing, Service Computation,
Cognitive, Adaptive, Content, Patterns, 2010.'
mla: 'Kernbach, Serge, et al. “On Adaptive Self-Organization in Artificial Robot
Organisms.” 2009 Computation World: Future Computing, Service Computation,
Cognitive, Adaptive, Content, Patterns, 2010, doi:10.1109/computationworld.2009.9.'
short: 'S. Kernbach, H. Hamann, J. Stradner, R. Thenius, T. Schmickl, K. Crailsheim,
A.C. van Rossum, M. Sebag, N. Bredeche, Y. Yao, G. Baele, Y.V. de Peer, J. Timmis,
M. Mohktar, A. Tyrrell, A.E. Eiben, S.P. McKibbin, W. Liu, A.F.T. Winfield, in:
2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive,
Content, Patterns, 2010.'
date_created: 2020-11-02T14:13:10Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/computationworld.2009.9
language:
- iso: eng
publication: '2009 Computation World: Future Computing, Service Computation, Cognitive,
Adaptive, Content, Patterns'
publication_identifier:
isbn:
- '9781424451661'
publication_status: published
status: public
title: On Adaptive Self-Organization in Artificial Robot Organisms
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '24282'
author:
- first_name: Ryszard
full_name: Grza̧ślewicz, Ryszard
last_name: Grza̧ślewicz
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Mirosław
full_name: Kutyłowski, Mirosław
last_name: Kutyłowski
- first_name: Wojciech
full_name: Pietkiewicz, Wojciech
last_name: Pietkiewicz
citation:
ama: 'Grza̧ślewicz R, Kutyłowski J, Kutyłowski M, Pietkiewicz W. Robust Undetectable
Interference Watermarks. ICCSA’05: Proceedings of the 2005 international conference
on Computational Science and Its Applications. Published online 2010. doi:10.1007/11424826_55'
apa: 'Grza̧ślewicz, R., Kutyłowski, J., Kutyłowski, M., & Pietkiewicz, W. (2010).
Robust Undetectable Interference Watermarks. ICCSA’05: Proceedings of the 2005
International Conference on Computational Science and Its Applications. https://doi.org/10.1007/11424826_55'
bibtex: '@article{Grza̧ślewicz_Kutyłowski_Kutyłowski_Pietkiewicz_2010, title={Robust
Undetectable Interference Watermarks}, DOI={10.1007/11424826_55},
journal={ICCSA’05: Proceedings of the 2005 international conference on Computational
Science and Its Applications}, author={Grza̧ślewicz, Ryszard and Kutyłowski, Jarosław
and Kutyłowski, Mirosław and Pietkiewicz, Wojciech}, year={2010} }'
chicago: 'Grza̧ślewicz, Ryszard, Jarosław Kutyłowski, Mirosław Kutyłowski, and Wojciech
Pietkiewicz. “Robust Undetectable Interference Watermarks.” ICCSA’05: Proceedings
of the 2005 International Conference on Computational Science and Its Applications,
2010. https://doi.org/10.1007/11424826_55.'
ieee: 'R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, and W. Pietkiewicz, “Robust
Undetectable Interference Watermarks,” ICCSA’05: Proceedings of the 2005 international
conference on Computational Science and Its Applications, 2010, doi: 10.1007/11424826_55.'
mla: 'Grza̧ślewicz, Ryszard, et al. “Robust Undetectable Interference Watermarks.”
ICCSA’05: Proceedings of the 2005 International Conference on Computational
Science and Its Applications, 2010, doi:10.1007/11424826_55.'
short: 'R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, W. Pietkiewicz, ICCSA’05:
Proceedings of the 2005 International Conference on Computational Science and
Its Applications (2010).'
date_created: 2021-09-13T14:53:37Z
date_updated: 2022-01-06T06:56:17Z
department:
- _id: '63'
doi: 10.1007/11424826_55
language:
- iso: eng
publication: 'ICCSA''05: Proceedings of the 2005 international conference on Computational
Science and Its Applications'
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Robust Undetectable Interference Watermarks
type: journal_article
user_id: '15415'
year: '2010'
...
---
_id: '27159'
author:
- first_name: Sufyan
full_name: Samara, Sufyan
last_name: Samara
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: 'Samara S, Schomaker G. Real-time Adaptation and Load Balancing Aware OS Services
for Distributed Reconfigurable System on Chip. In: 2010 10th IEEE International
Conference on Computer and Information Technology. ; 2010. doi:10.1109/cit.2010.304'
apa: Samara, S., & Schomaker, G. (2010). Real-time Adaptation and Load Balancing
Aware OS Services for Distributed Reconfigurable System on Chip. 2010 10th
IEEE International Conference on Computer and Information Technology. https://doi.org/10.1109/cit.2010.304
bibtex: '@inproceedings{Samara_Schomaker_2010, title={Real-time Adaptation and Load
Balancing Aware OS Services for Distributed Reconfigurable System on Chip}, DOI={10.1109/cit.2010.304}, booktitle={2010
10th IEEE International Conference on Computer and Information Technology}, author={Samara,
Sufyan and Schomaker, Gunnar}, year={2010} }'
chicago: Samara, Sufyan, and Gunnar Schomaker. “Real-Time Adaptation and Load Balancing
Aware OS Services for Distributed Reconfigurable System on Chip.” In 2010 10th
IEEE International Conference on Computer and Information Technology, 2010.
https://doi.org/10.1109/cit.2010.304.
ieee: 'S. Samara and G. Schomaker, “Real-time Adaptation and Load Balancing Aware
OS Services for Distributed Reconfigurable System on Chip,” 2010, doi: 10.1109/cit.2010.304.'
mla: Samara, Sufyan, and Gunnar Schomaker. “Real-Time Adaptation and Load Balancing
Aware OS Services for Distributed Reconfigurable System on Chip.” 2010 10th
IEEE International Conference on Computer and Information Technology, 2010,
doi:10.1109/cit.2010.304.
short: 'S. Samara, G. Schomaker, in: 2010 10th IEEE International Conference on
Computer and Information Technology, 2010.'
date_created: 2021-11-04T15:53:55Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '63'
- _id: '26'
doi: 10.1109/cit.2010.304
language:
- iso: eng
publication: 2010 10th IEEE International Conference on Computer and Information Technology
publication_status: published
status: public
title: Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable
System on Chip
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '17422'
abstract:
- lang: eng
text: "Commercial software of material flow simulations has the ability to layout
the simulated models. Arranged equipment, such as conveyors or machines, includes
the need to model and determine motion paths for moving objects like forklifts
or automatically guided vehicles, so that the simulation framework is able to
navigate all vehicles across those motion paths. After analyzing first scenarios,
the user often carries out layout changes in the simulation model, e.g. moving,
adding or deleting equipment. However, those changes cause time consuming, additional
modeling of the motion paths for the user. Our motion planning algorithm reduces
these changes by automatically determining the motion paths for moving objects,
depending on an actual model layout without colliding with other objects. The
algorithm works on the basis of the virtual scene\x92s 3D-data used for the simulation
model\x92s visualization. We demonstrate the technique with a multi-floor building
example."
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Hendrik
full_name: Renken, Hendrik
last_name: Renken
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Guido
full_name: Schaumann, Guido
last_name: Schaumann
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Fischer M, Renken H, Laroque C, Schaumann G, Dangelmaier W. Automated 3D-motion
planning for ramps and stairs in intra-logistics material flow simulations. In:
Proceedings of the 2010 Winter Simulation Conference. ; 2010. doi:10.1109/wsc.2010.5678906'
apa: Fischer, M., Renken, H., Laroque, C., Schaumann, G., & Dangelmaier, W.
(2010). Automated 3D-motion planning for ramps and stairs in intra-logistics material
flow simulations. In Proceedings of the 2010 Winter Simulation Conference.
https://doi.org/10.1109/wsc.2010.5678906
bibtex: '@inproceedings{Fischer_Renken_Laroque_Schaumann_Dangelmaier_2010, title={Automated
3D-motion planning for ramps and stairs in intra-logistics material flow simulations},
DOI={10.1109/wsc.2010.5678906},
booktitle={Proceedings of the 2010 Winter Simulation Conference}, author={Fischer,
Matthias and Renken, Hendrik and Laroque, Christoph and Schaumann, Guido and Dangelmaier,
Wilhelm}, year={2010} }'
chicago: Fischer, Matthias, Hendrik Renken, Christoph Laroque, Guido Schaumann,
and Wilhelm Dangelmaier. “Automated 3D-Motion Planning for Ramps and Stairs in
Intra-Logistics Material Flow Simulations.” In Proceedings of the 2010 Winter
Simulation Conference, 2010. https://doi.org/10.1109/wsc.2010.5678906.
ieee: M. Fischer, H. Renken, C. Laroque, G. Schaumann, and W. Dangelmaier, “Automated
3D-motion planning for ramps and stairs in intra-logistics material flow simulations,”
in Proceedings of the 2010 Winter Simulation Conference, 2010.
mla: Fischer, Matthias, et al. “Automated 3D-Motion Planning for Ramps and Stairs
in Intra-Logistics Material Flow Simulations.” Proceedings of the 2010 Winter
Simulation Conference, 2010, doi:10.1109/wsc.2010.5678906.
short: 'M. Fischer, H. Renken, C. Laroque, G. Schaumann, W. Dangelmaier, in: Proceedings
of the 2010 Winter Simulation Conference, 2010.'
date_created: 2020-07-27T19:33:16Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
doi: 10.1109/wsc.2010.5678906
language:
- iso: eng
publication: Proceedings of the 2010 Winter Simulation Conference
publication_identifier:
isbn:
- '9781424498666'
publication_status: published
status: public
title: Automated 3D-motion planning for ramps and stairs in intra-logistics material
flow simulations
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '17462'
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ulf-Peter
full_name: Schroeder, Ulf-Peter
id: '477'
last_name: Schroeder
citation:
ama: 'Gehweiler J, Meyer auf der Heide F, Schroeder U-P. A Large-Scale Distributed
Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf Institut;
2010.'
apa: 'Gehweiler, J., Meyer auf der Heide, F., & Schroeder, U.-P. (2010). A
Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn:
Heinz Nixdorf Institut.'
bibtex: '@book{Gehweiler_Meyer auf der Heide_Schroeder_2010, place={Paderborn},
title={A Large-Scale Distributed Environment for Peer-to-Peer Services}, publisher={Heinz
Nixdorf Institut}, author={Gehweiler, Joachim and Meyer auf der Heide, Friedhelm
and Schroeder, Ulf-Peter}, year={2010} }'
chicago: 'Gehweiler, Joachim, Friedhelm Meyer auf der Heide, and Ulf-Peter Schroeder.
A Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn:
Heinz Nixdorf Institut, 2010.'
ieee: 'J. Gehweiler, F. Meyer auf der Heide, and U.-P. Schroeder, A Large-Scale
Distributed Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf
Institut, 2010.'
mla: Gehweiler, Joachim, et al. A Large-Scale Distributed Environment for Peer-to-Peer
Services. Heinz Nixdorf Institut, 2010.
short: J. Gehweiler, F. Meyer auf der Heide, U.-P. Schroeder, A Large-Scale Distributed
Environment for Peer-to-Peer Services, Heinz Nixdorf Institut, Paderborn, 2010.
date_created: 2020-07-30T07:25:59Z
date_updated: 2022-01-06T06:53:12Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-07-30T07:24:17Z
date_updated: 2020-07-30T07:24:17Z
file_id: '17463'
file_name: tr-ri-10-317.pdf
file_size: 468844
relation: main_file
success: 1
file_date_updated: 2020-07-30T07:24:17Z
has_accepted_license: '1'
language:
- iso: eng
place: Paderborn
publisher: Heinz Nixdorf Institut
report_number: tr-ri-10-317
status: public
title: A Large-Scale Distributed Environment for Peer-to-Peer Services
type: report
user_id: '15415'
year: '2010'
...
---
_id: '17464'
author:
- first_name: Maria J.
full_name: Blesa, Maria J.
last_name: Blesa
- first_name: Christian
full_name: Blum, Christian
last_name: Blum
- first_name: Angelo
full_name: de Caro, Angelo
last_name: de Caro
- first_name: 'Bastian '
full_name: 'Degener, Bastian '
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Piere
full_name: Leone, Piere
last_name: Leone
- first_name: Giuseppe
full_name: Persiano, Giuseppe
last_name: Persiano
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Georgios
full_name: Mylonas, Georgios
last_name: Mylonas
citation:
ama: Blesa MJ, Blum C, de Caro A, et al. Adapting a Sensor Net to the Dynamic
Environment in a Wildlife Scenario - a Case Study.; 2010.
apa: Blesa, M. J., Blum, C., de Caro, A., Degener, B., Kempkes, B., Leone, P., …
Mylonas, G. (2010). Adapting a sensor net to the dynamic environment in a wildlife
scenario - a case study.
bibtex: '@book{Blesa_Blum_de Caro_Degener_Kempkes_Leone_Persiano_Meyer auf der Heide_Mylonas_2010,
title={Adapting a sensor net to the dynamic environment in a wildlife scenario
- a case study}, author={Blesa, Maria J. and Blum, Christian and de Caro, Angelo
and Degener, Bastian and Kempkes, Barbara and Leone, Piere and Persiano, Giuseppe
and Meyer auf der Heide, Friedhelm and Mylonas, Georgios}, year={2010} }'
chicago: Blesa, Maria J., Christian Blum, Angelo de Caro, Bastian Degener, Barbara
Kempkes, Piere Leone, Giuseppe Persiano, Friedhelm Meyer auf der Heide, and Georgios
Mylonas. Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario
- a Case Study, 2010.
ieee: M. J. Blesa et al., Adapting a sensor net to the dynamic environment
in a wildlife scenario - a case study. 2010.
mla: Blesa, Maria J., et al. Adapting a Sensor Net to the Dynamic Environment
in a Wildlife Scenario - a Case Study. 2010.
short: M.J. Blesa, C. Blum, A. de Caro, B. Degener, B. Kempkes, P. Leone, G. Persiano,
F. Meyer auf der Heide, G. Mylonas, Adapting a Sensor Net to the Dynamic Environment
in a Wildlife Scenario - a Case Study, 2010.
date_created: 2020-07-30T07:48:53Z
date_updated: 2022-01-06T06:53:12Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-07-30T07:48:24Z
date_updated: 2020-07-30T07:48:24Z
file_id: '17466'
file_name: FRONTS-TR-2010-11.pdf
file_size: 242286
relation: main_file
success: 1
file_date_updated: 2020-07-30T07:48:24Z
has_accepted_license: '1'
language:
- iso: eng
report_number: FRONTS-TR-2010-11
status: public
title: Adapting a sensor net to the dynamic environment in a wildlife scenario - a
case study
type: report
user_id: '15415'
year: '2010'
...
---
_id: '17586'
abstract:
- lang: eng
text: 'We are given a winding chain of $n$ mobile robots between two stations in
the plane, each of them having a limited viewing range. It is only guaranteed
that each robot can see its two neighbors in the chain. We analyze a simple and
natural parallel strategy to shorten the chain in a time model where each relay
is allowed to move up to a distance of $\delta$ in each time step. This model
fills the gap between the previously used discrete time model and the continuous
time model which was introduced recently in \cite{sirocco}. We analyze the strategy
with respect to two quality measures: the number of time steps and the maximum
distance to be traveled by the robots, which are the major energy consumers in
this scenario. We provide asymptotically tight or almost tight bounds in this
time model for both quality measures and it turns out that the best choice for
$\delta$ is $\delta \in \Theta(\frac{1}{n})$, since this minimizes the number
of time steps as well as the maximum traveled distance.'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Building short chains
of mobile robots locally with a bounded stepwidth. 2010.
apa: Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2010).
Building short chains of mobile robots locally with a bounded stepwidth.
bibtex: '@article{Brandes_Degener_Kempkes_Meyer auf der Heide_2010, title={Building
short chains of mobile robots locally with a bounded stepwidth}, author={Brandes,
Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
year={2010} }'
chicago: Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer
auf der Heide. “Building Short Chains of Mobile Robots Locally with a Bounded
Stepwidth,” 2010.
ieee: P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building
short chains of mobile robots locally with a bounded stepwidth.” 2010.
mla: Brandes, Philipp, et al. Building Short Chains of Mobile Robots Locally
with a Bounded Stepwidth. 2010.
short: P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, (2010).
date_created: 2020-08-04T12:28:05Z
date_updated: 2022-01-06T06:53:15Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-04T12:26:55Z
date_updated: 2020-08-04T12:26:55Z
file_id: '17587'
file_name: BoundedStepwidth.pdf
file_size: 476532
relation: main_file
success: 1
file_date_updated: 2020-08-04T12:26:55Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Building short chains of mobile robots locally with a bounded stepwidth
type: preprint
user_id: '15415'
year: '2010'
...
---
_id: '17665'
author:
- first_name: Reuven
full_name: Bar-Yehuda, Reuven
last_name: Bar-Yehuda
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Dror
full_name: Rawitz, Dror
last_name: Rawitz
citation:
ama: 'Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks
with multiple interferences. In: DIALM-PODC. ; 2010:33-42.'
apa: Bar-Yehuda, R., Polevoy, G., & Rawitz, D. (2010). Bandwidth allocation
in cellular networks with multiple interferences. In DIALM-PODC (pp. 33–42).
bibtex: '@inproceedings{Bar-Yehuda_Polevoy_Rawitz_2010, title={Bandwidth allocation
in cellular networks with multiple interferences}, booktitle={DIALM-PODC}, author={Bar-Yehuda,
Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2010}, pages={33–42} }'
chicago: Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation
in Cellular Networks with Multiple Interferences.” In DIALM-PODC, 33–42,
2010.
ieee: R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular
networks with multiple interferences,” in DIALM-PODC, 2010, pp. 33–42.
mla: Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with
Multiple Interferences.” DIALM-PODC, 2010, pp. 33–42.
short: 'R. Bar-Yehuda, G. Polevoy, D. Rawitz, in: DIALM-PODC, 2010, pp. 33–42.'
date_created: 2020-08-06T15:22:47Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
language:
- iso: eng
page: 33-42
publication: DIALM-PODC
status: public
title: Bandwidth allocation in cellular networks with multiple interferences
type: conference
user_id: '83983'
year: '2010'
...
---
_id: '18761'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
- first_name: Paul
full_name: Levi, Paul
last_name: Levi
- first_name: Serge
full_name: Kernbach, Serge
last_name: Kernbach
citation:
ama: 'Hamann H, Schmickl T, Stradner J, Crailsheim K, Levi P, Kernbach S. Hormone-based
Control for Multi-modular Robotics. In: Symbiotic Multi-Robot Organisms: Reliability,
Adaptability, Evolution. Springer; 2010:240--263.'
apa: 'Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., Levi, P., & Kernbach,
S. (2010). Hormone-based Control for Multi-modular Robotics. In Symbiotic Multi-Robot
Organisms: Reliability, Adaptability, Evolution (pp. 240--263). Springer.'
bibtex: '@inbook{Hamann_Schmickl_Stradner_Crailsheim_Levi_Kernbach_2010, title={Hormone-based
Control for Multi-modular Robotics}, booktitle={Symbiotic Multi-Robot Organisms:
Reliability, Adaptability, Evolution}, publisher={Springer}, author={Hamann, Heiko
and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Levi, Paul
and Kernbach, Serge}, year={2010}, pages={240--263} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, Paul
Levi, and Serge Kernbach. “Hormone-Based Control for Multi-Modular Robotics.”
In Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution,
240--263. Springer, 2010.'
ieee: 'H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Levi, and S. Kernbach,
“Hormone-based Control for Multi-modular Robotics,” in Symbiotic Multi-Robot
Organisms: Reliability, Adaptability, Evolution, Springer, 2010, pp. 240--263.'
mla: 'Hamann, Heiko, et al. “Hormone-Based Control for Multi-Modular Robotics.”
Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution,
Springer, 2010, pp. 240--263.'
short: 'H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Levi, S. Kernbach,
in: Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, Springer,
2010, pp. 240--263.'
date_created: 2020-09-01T11:29:17Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 240--263
publication: 'Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution'
publication_status: published
publisher: Springer
status: public
title: Hormone-based Control for Multi-modular Robotics
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '18910'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
citation:
ama: Bienkowski M. Page Migration in Dynamic Networks. Vol 282. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2010.
apa: Bienkowski, M. (2010). Page migration in dynamic networks (Vol. 282).
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Bienkowski_2010, series={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, title={Page migration in dynamic networks}, volume={282},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bienkowski,
Marcin}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Bienkowski, Marcin. Page Migration in Dynamic Networks. Vol. 282.
Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: M. Bienkowski, Page migration in dynamic networks, vol. 282. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
mla: Bienkowski, Marcin. Page Migration in Dynamic Networks. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
short: M. Bienkowski, Page Migration in Dynamic Networks, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
date_created: 2020-09-03T07:52:47Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 282'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-01-4
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-2005010135
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: Page migration in dynamic networks
type: dissertation
user_id: '5786'
volume: 282
year: '2010'
...
---
_id: '18927'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
citation:
ama: Dynia M. Collective Graph Exploration. Vol 284. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2010.
apa: Dynia, M. (2010). Collective graph exploration (Vol. 284). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Dynia_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Collective graph exploration}, volume={284}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Dynia, Miroslaw}, year={2010},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Dynia, Miroslaw. Collective Graph Exploration. Vol. 284. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2010.
ieee: M. Dynia, Collective graph exploration, vol. 284. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
mla: Dynia, Miroslaw. Collective Graph Exploration. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
short: M. Dynia, Collective Graph Exploration, Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2010.
date_created: 2020-09-03T10:21:10Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 284'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-03-8
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-20080225031
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: Collective graph exploration
type: dissertation
user_id: '5786'
volume: 284
year: '2010'
...
---
_id: '19011'
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. Kinetic Facility Location. Algorithmica.
2010;57(3):562-584. doi:10.1007/s00453-008-9250-7
apa: Degener, B., Gehweiler, J., & Lammersen, C. (2010). Kinetic Facility Location.
Algorithmica, 57(3), 562–584. https://doi.org/10.1007/s00453-008-9250-7
bibtex: '@article{Degener_Gehweiler_Lammersen_2010, title={Kinetic Facility Location},
volume={57}, DOI={10.1007/s00453-008-9250-7},
number={3}, journal={Algorithmica}, author={Degener, Bastian and Gehweiler, Joachim
and Lammersen, Christiane}, year={2010}, pages={562–584} }'
chicago: 'Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “Kinetic
Facility Location.” Algorithmica 57, no. 3 (2010): 562–84. https://doi.org/10.1007/s00453-008-9250-7.'
ieee: B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” Algorithmica,
vol. 57, no. 3, pp. 562–584, 2010.
mla: Degener, Bastian, et al. “Kinetic Facility Location.” Algorithmica,
vol. 57, no. 3, 2010, pp. 562–84, doi:10.1007/s00453-008-9250-7.
short: B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584.
date_created: 2020-09-04T10:35:36Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/s00453-008-9250-7
intvolume: ' 57'
issue: '3'
language:
- iso: eng
page: 562-584
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
status: public
title: Kinetic Facility Location
type: journal_article
user_id: '15415'
volume: 57
year: '2010'
...
---
_id: '19013'
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Henning
full_name: Meyerhenke, Henning
last_name: Meyerhenke
citation:
ama: 'Gehweiler J, Meyerhenke H. A distributed diffusive heuristic for clustering
a virtual P2P supercomputer. In: Proceeedings of 24th International Parallel
and Distributed Processing Symposium (IPDPS, HPGC). ; 2010. doi:10.1109/ipdpsw.2010.5470922'
apa: Gehweiler, J., & Meyerhenke, H. (2010). A distributed diffusive heuristic
for clustering a virtual P2P supercomputer. In Proceeedings of 24th International
Parallel and Distributed Processing Symposium (IPDPS, HPGC). https://doi.org/10.1109/ipdpsw.2010.5470922
bibtex: '@inproceedings{Gehweiler_Meyerhenke_2010, title={A distributed diffusive
heuristic for clustering a virtual P2P supercomputer}, DOI={10.1109/ipdpsw.2010.5470922},
booktitle={Proceeedings of 24th International Parallel and Distributed Processing
Symposium (IPDPS, HPGC)}, author={Gehweiler, Joachim and Meyerhenke, Henning},
year={2010} }'
chicago: Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic
for Clustering a Virtual P2P Supercomputer.” In Proceeedings of 24th International
Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010. https://doi.org/10.1109/ipdpsw.2010.5470922.
ieee: J. Gehweiler and H. Meyerhenke, “A distributed diffusive heuristic for clustering
a virtual P2P supercomputer,” in Proceeedings of 24th International Parallel
and Distributed Processing Symposium (IPDPS, HPGC), 2010.
mla: Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic
for Clustering a Virtual P2P Supercomputer.” Proceeedings of 24th International
Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010, doi:10.1109/ipdpsw.2010.5470922.
short: 'J. Gehweiler, H. Meyerhenke, in: Proceeedings of 24th International Parallel
and Distributed Processing Symposium (IPDPS, HPGC), 2010.'
date_created: 2020-09-04T10:39:37Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1109/ipdpsw.2010.5470922
language:
- iso: eng
publication: Proceeedings of 24th International Parallel and Distributed Processing
Symposium (IPDPS, HPGC)
publication_identifier:
isbn:
- '9781424465330'
publication_status: published
status: public
title: A distributed diffusive heuristic for clustering a virtual P2P supercomputer
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19016'
abstract:
- lang: eng
text: Load balancing is an important requirement for the efficient execu-tion of
parallel numerical simulations. In particular when the simulation domainchanges
over time, the mapping of computational tasks to processors needs tobe modified accordingly. State-of-the-art libraries for this problem are basedon
graph repartitioning. They have a number of drawbacks, including the opti-mized
metric and the difficulty of parallelizing the popular repartitioning heuris-tic
Kernighan-Lin (KL).Here we further explore the very promising diffusion-based
graph partitioningalgorithm DIBAP (Meyerhenke et al., JPDC 69(9):750–761, 2009)
by adaptingDIBAP to the related problem of load balancing. Experiments with graph se-quences
that imitate adaptive numerical simulations demonstrate the applicabilityand high
quality of DIBAP for load balancing by repartitioning. Compared to thefaster state-of-the-art
repartitioners PARMETIS and parallel JOSTLE, DIBAP’ssolutions have partitions
with significantly fewer external edges and boundarynodes and the resulting average migration volume in the important maximumnorm
is also the best in most cases.We also prove that one of DIBAP’s key components
optimizes a relaxed versionof the minimum edge cut problem. Moreover, we hint
at a distributed algorithmbased on ideas used in DIBAP for clustering a virtual
P2P supercomputer.
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Henning
full_name: Meyerhenke, Henning
last_name: Meyerhenke
citation:
ama: 'Gehweiler J, Meyerhenke H. On Dynamic Graph Partitioning and Graph Clustering
using Diffusion. In: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering.
; 2010.'
apa: 'Gehweiler, J., & Meyerhenke, H. (2010). On Dynamic Graph Partitioning
and Graph Clustering using Diffusion. In Dagstuhl Seminar Proceedings 10261:
Algorithm Engineering.'
bibtex: '@inproceedings{Gehweiler_Meyerhenke_2010, title={On Dynamic Graph Partitioning
and Graph Clustering using Diffusion}, booktitle={Dagstuhl Seminar Proceedings
10261: Algorithm Engineering}, author={Gehweiler, Joachim and Meyerhenke, Henning},
year={2010} }'
chicago: 'Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning
and Graph Clustering Using Diffusion.” In Dagstuhl Seminar Proceedings 10261:
Algorithm Engineering, 2010.'
ieee: 'J. Gehweiler and H. Meyerhenke, “On Dynamic Graph Partitioning and Graph
Clustering using Diffusion,” in Dagstuhl Seminar Proceedings 10261: Algorithm
Engineering, 2010.'
mla: 'Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning
and Graph Clustering Using Diffusion.” Dagstuhl Seminar Proceedings 10261:
Algorithm Engineering, 2010.'
short: 'J. Gehweiler, H. Meyerhenke, in: Dagstuhl Seminar Proceedings 10261: Algorithm
Engineering, 2010.'
date_created: 2020-09-04T10:45:47Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
language:
- iso: eng
publication: 'Dagstuhl Seminar Proceedings 10261: Algorithm Engineering'
related_material:
link:
- relation: confirmation
url: https://drops.dagstuhl.de/opus/volltexte/2010/2798/pdf/10261.MeyerhenkeHenning.Paper.2798.pdf
status: public
title: On Dynamic Graph Partitioning and Graph Clustering using Diffusion
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19018'
author:
- first_name: Michael
full_name: Thies, Michael
last_name: Thies
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
citation:
ama: Thies M, Gehweiler J. Thread Migration and Checkpointing in Java.; 2010.
apa: Thies, M., & Gehweiler, J. (2010). Thread Migration and Checkpointing
in Java.
bibtex: '@book{Thies_Gehweiler_2010, title={Thread Migration and Checkpointing in
Java}, author={Thies, Michael and Gehweiler, Joachim}, year={2010} }'
chicago: Thies, Michael, and Joachim Gehweiler. Thread Migration and Checkpointing
in Java, 2010.
ieee: M. Thies and J. Gehweiler, Thread Migration and Checkpointing in Java.
2010.
mla: Thies, Michael, and Joachim Gehweiler. Thread Migration and Checkpointing
in Java. 2010.
short: M. Thies, J. Gehweiler, Thread Migration and Checkpointing in Java, 2010.
date_created: 2020-09-04T10:54:43Z
date_updated: 2022-01-06T06:53:57Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-04T10:54:26Z
date_updated: 2020-09-04T10:54:26Z
file_id: '19020'
file_name: tr-ri-10-315.pdf
file_size: 240725
relation: main_file
success: 1
file_date_updated: 2020-09-04T10:54:26Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Thread Migration and Checkpointing in Java
type: report
user_id: '15415'
year: '2010'
...
---
_id: '19023'
author:
- first_name: Serge
full_name: Kernbach, Serge
last_name: Kernbach
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Florian
full_name: Schlachter, Florian
last_name: Schlachter
- first_name: Christopher s. F.
full_name: Schwarzer, Christopher s. F.
last_name: Schwarzer
- first_name: Alan F. T.
full_name: Winfield, Alan F. T.
last_name: Winfield
- first_name: Rene
full_name: Matthias, Rene
last_name: Matthias
citation:
ama: 'Kernbach S, Schmickl T, Hamann H, et al. Adaptive Action Selection Mechanisms
for Evolutionary Multimodular Robotics. In: Artificial Life XII (ALife XII).
MIT Press; 2010:781-788.'
apa: Kernbach, S., Schmickl, T., Hamann, H., Stradner, J., Schlachter, F., Schwarzer,
C. s. F., … Matthias, R. (2010). Adaptive Action Selection Mechanisms for Evolutionary
Multimodular Robotics. In Artificial Life XII (ALife XII) (pp. 781–788).
MIT Press.
bibtex: '@inproceedings{Kernbach_Schmickl_Hamann_Stradner_Schlachter_Schwarzer_Winfield_Matthias_2010,
title={Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics},
booktitle={Artificial Life XII (ALife XII)}, publisher={MIT Press}, author={Kernbach,
Serge and Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Schlachter,
Florian and Schwarzer, Christopher s. F. and Winfield, Alan F. T. and Matthias,
Rene}, year={2010}, pages={781–788} }'
chicago: Kernbach, Serge, Thomas Schmickl, Heiko Hamann, Jürgen Stradner, Florian
Schlachter, Christopher s. F. Schwarzer, Alan F. T. Winfield, and Rene Matthias.
“Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.”
In Artificial Life XII (ALife XII), 781–88. MIT Press, 2010.
ieee: S. Kernbach et al., “Adaptive Action Selection Mechanisms for Evolutionary
Multimodular Robotics,” in Artificial Life XII (ALife XII), 2010, pp. 781–788.
mla: Kernbach, Serge, et al. “Adaptive Action Selection Mechanisms for Evolutionary
Multimodular Robotics.” Artificial Life XII (ALife XII), MIT Press, 2010,
pp. 781–88.
short: 'S. Kernbach, T. Schmickl, H. Hamann, J. Stradner, F. Schlachter, C. s. F.
Schwarzer, A.F.T. Winfield, R. Matthias, in: Artificial Life XII (ALife XII),
MIT Press, 2010, pp. 781–788.'
date_created: 2020-09-04T11:53:40Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 781-788
publication: Artificial Life XII (ALife XII)
publication_status: published
publisher: MIT Press
status: public
title: Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19029'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Parinya
full_name: Chalermsook, Parinya
last_name: Chalermsook
- first_name: Sanjeev
full_name: Khanna, Sanjeev
last_name: Khanna
- first_name: Bundit
full_name: Laekhanukit, Bundit
last_name: Laekhanukit
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness
of Approximation for Stackelberg Shortest-Path Pricing. In: Workshop on Internet
and Network Economics (WINE). ; 2010. doi:10.1007/978-3-642-17572-5_37'
apa: Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., & Nanongkai,
D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.
In Workshop on Internet and Network Economics (WINE). https://doi.org/10.1007/978-3-642-17572-5_37
bibtex: '@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved
Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={10.1007/978-3-642-17572-5_37},
booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest,
Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and
Nanongkai, Danupon}, year={2010} }'
chicago: Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit,
and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path
Pricing.” In Workshop on Internet and Network Economics (WINE), 2010. https://doi.org/10.1007/978-3-642-17572-5_37.
ieee: P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved
Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in Workshop
on Internet and Network Economics (WINE), 2010.
mla: Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg
Shortest-Path Pricing.” Workshop on Internet and Network Economics (WINE),
2010, doi:10.1007/978-3-642-17572-5_37.
short: 'P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in:
Workshop on Internet and Network Economics (WINE), 2010.'
date_created: 2020-09-04T12:01:18Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/978-3-642-17572-5_37
language:
- iso: eng
publication: Workshop on Internet and Network Economics (WINE)
publication_identifier:
isbn:
- '9783642175718'
- '9783642175725'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '1903'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme.
Informatik Spektrum. 2010;(5):468--474. doi:10.1007/s00287-010-0470-2
apa: Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen
verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2
bibtex: '@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen
verteilter Speichersysteme}, DOI={10.1007/s00287-010-0470-2},
number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian}, year={2010}, pages={468--474} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische
Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5 (2010):
468--474. https://doi.org/10.1007/s00287-010-0470-2.'
ieee: F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter
Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen
Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474,
doi:10.1007/s00287-010-0470-2.
short: F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.
date_created: 2018-03-28T07:21:50Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s00287-010-0470-2
issue: '5'
language:
- iso: eng
page: 468--474
publication: Informatik Spektrum
status: public
title: Algorithmische Grundlagen verteilter Speichersysteme
type: journal_article
user_id: '14955'
year: '2010'
...
---
_id: '19033'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Shuchi
full_name: Chawla, Shuchi
last_name: Chawla
- first_name: Robert
full_name: Kleinberg, Robert
last_name: Kleinberg
- first_name: S. Matthew
full_name: Weinberg, S. Matthew
last_name: Weinberg
citation:
ama: 'Briest P, Chawla S, Kleinberg R, Weinberg SM. Pricing Randomized Allocations.
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms.
; 2010. doi:10.1137/1.9781611973075.49'
apa: Briest, P., Chawla, S., Kleinberg, R., & Weinberg, S. M. (2010). Pricing
Randomized Allocations. In Proceedings of the Twenty-First Annual ACM-SIAM
Symposium on Discrete Algorithms. https://doi.org/10.1137/1.9781611973075.49
bibtex: '@inproceedings{Briest_Chawla_Kleinberg_Weinberg_2010, title={Pricing Randomized
Allocations}, DOI={10.1137/1.9781611973075.49},
booktitle={Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete
Algorithms}, author={Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert
and Weinberg, S. Matthew}, year={2010} }'
chicago: Briest, Patrick, Shuchi Chawla, Robert Kleinberg, and S. Matthew Weinberg.
“Pricing Randomized Allocations.” In Proceedings of the Twenty-First Annual
ACM-SIAM Symposium on Discrete Algorithms, 2010. https://doi.org/10.1137/1.9781611973075.49.
ieee: P. Briest, S. Chawla, R. Kleinberg, and S. M. Weinberg, “Pricing Randomized
Allocations,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium
on Discrete Algorithms, 2010.
mla: Briest, Patrick, et al. “Pricing Randomized Allocations.” Proceedings of
the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010, doi:10.1137/1.9781611973075.49.
short: 'P. Briest, S. Chawla, R. Kleinberg, S.M. Weinberg, in: Proceedings of the
Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.'
date_created: 2020-09-04T12:15:39Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1137/1.9781611973075.49
language:
- iso: eng
publication: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete
Algorithms
publication_identifier:
isbn:
- '9780898717013'
- '9781611973075'
publication_status: published
status: public
title: Pricing Randomized Allocations
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19041'
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
citation:
ama: Mahlmann P. Peer-to-Peer Networks Based on Random Graphs. Vol 283. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2010.
apa: Mahlmann, P. (2010). Peer-to-peer networks based on random graphs (Vol.
283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Mahlmann_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Peer-to-peer networks based on random graphs}, volume={283},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mahlmann,
Peter}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Vol.
283. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: P. Mahlmann, Peer-to-peer networks based on random graphs, vol. 283.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
mla: Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
short: P. Mahlmann, Peer-to-Peer Networks Based on Random Graphs, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
date_created: 2020-09-04T14:05:30Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 283'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-02-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-20100421015
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: Peer-to-peer networks based on random graphs
type: dissertation
user_id: '5786'
volume: 283
year: '2010'
...
---
_id: '19042'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
citation:
ama: Degener B. Local, Distributed Approximation Algorithms for Geometric Assignment
Problems. Vol 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2010.
apa: Degener, B. (2010). Local, distributed approximation algorithms for geometric
assignment problems (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.
bibtex: '@book{Degener_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Local, distributed approximation algorithms for geometric assignment
problems}, volume={278}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Degener, Bastian}, year={2010}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric
Assignment Problems. Vol. 278. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: B. Degener, Local, distributed approximation algorithms for geometric assignment
problems, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2010.
mla: Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric
Assignment Problems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2010.
short: B. Degener, Local, Distributed Approximation Algorithms for Geometric Assignment
Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
date_created: 2020-09-04T14:08:57Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 278'
language:
- iso: eng
publication_identifier:
isbn:
- '978-3-939350-97-2 '
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-20100429011
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: Local, distributed approximation algorithms for geometric assignment problems
type: dissertation
user_id: '5786'
volume: 278
year: '2010'
...
---
_id: '18136'
abstract:
- lang: eng
text: We present a parallel algorithm for the rendering of complex three-dimensional
scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting
of a visualization-node, equipped with a powerful graphics adapter, and cluster
nodes requiring weaker graphics capabilities only. The visualization-node renders
a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes
assist the visualization-node by asynchronous computing of Reliefboards, which
are used to replace and render distant parts of the scene. Our algorithm is capable
of gaining significant speedups if the cluster's nodes provide weak graphics adapters
only. We trade the number of cluster nodes off the scene objects' image quality.
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: 'Fischer M, Jähn C, Suess T. Asynchronous Parallel Reliefboard Computation
for Scene Object Approximation. In: Eurographics Symposium on Parallel Graphics
and Visualization (EGPGV). The Eurographics Association; 2010:43-51. doi:10.2312/EGPGV/EGPGV10/043-051'
apa: Fischer, M., Jähn, C., & Suess, T. (2010). Asynchronous Parallel Reliefboard
Computation for Scene Object Approximation. Eurographics Symposium on Parallel
Graphics and Visualization (EGPGV), 43–51. https://doi.org/10.2312/EGPGV/EGPGV10/043-051
bibtex: '@inproceedings{Fischer_Jähn_Suess_2010, title={Asynchronous Parallel Reliefboard
Computation for Scene Object Approximation}, DOI={10.2312/EGPGV/EGPGV10/043-051},
booktitle={Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)},
publisher={The Eurographics Association}, author={Fischer, Matthias and Jähn,
Claudius and Suess, Tim}, year={2010}, pages={43–51} }'
chicago: Fischer, Matthias, Claudius Jähn, and Tim Suess. “Asynchronous Parallel
Reliefboard Computation for Scene Object Approximation.” In Eurographics Symposium
on Parallel Graphics and Visualization (EGPGV), 43–51. The Eurographics Association,
2010. https://doi.org/10.2312/EGPGV/EGPGV10/043-051.
ieee: 'M. Fischer, C. Jähn, and T. Suess, “Asynchronous Parallel Reliefboard Computation
for Scene Object Approximation,” in Eurographics Symposium on Parallel Graphics
and Visualization (EGPGV), 2010, pp. 43–51, doi: 10.2312/EGPGV/EGPGV10/043-051.'
mla: Fischer, Matthias, et al. “Asynchronous Parallel Reliefboard Computation for
Scene Object Approximation.” Eurographics Symposium on Parallel Graphics and
Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51, doi:10.2312/EGPGV/EGPGV10/043-051.
short: 'M. Fischer, C. Jähn, T. Suess, in: Eurographics Symposium on Parallel Graphics
and Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51.'
date_created: 2020-08-24T07:07:55Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.2312/EGPGV/EGPGV10/043-051
language:
- iso: eng
page: 43-51
publication: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)
publisher: The Eurographics Association
status: public
title: Asynchronous Parallel Reliefboard Computation for Scene Object Approximation
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '18289'
abstract:
- lang: eng
text: Many professional cluster systems consist of nodes with different hardware
configurations. Such heterogeneous environments require different load-balancing
techniques than homogenous environments. The c-load-collision-protocol is able
to achieve good results for data-management purposes. Using this protocol, we
propose a way for load-balancing in interactive rendering environments. For this
work, we implemented a parallel rendering system and took different picking strategies
into account to compare the results. The advantage of our approach compared to
other approaches is that we group the available nodes of a cluster into two different
categories, based on the hardware abilities. Some nodes are used solely for rendering,
while others serve as secondary storage and to assist the former ones by performing
auxiliary calculations.
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Timo
full_name: Wiesemann, Timo
last_name: Wiesemann
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Suess T, Wiesemann T, Fischer M. Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments. In: 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage. ; 2010:448-456. doi:10.1109/nas.2010.52'
apa: Suess, T., Wiesemann, T., & Fischer, M. (2010). Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments. 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage, 448–456. https://doi.org/10.1109/nas.2010.52
bibtex: '@inproceedings{Suess_Wiesemann_Fischer_2010, title={Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments}, DOI={10.1109/nas.2010.52},
booktitle={2010 IEEE Fifth International Conference on Networking, Architecture,
and Storage}, author={Suess, Tim and Wiesemann, Timo and Fischer, Matthias}, year={2010},
pages={448–456} }'
chicago: Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Evaluation of a C-Load-Collision-Protocol
for Load-Balancing in Interactive Environments.” In 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage, 448–56, 2010. https://doi.org/10.1109/nas.2010.52.
ieee: 'T. Suess, T. Wiesemann, and M. Fischer, “Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments,” in 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage, 2010, pp. 448–456, doi:
10.1109/nas.2010.52.'
mla: Suess, Tim, et al. “Evaluation of a C-Load-Collision-Protocol for Load-Balancing
in Interactive Environments.” 2010 IEEE Fifth International Conference on Networking,
Architecture, and Storage, 2010, pp. 448–56, doi:10.1109/nas.2010.52.
short: 'T. Suess, T. Wiesemann, M. Fischer, in: 2010 IEEE Fifth International Conference
on Networking, Architecture, and Storage, 2010, pp. 448–456.'
date_created: 2020-08-25T14:04:38Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1109/nas.2010.52
language:
- iso: eng
page: 448 - 456
publication: 2010 IEEE Fifth International Conference on Networking, Architecture,
and Storage
publication_identifier:
isbn:
- '9781424481330'
publication_status: published
status: public
title: Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive
Environments
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '18290'
abstract:
- lang: ger
text: "Typischerweise sind die Knoten eines PC-Clusters nicht mit leistungsfähigen
Grafikkarten ausgestattet. Dennoch bieten Cluster-Betreiber einige wenige Rechenknoten
an, die mit Highend-Grafikkarten ausgestattet sind, um beispielsweise eine PowerWall
zu betreiben. Wenn zwischen diesen unterschiedlichen Knotentypen ein schnelles
Netzwerk existiert, kann die Bilderzeugung durch die Knoten mit schwacher Grafikkarte
beschleunigt werden. Dabei können die unterschiedlichen Knotentypen unterschiedliche
Aufgabe bearbeiten. In einem solchen heterogenen System, müssen die unterschiedlichen
entstehenden Lasten auf andere Weise verteilt werden, als in einem System, bei
dem alle Knoten gleich ausgestattet sind. Wir präsentieren in dieser Arbeit Lastbalancierungsmechanismen,
die in einem parallelen Out-of-Core-Renderingsystem für heterogene PC-Cluster
eingesetzt werden.\r\n"
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Timo
full_name: Wiesemann, Timo
last_name: Wiesemann
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Suess T, Wiesemann T, Fischer M. Gewichtetes c-Collision-Protokoll zur Balancierung
eines parallelen Out-of-Core-Renderingsystems. In: Augmented & Virtual
Reality in Der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn. ; 2010:39-52.'
apa: Suess, T., Wiesemann, T., & Fischer, M. (2010). Gewichtetes c-Collision-Protokoll
zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In Augmented
& Virtual Reality in der Produktentstehung (pp. 39–52).
bibtex: '@inbook{Suess_Wiesemann_Fischer_2010, series={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn}, title={Gewichtetes c-Collision-Protokoll
zur Balancierung eines parallelen Out-of-Core-Renderingsystems}, booktitle={Augmented
& Virtual Reality in der Produktentstehung}, author={Suess, Tim and Wiesemann,
Timo and Fischer, Matthias}, year={2010}, pages={39–52}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Gewichtetes C-Collision-Protokoll
Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” In Augmented
& Virtual Reality in Der Produktentstehung, 39–52. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: T. Suess, T. Wiesemann, and M. Fischer, “Gewichtetes c-Collision-Protokoll
zur Balancierung eines parallelen Out-of-Core-Renderingsystems,” in Augmented
& Virtual Reality in der Produktentstehung, 2010, pp. 39–52.
mla: Suess, Tim, et al. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines
Parallelen Out-of-Core-Renderingsystems.” Augmented & Virtual Reality in
Der Produktentstehung, 2010, pp. 39–52.
short: 'T. Suess, T. Wiesemann, M. Fischer, in: Augmented & Virtual Reality
in Der Produktentstehung, 2010, pp. 39–52.'
date_created: 2020-08-25T14:14:36Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
language:
- iso: eng
page: 39-52
publication: Augmented & Virtual Reality in der Produktentstehung
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '16414'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Cynthia A.
full_name: Phillips, Cynthia A.
last_name: Phillips
citation:
ama: 'Meyer auf der Heide F, Phillips CA. Proceedings of the 22nd ACM symposium
on Parallelism in algorithms and architectures - SPAA ’10. In: ; 2010. doi:10.1145/1810479'
apa: Meyer auf der Heide, F., & Phillips, C. A. (2010). Proceedings of the 22nd
ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479
bibtex: '@inproceedings{Meyer auf der Heide_Phillips_2010, title={Proceedings of
the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10},
DOI={10.1145/1810479}, author={Meyer
auf der Heide, Friedhelm and Phillips, Cynthia A.}, year={2010} }'
chicago: Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. “Proceedings of
the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10,”
2010. https://doi.org/10.1145/1810479.
ieee: F. Meyer auf der Heide and C. A. Phillips, “Proceedings of the 22nd ACM symposium
on Parallelism in algorithms and architectures - SPAA ’10,” 2010.
mla: Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. Proceedings of
the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10.
2010, doi:10.1145/1810479.
short: 'F. Meyer auf der Heide, C.A. Phillips, in: 2010.'
date_created: 2020-04-06T10:42:26Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1810479
language:
- iso: eng
publication_identifier:
isbn:
- '9781450300797'
publication_status: published
status: public
title: Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures
- SPAA '10
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '16505'
abstract:
- lang: eng
text: We present an approach for real-time rendering of complex 3D scenes consisting
of millions of polygons on limited graphics hardware. In a preprocessing step,
powerful hardware is used to gain fine granular global visibility information
of a scene using an adaptive sampling algorithm. Additively the visual influence
of each object on the eventual rendered image is estimated. This influence is
used to select the most important objects to display in our approximative culling
algorithm. After the visibility data is compressed to meet the storage capabilities
of small devices, we achieve an interactive walkthrough of the Power Plant scene
on a standard netbook with an integrated graphics chipset.
author:
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Eikel B, Jähn C, Fischer M. Preprocessed Global Visibility for Real-Time Rendering
on Low-End Hardware. In: Advances in Visual Computing. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-17289-2_60'
apa: Eikel, B., Jähn, C., & Fischer, M. (2010). Preprocessed Global Visibility
for Real-Time Rendering on Low-End Hardware. In Advances in Visual Computing.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17289-2_60
bibtex: '@inbook{Eikel_Jähn_Fischer_2010, place={Berlin, Heidelberg}, title={Preprocessed
Global Visibility for Real-Time Rendering on Low-End Hardware}, DOI={10.1007/978-3-642-17289-2_60},
booktitle={Advances in Visual Computing}, author={Eikel, Benjamin and Jähn, Claudius
and Fischer, Matthias}, year={2010} }'
chicago: Eikel, Benjamin, Claudius Jähn, and Matthias Fischer. “Preprocessed Global
Visibility for Real-Time Rendering on Low-End Hardware.” In Advances in Visual
Computing. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-17289-2_60.
ieee: B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time
Rendering on Low-End Hardware,” in Advances in Visual Computing, Berlin,
Heidelberg, 2010.
mla: Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering
on Low-End Hardware.” Advances in Visual Computing, 2010, doi:10.1007/978-3-642-17289-2_60.
short: 'B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin,
Heidelberg, 2010.'
date_created: 2020-04-14T13:06:51Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/978-3-642-17289-2_60
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
isbn:
- '9783642172885'
- '9783642172892'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '16365'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Degener B, Kempkes B, Kling P, Meyer auf der Heide F. A Continuous, Local
Strategy for Constructing a Short Chain of Mobile Robots. In: Structural Information
and Communication Complexity. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182.
doi:10.1007/978-3-642-13284-1_14'
apa: Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2010).
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.
In Structural Information and Communication Complexity (pp. 168–182). Berlin,
Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_14
bibtex: '@inbook{Degener_Kempkes_Kling_Meyer auf der Heide_2010, place={Berlin,
Heidelberg}, series={SIROCCO 2010}, title={A Continuous, Local Strategy for Constructing
a Short Chain of Mobile Robots}, DOI={10.1007/978-3-642-13284-1_14},
booktitle={Structural Information and Communication Complexity}, author={Degener,
Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm},
year={2010}, pages={168–182}, collection={SIROCCO 2010} }'
chicago: Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf
der Heide. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile
Robots.” In Structural Information and Communication Complexity, 168–82.
SIROCCO 2010. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13284-1_14.
ieee: B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous,
Local Strategy for Constructing a Short Chain of Mobile Robots,” in Structural
Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.
mla: Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short
Chain of Mobile Robots.” Structural Information and Communication Complexity,
2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.
short: 'B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural
Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.'
date_created: 2020-04-02T13:56:17Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1007/978-3-642-13284-1_14
language:
- iso: eng
page: 168-182
place: Berlin, Heidelberg
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783642132834'
- '9783642132841'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: SIROCCO 2010
status: public
title: A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '16401'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Degener B, Kempkes B, Meyer auf der Heide F. A local O(n2) gathering algorithm.
In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and
Architectures - SPAA ’10. ; 2010. doi:10.1145/1810479.1810523'
apa: Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2010). A local O(n2)
gathering algorithm. In Proceedings of the 22nd ACM symposium on Parallelism
in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479.1810523
bibtex: '@inproceedings{Degener_Kempkes_Meyer auf der Heide_2010, title={A local
O(n2) gathering algorithm}, DOI={10.1145/1810479.1810523},
booktitle={Proceedings of the 22nd ACM symposium on Parallelism in algorithms
and architectures - SPAA ’10}, author={Degener, Bastian and Kempkes, Barbara and
Meyer auf der Heide, Friedhelm}, year={2010} }'
chicago: Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A
Local O(N2) Gathering Algorithm.” In Proceedings of the 22nd ACM Symposium
on Parallelism in Algorithms and Architectures - SPAA ’10, 2010. https://doi.org/10.1145/1810479.1810523.
ieee: B. Degener, B. Kempkes, and F. Meyer auf der Heide, “A local O(n2) gathering
algorithm,” in Proceedings of the 22nd ACM symposium on Parallelism in algorithms
and architectures - SPAA ’10, 2010.
mla: Degener, Bastian, et al. “A Local O(N2) Gathering Algorithm.” Proceedings
of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
’10, 2010, doi:10.1145/1810479.1810523.
short: 'B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Proceedings of the 22nd
ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010.'
date_created: 2020-04-03T12:48:11Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1810479.1810523
language:
- iso: eng
publication: Proceedings of the 22nd ACM symposium on Parallelism in algorithms and
architectures - SPAA '10
publication_identifier:
isbn:
- '9781450300797'
publication_status: published
status: public
title: A local O(n2) gathering algorithm
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '16403'
citation:
ama: Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds.
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-14162-1
apa: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis,
P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International
Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1
bibtex: '@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin,
Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium,
ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}, DOI={10.1007/978-3-642-14162-1},
year={2010} }'
chicago: Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf
der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part II. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14162-1.
ieee: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis,
Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg,
2010.
mla: Abramsky, Samson, et al., editors. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1.
short: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis,
eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg,
2010.
date_created: 2020-04-03T12:56:30Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-14162-1
editor:
- first_name: Samson
full_name: Abramsky, Samson
last_name: Abramsky
- first_name: Cyril
full_name: Gavoille, Cyril
last_name: Gavoille
- first_name: Claude
full_name: Kirchner, Claude
last_name: Kirchner
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642141614'
- '9783642141621'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
type: book_editor
user_id: '15415'
year: '2010'
...
---
_id: '16404'
citation:
ama: Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds.
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-14165-2
apa: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis,
P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International
Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2
bibtex: '@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin,
Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium,
ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}, DOI={10.1007/978-3-642-14165-2},
year={2010} }'
chicago: Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf
der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part I. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14165-2.
ieee: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis,
Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg,
2010.
mla: Abramsky, Samson, et al., editors. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.
short: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis,
eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg,
2010.
date_created: 2020-04-03T12:58:05Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-14165-2
editor:
- first_name: Samson
full_name: Abramsky, Samson
last_name: Abramsky
- first_name: Cyril
full_name: Gavoille, Cyril
last_name: Gavoille
- first_name: Claude
full_name: Kirchner, Claude
last_name: Kirchner
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642141614'
- '9783642141621'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
type: book_editor
user_id: '15415'
year: '2010'
...
---
_id: '19605'
author:
- first_name: Katharina
full_name: Lürwer-Brüggemeier, Katharina
last_name: Lürwer-Brüggemeier
citation:
ama: Lürwer-Brüggemeier K. Mächtigkeit Und Komplexität von Berechnungen Mit Der
Ganzzahligen Division. Vol 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2009.
apa: Lürwer-Brüggemeier, K. (2009). Mächtigkeit und Komplexität von Berechnungen
mit der ganzzahligen Division (Vol. 261). Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn.
bibtex: '@book{Lürwer-Brüggemeier_2009, series={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn}, title={Mächtigkeit und Komplexität von Berechnungen
mit der ganzzahligen Division}, volume={261}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Lürwer-Brüggemeier, Katharina},
year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}
}'
chicago: Lürwer-Brüggemeier, Katharina. Mächtigkeit Und Komplexität von Berechnungen
Mit Der Ganzzahligen Division. Vol. 261. Verlagsschriftenreihe Des Heinz Nixdorf
Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2009.
ieee: K. Lürwer-Brüggemeier, Mächtigkeit und Komplexität von Berechnungen mit
der ganzzahligen Division, vol. 261. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2009.
mla: Lürwer-Brüggemeier, Katharina. Mächtigkeit Und Komplexität von Berechnungen
Mit Der Ganzzahligen Division. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2009.
short: K. Lürwer-Brüggemeier, Mächtigkeit Und Komplexität von Berechnungen Mit Der
Ganzzahligen Division, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2009.
date_created: 2020-09-21T14:07:23Z
date_updated: 2022-01-06T06:54:07Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 261'
language:
- iso: eng
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-20090212010
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: Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division
type: dissertation
user_id: '5786'
volume: 261
year: '2009'
...
---
_id: '19614'
author:
- first_name: Mario
full_name: Mense, Mario
last_name: Mense
citation:
ama: Mense M. On Fault-Tolerant Data Placement in Storage Networks. Vol 260.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.
apa: Mense, M. (2009). On Fault-Tolerant Data Placement in Storage Networks
(Vol. 260). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Mense_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={On Fault-Tolerant Data Placement in Storage Networks}, volume={260},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mense,
Mario}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Mense, Mario. On Fault-Tolerant Data Placement in Storage Networks.
Vol. 260. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009.
ieee: M. Mense, On Fault-Tolerant Data Placement in Storage Networks, vol.
260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
mla: Mense, Mario. On Fault-Tolerant Data Placement in Storage Networks.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
short: M. Mense, On Fault-Tolerant Data Placement in Storage Networks, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009.
date_created: 2020-09-22T08:05:15Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 260'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-79-8
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-20090206016
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: On Fault-Tolerant Data Placement in Storage Networks
type: dissertation
user_id: '5786'
volume: 260
year: '2009'
...
---
_id: '19617'
author:
- first_name: Michael
full_name: Kortenjan, Michael
last_name: Kortenjan
citation:
ama: Kortenjan M. Size Equivalent Cluster Trees - Rendering CAD Models in Industrial
Scenes. Vol 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2009.
apa: Kortenjan, M. (2009). Size Equivalent Cluster Trees - Rendering CAD Models
in Industrial Scenes (Vol. 258). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.
bibtex: '@book{Kortenjan_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Size Equivalent Cluster Trees - Rendering CAD Models in Industrial
Scenes}, volume={258}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Kortenjan, Michael}, year={2009}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Kortenjan, Michael. Size Equivalent Cluster Trees - Rendering CAD Models
in Industrial Scenes. Vol. 258. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
ieee: M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial
Scenes, vol. 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2009.
mla: Kortenjan, Michael. Size Equivalent Cluster Trees - Rendering CAD Models
in Industrial Scenes. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2009.
short: M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial
Scenes, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
date_created: 2020-09-22T08:42:22Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 258'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-77-4
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-20081218010
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: Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes
type: dissertation
user_id: '5786'
volume: 258
year: '2009'
...
---
_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'
...
---
_id: '16463'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Barbara
full_name: Schneider, Barbara
last_name: Schneider
citation:
ama: 'Meyer auf der Heide F, Schneider B. Local Strategies for Connecting Stations
by Small Robotic Networks. In: Biologically-Inspired Collaborative Computing.
Boston, MA; 2008. doi:10.1007/978-0-387-09655-1_9'
apa: Meyer auf der Heide, F., & Schneider, B. (2008). Local Strategies for Connecting
Stations by Small Robotic Networks. In Biologically-Inspired Collaborative
Computing. Boston, MA. https://doi.org/10.1007/978-0-387-09655-1_9
bibtex: '@inbook{Meyer auf der Heide_Schneider_2008, place={Boston, MA}, title={Local
Strategies for Connecting Stations by Small Robotic Networks}, DOI={10.1007/978-0-387-09655-1_9},
booktitle={Biologically-Inspired Collaborative Computing}, author={Meyer auf der
Heide, Friedhelm and Schneider, Barbara}, year={2008} }'
chicago: Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies
for Connecting Stations by Small Robotic Networks.” In Biologically-Inspired
Collaborative Computing. Boston, MA, 2008. https://doi.org/10.1007/978-0-387-09655-1_9.
ieee: F. Meyer auf der Heide and B. Schneider, “Local Strategies for Connecting
Stations by Small Robotic Networks,” in Biologically-Inspired Collaborative
Computing, Boston, MA, 2008.
mla: Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies for
Connecting Stations by Small Robotic Networks.” Biologically-Inspired Collaborative
Computing, 2008, doi:10.1007/978-0-387-09655-1_9.
short: 'F. Meyer auf der Heide, B. Schneider, in: Biologically-Inspired Collaborative
Computing, Boston, MA, 2008.'
date_created: 2020-04-08T08:32:22Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-0-387-09655-1_9
language:
- iso: eng
place: Boston, MA
publication: Biologically-Inspired Collaborative Computing
publication_identifier:
isbn:
- '9780387096544'
- '9780387096551'
issn:
- 1571-5736
publication_status: published
status: public
title: Local Strategies for Connecting Stations by Small Robotic Networks
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '16464'
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Gehweiler J, Meyer auf der Heide F. Bin Packing oder „Wie bekomme ich die
Klamotten in die Kisten?“. In: Taschenbuch Der Algorithmen. Berlin, Heidelberg;
2008. doi:10.1007/978-3-540-76394-9_40'
apa: Gehweiler, J., & Meyer auf der Heide, F. (2008). Bin Packing oder „Wie
bekomme ich die Klamotten in die Kisten?“. In Taschenbuch der Algorithmen.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76394-9_40
bibtex: '@inbook{Gehweiler_Meyer auf der Heide_2008, place={Berlin, Heidelberg},
title={Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“}, DOI={10.1007/978-3-540-76394-9_40},
booktitle={Taschenbuch der Algorithmen}, author={Gehweiler, Joachim and Meyer
auf der Heide, Friedhelm}, year={2008} }'
chicago: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder
„Wie Bekomme Ich Die Klamotten in Die Kisten?“.” In Taschenbuch Der Algorithmen.
Berlin, Heidelberg, 2008. https://doi.org/10.1007/978-3-540-76394-9_40.
ieee: J. Gehweiler and F. Meyer auf der Heide, “Bin Packing oder „Wie bekomme ich
die Klamotten in die Kisten?“,” in Taschenbuch der Algorithmen, Berlin,
Heidelberg, 2008.
mla: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder „Wie
Bekomme Ich Die Klamotten in Die Kisten?“.” Taschenbuch Der Algorithmen,
2008, doi:10.1007/978-3-540-76394-9_40.
short: 'J. Gehweiler, F. Meyer auf der Heide, in: Taschenbuch Der Algorithmen, Berlin,
Heidelberg, 2008.'
date_created: 2020-04-08T08:39:36Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-540-76394-9_40
language:
- iso: eng
place: Berlin, Heidelberg
publication: Taschenbuch der Algorithmen
publication_identifier:
isbn:
- '9783540763932'
- '9783540763949'
publication_status: published
status: public
title: Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '16465'
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 karXiv:08100052. 2008.
apa: Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler,
M. (2008). Planar Visibility Counting. ArXiv:0810.0052.
bibtex: '@article{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2008, title={Planar
Visibility Counting}, journal={arXiv:0810.0052}, author={Fischer, Matthias and
Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler,
Martin}, year={2008} }'
chicago: Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf
der Heide, and Martin Ziegler. “Planar Visibility Counting.” ArXiv:0810.0052,
2008.
ieee: M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar
Visibility Counting,” arXiv:0810.0052. 2008.
mla: Fischer, Matthias, et al. “Planar Visibility Counting.” ArXiv:0810.0052,
2008.
short: M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, ArXiv:0810.0052
(2008).
date_created: 2020-04-08T08:41:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '0810.0052'
language:
- iso: eng
publication: arXiv:0810.0052
status: public
title: Planar Visibility Counting
type: preprint
user_id: '15415'
year: '2008'
...
---
_id: '16466'
citation:
ama: Meyer auf der Heide F, Shavit N, eds. Proceedings of the Twentieth Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’08. ACM;
2008. doi:10.1145/1378533
apa: Meyer auf der Heide, F., & Shavit, N. (Eds.). (2008). Proceedings of
the twentieth annual symposium on Parallelism in algorithms and architectures
- SPAA ’08. ACM. https://doi.org/10.1145/1378533
bibtex: '@book{Meyer auf der Heide_Shavit_2008, title={Proceedings of the twentieth
annual symposium on Parallelism in algorithms and architectures - SPAA ’08}, DOI={10.1145/1378533}, publisher={ACM},
year={2008} }'
chicago: Meyer auf der Heide, Friedhelm, and Nir Shavit, eds. Proceedings of
the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’08. ACM, 2008. https://doi.org/10.1145/1378533.
ieee: F. Meyer auf der Heide and N. Shavit, Eds., Proceedings of the twentieth
annual symposium on Parallelism in algorithms and architectures - SPAA ’08.
ACM, 2008.
mla: Meyer auf der Heide, Friedhelm, and Nir Shavit, editors. Proceedings of
the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’08. ACM, 2008, doi:10.1145/1378533.
short: F. Meyer auf der Heide, N. Shavit, eds., Proceedings of the Twentieth Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’08, ACM, 2008.
date_created: 2020-04-08T08:46:08Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1378533
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
language:
- iso: eng
publication_identifier:
isbn:
- 978-1-59593-973-9
publication_status: published
publisher: ACM
status: public
title: Proceedings of the twentieth annual symposium on Parallelism in algorithms
and architectures - SPAA '08
type: conference_editor
user_id: '15415'
year: '2008'
...
---
_id: '19689'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
citation:
ama: 'Briest P, Krysta P. Buying Cheap is Expensive: Hardness of Non-Parametric
Multi-Product Pricing. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete
Algorithms (SODA). ; 2007.'
apa: 'Briest, P., & Krysta, P. (2007). Buying Cheap is Expensive: Hardness of
Non-Parametric Multi-Product Pricing. In Proceedings of the 18th ACM-SIAM Symposium
on Discrete Algorithms (SODA).'
bibtex: '@inproceedings{Briest_Krysta_2007, title={Buying Cheap is Expensive: Hardness
of Non-Parametric Multi-Product Pricing}, booktitle={Proceedings of the 18th ACM-SIAM
Symposium on Discrete Algorithms (SODA)}, author={Briest, Patrick and Krysta,
Piotr}, year={2007} }'
chicago: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Hardness
of Non-Parametric Multi-Product Pricing.” In Proceedings of the 18th ACM-SIAM
Symposium on Discrete Algorithms (SODA), 2007.'
ieee: 'P. Briest and P. Krysta, “Buying Cheap is Expensive: Hardness of Non-Parametric
Multi-Product Pricing,” in Proceedings of the 18th ACM-SIAM Symposium on Discrete
Algorithms (SODA), 2007.'
mla: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Hardness of
Non-Parametric Multi-Product Pricing.” Proceedings of the 18th ACM-SIAM Symposium
on Discrete Algorithms (SODA), 2007.'
short: 'P. Briest, P. Krysta, in: Proceedings of the 18th ACM-SIAM Symposium on
Discrete Algorithms (SODA), 2007.'
date_created: 2020-09-25T10:19:13Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)
status: public
title: 'Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing'
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19725'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
citation:
ama: 'Bonorden O. Load Balancing in the Bulk-Synchronous-Parallel Setting using
Process Migrations. In: 2007 IEEE International Parallel and Distributed Processing
Symposium. ; 2007. doi:10.1109/ipdps.2007.370330'
apa: Bonorden, O. (2007). Load Balancing in the Bulk-Synchronous-Parallel Setting
using Process Migrations. In 2007 IEEE International Parallel and Distributed
Processing Symposium. https://doi.org/10.1109/ipdps.2007.370330
bibtex: '@inproceedings{Bonorden_2007, title={Load Balancing in the Bulk-Synchronous-Parallel
Setting using Process Migrations}, DOI={10.1109/ipdps.2007.370330},
booktitle={2007 IEEE International Parallel and Distributed Processing Symposium},
author={Bonorden, Olaf}, year={2007} }'
chicago: Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting
Using Process Migrations.” In 2007 IEEE International Parallel and Distributed
Processing Symposium, 2007. https://doi.org/10.1109/ipdps.2007.370330.
ieee: O. Bonorden, “Load Balancing in the Bulk-Synchronous-Parallel Setting using
Process Migrations,” in 2007 IEEE International Parallel and Distributed Processing
Symposium, 2007.
mla: Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting Using
Process Migrations.” 2007 IEEE International Parallel and Distributed Processing
Symposium, 2007, doi:10.1109/ipdps.2007.370330.
short: 'O. Bonorden, in: 2007 IEEE International Parallel and Distributed Processing
Symposium, 2007.'
date_created: 2020-09-28T10:34:50Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1109/ipdps.2007.370330
language:
- iso: eng
publication: 2007 IEEE International Parallel and Distributed Processing Symposium
publication_identifier:
isbn:
- '1424409098'
publication_status: published
status: public
title: Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19809'
abstract:
- lang: eng
text: "For the first time, the problem of optimizing energy for communication and
motion is investigated. We consider a single mobile robot with continuous high
bandwidth wireless communication, e.g. caused by a multimedia application like
video surveillance. This robot is connected to a radio base station and moves
with constant speed from a given starting point on the plane to a target point.
The task is to find the best path such that the energy consumption for mobility
and the communication is optimized. This is motivated by the fact that the energy\r\nconsumption
of radio devices increases polynomially (at least to\r\nthe power of two) with
the transmission distance. We introduce efficient approximation algorithms finding
the optimal path given the starting point, the target point and the position of
the radio stations. We exemplify the influence of the communication cost by a
starting scenario with one radio station. We study the performance of the proposed
algorithm in simulation, compare it with the scenario without applying our approach,
and present the results."
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.
In: ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication
and Coordination. ; 2007:309-321. doi:10.1007/s11036-008-0150-5'
apa: 'Ooi, C. C., & Schindelhauer, C. (2007). Minimal Energy Path Planning for
Wireless Robots. In ROBOCOMM’07: Proc. of the 1st International Conference
on Robot Communication and Coordination (pp. 309–321). https://doi.org/10.1007/s11036-008-0150-5'
bibtex: '@inproceedings{Ooi_Schindelhauer_2007, title={Minimal Energy Path Planning
for Wireless Robots}, DOI={10.1007/s11036-008-0150-5},
booktitle={ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication
and Coordination}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2007},
pages={309–321} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
for Wireless Robots.” In ROBOCOMM’07: Proc. of the 1st International Conference
on Robot Communication and Coordination, 309–21, 2007. https://doi.org/10.1007/s11036-008-0150-5.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless
Robots,” in ROBOCOMM’07: Proc. of the 1st International Conference on Robot
Communication and Coordination, 2007, pp. 309–321.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
for Wireless Robots.” ROBOCOMM’07: Proc. of the 1st International Conference
on Robot Communication and Coordination, 2007, pp. 309–21, doi:10.1007/s11036-008-0150-5.'
short: 'C.C. Ooi, C. Schindelhauer, in: ROBOCOMM’07: Proc. of the 1st International
Conference on Robot Communication and Coordination, 2007, pp. 309–321.'
date_created: 2020-09-30T13:15:46Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/s11036-008-0150-5
language:
- iso: eng
page: 309-321
publication: 'ROBOCOMM''07: Proc. of the 1st International Conference on Robot Communication
and Coordination'
publication_identifier:
issn:
- 1383-469X
- 1572-8153
publication_status: published
status: public
title: Minimal Energy Path Planning for Wireless Robots
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19853'
author:
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: 'Schomaker G. DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments. In: Advanced Information Networking and Applications
(AINA-07). Vol 21. ; 2007:331-339. doi:10.1109/aina.2007.59'
apa: 'Schomaker, G. (2007). DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments. In Advanced Information Networking and Applications
(AINA-07) (Vol. 21, pp. 331–339). https://doi.org/10.1109/aina.2007.59'
bibtex: '@inproceedings{Schomaker_2007, title={DHHT-RAID: A Distributed Heterogeneous
Scalable Architecture for Dynamic Storage Environments}, volume={21}, DOI={10.1109/aina.2007.59}, booktitle={Advanced
Information Networking and Applications (AINA-07)}, author={Schomaker, Gunnar},
year={2007}, pages={331–339} }'
chicago: 'Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments.” In Advanced Information Networking and Applications
(AINA-07), 21:331–39, 2007. https://doi.org/10.1109/aina.2007.59.'
ieee: 'G. Schomaker, “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments,” in Advanced Information Networking and Applications
(AINA-07), 2007, vol. 21, pp. 331–339.'
mla: 'Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments.” Advanced Information Networking and Applications
(AINA-07), vol. 21, 2007, pp. 331–39, doi:10.1109/aina.2007.59.'
short: 'G. Schomaker, in: Advanced Information Networking and Applications (AINA-07),
2007, pp. 331–339.'
date_created: 2020-10-02T11:49:58Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1109/aina.2007.59
intvolume: ' 21'
language:
- iso: eng
page: 331-339
publication: Advanced Information Networking and Applications (AINA-07)
publication_identifier:
isbn:
- '0769528465'
issn:
- 1550-445X
publication_status: published
status: public
title: 'DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage
Environments'
type: conference
user_id: '15415'
volume: 21
year: '2007'
...
---
_id: '24276'
abstract:
- lang: eng
text: "We define a natural generalization of the prominent k-server problem, the
k-resource problem. It occurs in metric spaces with some demands and resources
given at its points. The demands may vary with time, but the total demand may
never exceed k. The goal of an online algorithm is to satisfy demands by moving
resources, while minimizing the cost for transporting resources. We give an asymptotically
optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive
deterministic one for the k-resource problem on uniform metric spaces consisting
of n points. This extends known results for paging to the more general setting
of k-resource.\r\nBasing on the results for uniform metric spaces, we develop
a randomized algorithm solving the k-resource and the k-server problem on metric
spaces which can be decomposed into components far away from each other. The algorithm
achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra
resources more than the optimal algorithm.\r\n"
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
citation:
ama: 'Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly
Decomposable Metric Spaces. In: Lecture Notes in Computer Science. ; 2007.
doi:10.1007/978-3-540-73951-7_30'
apa: Bienkowski, M., & Kutyłowski, J. (2007). The k-Resource Problem on Uniform
and on Uniformly Decomposable Metric Spaces. Lecture Notes in Computer Science.
https://doi.org/10.1007/978-3-540-73951-7_30
bibtex: '@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg},
title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric
Spaces}, DOI={10.1007/978-3-540-73951-7_30},
booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and
Kutyłowski, Jarosław}, year={2007} }'
chicago: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on
Uniform and on Uniformly Decomposable Metric Spaces.” In Lecture Notes in Computer
Science. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-73951-7_30.
ieee: 'M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on
Uniformly Decomposable Metric Spaces,” 2007, doi: 10.1007/978-3-540-73951-7_30.'
mla: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform
and on Uniformly Decomposable Metric Spaces.” Lecture Notes in Computer Science,
2007, doi:10.1007/978-3-540-73951-7_30.
short: 'M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin,
Heidelberg, 2007.'
date_created: 2021-09-13T13:07:57Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73951-7_30
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '24366'
abstract:
- lang: eng
text: "Dieses Buch beschäftigt sich mit Algorithmen und Methoden der Peer-to-Peer-Netzwerke
und gibt einen Einblick in die aktuelle Forschung.\r\n\r\nUrsprünglich waren Peer-to-Peer-Netzwerke
nur für File-Sharing konzipiert. Mittlerweile hat sich Peer-to-Peer zum Paradigma
für Rechnernetzwerke entwickelt. Ziel dieses Buches ist es, dem Leser ein grundlegendes
Verständnis der Techniken hinter den aktuellen Peer-to-Peer-Netzwerken aufzuzeigen
und im nächsten Schritt Algorithmen vorzustellen, die vielleicht erst in einigen
Jahren umgesetzt werden.\r\n\r\nDas Buch richtet sich in erster Linie an Informatiker
(Studenten ab dem 5. Semester). Aber auch interessierte Nichtinformatiker können
von diesem Buch profitieren, wobei grundlegende Kenntnisse aus den Bereichen der
Mathematik und Informatik vorausgesetzt werden. Die Ziele, Kernaussagen und Ergebnisse
sollten jedoch auch ohne akademischen Hintergrund klar werden."
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Mahlmann P, Schindelhauer C. Peer-to-Peer-Netzwerke. Springer; 2007.
doi:10.1007/978-3-540-33992-2
apa: Mahlmann, P., & Schindelhauer, C. (2007). Peer-to-Peer-Netzwerke.
Springer. https://doi.org/10.1007/978-3-540-33992-2
bibtex: '@book{Mahlmann_Schindelhauer_2007, place={Berlin}, title={Peer-to-Peer-Netzwerke},
DOI={10.1007/978-3-540-33992-2},
publisher={Springer}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2007}
}'
chicago: 'Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke.
Berlin: Springer, 2007. https://doi.org/10.1007/978-3-540-33992-2.'
ieee: 'P. Mahlmann and C. Schindelhauer, Peer-to-Peer-Netzwerke. Berlin:
Springer, 2007.'
mla: Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke.
Springer, 2007, doi:10.1007/978-3-540-33992-2.
short: P. Mahlmann, C. Schindelhauer, Peer-to-Peer-Netzwerke, Springer, Berlin,
2007.
date_created: 2021-09-14T10:29:29Z
date_updated: 2022-01-06T06:56:18Z
department:
- _id: '63'
doi: 10.1007/978-3-540-33992-2
language:
- iso: eng
place: Berlin
publication_identifier:
isbn:
- '9783540339915'
publication_status: published
publisher: Springer
status: public
title: Peer-to-Peer-Netzwerke
type: book
user_id: '15415'
year: '2007'
...