---
_id: '20195'
author:
- 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
- first_name: Ronald
full_name: Thenius, Ronald
last_name: Thenius
- first_name: Daniela
full_name: Kengyel, Daniela
last_name: Kengyel
citation:
ama: 'Hamann H, Schmickl T, Crailsheim K, Thenius R, Kengyel D. Embodiment of Honeybee’s
Thermotaxis in a Mobile Robot Swarm. In: 10th European Conference on Artificial
Life (ECAL’09). ; 2011. doi:10.1007/978-3-642-21314-4_9'
apa: Hamann, H., Schmickl, T., Crailsheim, K., Thenius, R., & Kengyel, D. (2011).
Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm. In 10th European
Conference on Artificial Life (ECAL’09). https://doi.org/10.1007/978-3-642-21314-4_9
bibtex: '@inproceedings{Hamann_Schmickl_Crailsheim_Thenius_Kengyel_2011, title={Embodiment
of Honeybee’s Thermotaxis in a Mobile Robot Swarm}, DOI={10.1007/978-3-642-21314-4_9},
booktitle={10th European Conference on Artificial Life (ECAL’09)}, author={Hamann,
Heiko and Schmickl, Thomas and Crailsheim, Karl and Thenius, Ronald and Kengyel,
Daniela}, year={2011} }'
chicago: Hamann, Heiko, Thomas Schmickl, Karl Crailsheim, Ronald Thenius, and Daniela
Kengyel. “Embodiment of Honeybee’s Thermotaxis in a Mobile Robot Swarm.” In 10th
European Conference on Artificial Life (ECAL’09), 2011. https://doi.org/10.1007/978-3-642-21314-4_9.
ieee: H. Hamann, T. Schmickl, K. Crailsheim, R. Thenius, and D. Kengyel, “Embodiment
of Honeybee’s Thermotaxis in a Mobile Robot Swarm,” in 10th European Conference
on Artificial Life (ECAL’09), 2011.
mla: Hamann, Heiko, et al. “Embodiment of Honeybee’s Thermotaxis in a Mobile Robot
Swarm.” 10th European Conference on Artificial Life (ECAL’09), 2011, doi:10.1007/978-3-642-21314-4_9.
short: 'H. Hamann, T. Schmickl, K. Crailsheim, R. Thenius, D. Kengyel, in: 10th
European Conference on Artificial Life (ECAL’09), 2011.'
date_created: 2020-10-26T11:17:17Z
date_updated: 2022-01-06T06:54:22Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-21314-4_9
language:
- iso: eng
publication: 10th European Conference on Artificial Life (ECAL'09)
status: public
title: Embodiment of Honeybee's Thermotaxis in a Mobile Robot Swarm
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '20196'
author:
- 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: 'Hamann H, Schmickl T, Crailsheim K. Explaining Emergent Behavior in a Swarm
System Based on an Inversion of the Fluctuation Theorem. In: Lenaerts T, Giacobini
M, Bersini H, Bourgine P, Dorigo M, Doursat R, eds. Advances in Artificial
Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis
and Simulation of Living Systems. MIT Press; 2011:302--309.'
apa: 'Hamann, H., Schmickl, T., & Crailsheim, K. (2011). Explaining Emergent
Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem. In
T. Lenaerts, M. Giacobini, H. Bersini, P. Bourgine, M. Dorigo, & R. Doursat
(Eds.), Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European
Conference on the Synthesis and Simulation of Living Systems (pp. 302--309).
MIT Press.'
bibtex: '@inbook{Hamann_Schmickl_Crailsheim_2011, title={Explaining Emergent Behavior
in a Swarm System Based on an Inversion of the Fluctuation Theorem}, booktitle={Advances
in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on
the Synthesis and Simulation of Living Systems}, publisher={MIT Press}, author={Hamann,
Heiko and Schmickl, Thomas and Crailsheim, Karl}, editor={Lenaerts, Tom and Giacobini,
Mario and Bersini, Hugues and Bourgine, Paul and Dorigo, Marco and Doursat, ReneEditors},
year={2011}, pages={302--309} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Explaining Emergent
Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem.”
In Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European
Conference on the Synthesis and Simulation of Living Systems, edited by Tom
Lenaerts, Mario Giacobini, Hugues Bersini, Paul Bourgine, Marco Dorigo, and Rene
Doursat, 302--309. MIT Press, 2011.'
ieee: 'H. Hamann, T. Schmickl, and K. Crailsheim, “Explaining Emergent Behavior
in a Swarm System Based on an Inversion of the Fluctuation Theorem,” in Advances
in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on
the Synthesis and Simulation of Living Systems, T. Lenaerts, M. Giacobini,
H. Bersini, P. Bourgine, M. Dorigo, and R. Doursat, Eds. MIT Press, 2011, pp.
302--309.'
mla: 'Hamann, Heiko, et al. “Explaining Emergent Behavior in a Swarm System Based
on an Inversion of the Fluctuation Theorem.” Advances in Artificial Life, ECAL
2011: Proceedings of the 11th European Conference on the Synthesis and Simulation
of Living Systems, edited by Tom Lenaerts et al., MIT Press, 2011, pp. 302--309.'
short: 'H. Hamann, T. Schmickl, K. Crailsheim, in: T. Lenaerts, M. Giacobini, H.
Bersini, P. Bourgine, M. Dorigo, R. Doursat (Eds.), Advances in Artificial Life,
ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation
of Living Systems, MIT Press, 2011, pp. 302--309.'
date_created: 2020-10-26T11:42:55Z
date_updated: 2022-01-06T06:54:22Z
department:
- _id: '63'
- _id: '238'
editor:
- first_name: Tom
full_name: Lenaerts, Tom
last_name: Lenaerts
- first_name: Mario
full_name: Giacobini, Mario
last_name: Giacobini
- first_name: Hugues
full_name: Bersini, Hugues
last_name: Bersini
- first_name: Paul
full_name: Bourgine, Paul
last_name: Bourgine
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Rene
full_name: Doursat, Rene
last_name: Doursat
language:
- iso: eng
page: 302--309
publication: 'Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European
Conference on the Synthesis and Simulation of Living Systems'
publisher: MIT Press
status: public
title: Explaining Emergent Behavior in a Swarm System Based on an Inversion of the
Fluctuation Theorem
type: book_chapter
user_id: '15415'
year: '2011'
...
---
_id: '20214'
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: Lutz
full_name: Winkler, Lutz
last_name: Winkler
citation:
ama: 'Hamann H, Schmickl T, Stradner J, Crailsheim K, Winkler L. Major Feedback
Loops Supporting Artificial Evolution in Multi-modular Robotics. In: New Horizons
in Evolutionary Robotics. Berlin, Heidelberg: Springer; 2011. doi:10.1007/978-3-642-18272-3_13'
apa: 'Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., & Winkler, L.
(2011). Major Feedback Loops Supporting Artificial Evolution in Multi-modular
Robotics. In New Horizons in Evolutionary Robotics. Berlin, Heidelberg:
Springer. https://doi.org/10.1007/978-3-642-18272-3_13'
bibtex: '@inbook{Hamann_Schmickl_Stradner_Crailsheim_Winkler_2011, place={Berlin,
Heidelberg}, title={Major Feedback Loops Supporting Artificial Evolution in Multi-modular
Robotics}, DOI={10.1007/978-3-642-18272-3_13},
booktitle={New Horizons in Evolutionary Robotics}, publisher={Springer}, author={Hamann,
Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Winkler,
Lutz}, year={2011} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, and
Lutz Winkler. “Major Feedback Loops Supporting Artificial Evolution in Multi-Modular
Robotics.” In New Horizons in Evolutionary Robotics. Berlin, Heidelberg:
Springer, 2011. https://doi.org/10.1007/978-3-642-18272-3_13.'
ieee: 'H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, and L. Winkler, “Major
Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics,” in
New Horizons in Evolutionary Robotics, Berlin, Heidelberg: Springer, 2011.'
mla: Hamann, Heiko, et al. “Major Feedback Loops Supporting Artificial Evolution
in Multi-Modular Robotics.” New Horizons in Evolutionary Robotics, Springer,
2011, doi:10.1007/978-3-642-18272-3_13.
short: 'H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, L. Winkler, in: New
Horizons in Evolutionary Robotics, Springer, Berlin, Heidelberg, 2011.'
date_created: 2020-10-27T14:58:41Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-18272-3_13
language:
- iso: eng
place: Berlin, Heidelberg
publication: New Horizons in Evolutionary Robotics
publisher: Springer
status: public
title: Major Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics
type: book_chapter
user_id: '15415'
year: '2011'
...
---
_id: '20215'
author:
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: Schmickl T, Hamann H, Crailsheim K. Modelling a hormone-inspired controller
for individual- and multi-modular robotic systems. Mathematical and Computer
Modelling of Dynamical Systems. 2011;17(3):221-242. doi:10.1080/13873954.2011.557862
apa: Schmickl, T., Hamann, H., & Crailsheim, K. (2011). Modelling a hormone-inspired
controller for individual- and multi-modular robotic systems. Mathematical
and Computer Modelling of Dynamical Systems, 17(3), 221–242. https://doi.org/10.1080/13873954.2011.557862
bibtex: '@article{Schmickl_Hamann_Crailsheim_2011, title={Modelling a hormone-inspired
controller for individual- and multi-modular robotic systems}, volume={17}, DOI={10.1080/13873954.2011.557862},
number={3}, journal={Mathematical and Computer Modelling of Dynamical Systems},
author={Schmickl, Thomas and Hamann, Heiko and Crailsheim, Karl}, year={2011},
pages={221–242} }'
chicago: 'Schmickl, Thomas, Heiko Hamann, and Karl Crailsheim. “Modelling a Hormone-Inspired
Controller for Individual- and Multi-Modular Robotic Systems.” Mathematical
and Computer Modelling of Dynamical Systems 17, no. 3 (2011): 221–42. https://doi.org/10.1080/13873954.2011.557862.'
ieee: T. Schmickl, H. Hamann, and K. Crailsheim, “Modelling a hormone-inspired controller
for individual- and multi-modular robotic systems,” Mathematical and Computer
Modelling of Dynamical Systems, vol. 17, no. 3, pp. 221–242, 2011.
mla: Schmickl, Thomas, et al. “Modelling a Hormone-Inspired Controller for Individual-
and Multi-Modular Robotic Systems.” Mathematical and Computer Modelling of
Dynamical Systems, vol. 17, no. 3, 2011, pp. 221–42, doi:10.1080/13873954.2011.557862.
short: T. Schmickl, H. Hamann, K. Crailsheim, Mathematical and Computer Modelling
of Dynamical Systems 17 (2011) 221–242.
date_created: 2020-10-27T15:04:15Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '63'
- _id: '238'
doi: 10.1080/13873954.2011.557862
intvolume: ' 17'
issue: '3'
language:
- iso: eng
page: 221-242
publication: Mathematical and Computer Modelling of Dynamical Systems
publication_identifier:
issn:
- 1387-3954
- 1744-5051
publication_status: published
status: public
title: Modelling a hormone-inspired controller for individual- and multi-modular robotic
systems
type: journal_article
user_id: '15415'
volume: 17
year: '2011'
...
---
_id: '17420'
abstract:
- lang: eng
text: "Occlusion culling is a common approach to accelerate real-time rendering
of polygonal 3D-scenes by reducing the rendering load. Especially for large scenes,
it is necessary to remove occluded objects to achieve a frame rate that provides
an interactive environment. In order to benefit from the culling properly, often
hierarchical data structures are used. These data structures typically create
a spatial subdivision of a given scene into axis-aligned bounding boxes. These
boxes can be tested quickly, but they are not very precise. By using these boxes,
the included objects are detected as visible, even if other objects occlude them
(false-positives). To get perfect results, the models\x92 original geometry included
in the box has to be tested, but this would require too much computational power.
To overcome this problem, original objects\x92 approximations could be used, but
typical methods for mesh simplification cannot be applied, because they do not
create an outer hull for a given object. We present a model simplification algorithm,
which generates simple outer hulls, consisting of only few more triangles than
a box, while preserving an object\x92s shape better than a corresponding bounding
box. This approach is then extended to a hierarchical data structure, the so-called
hull tree, that can be generated for a given scene to improve the visibility tests.
Next, we present an approximative rendering algorithm, which combines the features
of the hull tree with the use of inner hulls for efficient occlusion detection
and global state-sorting of the visible objects.\r\n"
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Clemens
full_name: Koch, Clemens
last_name: Koch
- 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: 'Suess T, Koch C, Jähn C, Fischer M. Approximative occlusion culling using
the hull tree. In: Brooks S, Irani P, eds. Proceedings of the Graphics Interface
2011 Conference, May 25-27, St. John’s, Newfoundland, Canada. Canadian Human-Computer
Communications Society; 2011:79--86.'
apa: Suess, T., Koch, C., Jähn, C., & Fischer, M. (2011). Approximative occlusion
culling using the hull tree. In S. Brooks & P. Irani (Eds.), Proceedings
of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland,
Canada (pp. 79--86). Canadian Human-Computer Communications Society.
bibtex: '@inproceedings{Suess_Koch_Jähn_Fischer_2011, title={Approximative occlusion
culling using the hull tree}, booktitle={Proceedings of the Graphics Interface
2011 Conference, May 25-27, St. John’s, Newfoundland, Canada}, publisher={Canadian
Human-Computer Communications Society}, author={Suess, Tim and Koch, Clemens and
Jähn, Claudius and Fischer, Matthias}, editor={Brooks, Stephen and Irani, Pourang},
year={2011}, pages={79--86} }'
chicago: Suess, Tim, Clemens Koch, Claudius Jähn, and Matthias Fischer. “Approximative
Occlusion Culling Using the Hull Tree.” In Proceedings of the Graphics Interface
2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, edited by Stephen
Brooks and Pourang Irani, 79--86. Canadian Human-Computer Communications Society,
2011.
ieee: T. Suess, C. Koch, C. Jähn, and M. Fischer, “Approximative occlusion culling
using the hull tree,” in Proceedings of the Graphics Interface 2011 Conference,
May 25-27, St. John’s, Newfoundland, Canada, 2011, pp. 79--86.
mla: Suess, Tim, et al. “Approximative Occlusion Culling Using the Hull Tree.” Proceedings
of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland,
Canada, edited by Stephen Brooks and Pourang Irani, Canadian Human-Computer
Communications Society, 2011, pp. 79--86.
short: 'T. Suess, C. Koch, C. Jähn, M. Fischer, in: S. Brooks, P. Irani (Eds.),
Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s,
Newfoundland, Canada, Canadian Human-Computer Communications Society, 2011, pp.
79--86.'
date_created: 2020-07-27T19:17:03Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
editor:
- first_name: Stephen
full_name: Brooks, Stephen
last_name: Brooks
- first_name: Pourang
full_name: Irani, Pourang
last_name: Irani
language:
- iso: eng
page: 79--86
publication: Proceedings of the Graphics Interface 2011 Conference, May 25-27, St.
John's, Newfoundland, Canada
publisher: Canadian Human-Computer Communications Society
status: public
title: Approximative occlusion culling using the hull tree
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '17421'
author:
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Klaas A, Laroque C, Dangelmaier W, Fischer M. Simulation aided, knowledge
based routing for AGVs in a distribution warehouse. In: Proceedings of the
2011 Winter Simulation Conference (WSC). ; 2011. doi:10.1109/wsc.2011.6147883'
apa: Klaas, A., Laroque, C., Dangelmaier, W., & Fischer, M. (2011). Simulation
aided, knowledge based routing for AGVs in a distribution warehouse. In Proceedings
of the 2011 Winter Simulation Conference (WSC). https://doi.org/10.1109/wsc.2011.6147883
bibtex: '@inproceedings{Klaas_Laroque_Dangelmaier_Fischer_2011, title={Simulation
aided, knowledge based routing for AGVs in a distribution warehouse}, DOI={10.1109/wsc.2011.6147883},
booktitle={Proceedings of the 2011 Winter Simulation Conference (WSC)}, author={Klaas,
Alexander and Laroque, Christoph and Dangelmaier, Wilhelm and Fischer, Matthias},
year={2011} }'
chicago: Klaas, Alexander, Christoph Laroque, Wilhelm Dangelmaier, and Matthias
Fischer. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution
Warehouse.” In Proceedings of the 2011 Winter Simulation Conference (WSC),
2011. https://doi.org/10.1109/wsc.2011.6147883.
ieee: A. Klaas, C. Laroque, W. Dangelmaier, and M. Fischer, “Simulation aided, knowledge
based routing for AGVs in a distribution warehouse,” in Proceedings of the
2011 Winter Simulation Conference (WSC), 2011.
mla: Klaas, Alexander, et al. “Simulation Aided, Knowledge Based Routing for AGVs
in a Distribution Warehouse.” Proceedings of the 2011 Winter Simulation Conference
(WSC), 2011, doi:10.1109/wsc.2011.6147883.
short: 'A. Klaas, C. Laroque, W. Dangelmaier, M. Fischer, in: Proceedings of the
2011 Winter Simulation Conference (WSC), 2011.'
date_created: 2020-07-27T19:21:18Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
doi: 10.1109/wsc.2011.6147883
language:
- iso: eng
publication: Proceedings of the 2011 Winter Simulation Conference (WSC)
publication_identifier:
isbn:
- '9781457721090'
- '9781457721083'
- '9781457721069'
- '9781457721076'
publication_status: published
status: public
title: Simulation aided, knowledge based routing for AGVs in a distribution warehouse
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '17450'
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Clemens
full_name: Koch, Clemens
last_name: Koch
citation:
ama: 'Suess T, Jähn C, Fischer M, Meyer auf der Heide F, Koch C. Ein paralleles
Out-of-Core Renderingsystem für Standard-Rechnernetze. In: Augmented &
Virtual Reality in Der Produktentstehung. Vol 295. Verlagsschriftenreihe des
Heinz Nixdorf Instituts; 2011:185--197.'
apa: Suess, T., Jähn, C., Fischer, M., Meyer auf der Heide, F., & Koch, C. (2011).
Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. Augmented
& Virtual Reality in Der Produktentstehung, 295, 185--197.
bibtex: '@inproceedings{Suess_Jähn_Fischer_Meyer auf der Heide_Koch_2011, place={Paderborn},
title={Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze},
volume={295}, booktitle={Augmented & Virtual Reality in der Produktentstehung},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Suess,
Tim and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm
and Koch, Clemens}, year={2011}, pages={185--197} }'
chicago: 'Suess, Tim, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide,
and Clemens Koch. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.”
In Augmented & Virtual Reality in Der Produktentstehung, 295:185--197.
Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2011.'
ieee: T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, and C. Koch, “Ein paralleles
Out-of-Core Renderingsystem für Standard-Rechnernetze,” in Augmented &
Virtual Reality in der Produktentstehung, 2011, vol. 295, pp. 185--197.
mla: Suess, Tim, et al. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.”
Augmented & Virtual Reality in Der Produktentstehung, vol. 295, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2011, pp. 185--197.
short: 'T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, C. Koch, in: Augmented
& Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 2011, pp. 185--197.'
date_created: 2020-07-29T12:19:22Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 295'
language:
- iso: eng
page: 185--197
place: Paderborn
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze
type: conference
user_id: '15415'
volume: 295
year: '2011'
...
---
_id: '17454'
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: Suess T. Parallel Real-Time Rendering Using Heterogeneous PC Clusters.;
2011.
apa: Suess, T. (2011). Parallel Real-Time Rendering using Heterogeneous PC Clusters.
bibtex: '@book{Suess_2011, place={Universität Paderborn}, title={Parallel Real-Time
Rendering using Heterogeneous PC Clusters}, author={Suess, Tim}, year={2011} }'
chicago: Suess, Tim. Parallel Real-Time Rendering Using Heterogeneous PC Clusters.
Universität Paderborn, 2011.
ieee: T. Suess, Parallel Real-Time Rendering using Heterogeneous PC Clusters.
Universität Paderborn, 2011.
mla: Suess, Tim. Parallel Real-Time Rendering Using Heterogeneous PC Clusters.
2011.
short: T. Suess, Parallel Real-Time Rendering Using Heterogeneous PC Clusters, Universität
Paderborn, 2011.
date_created: 2020-07-29T13:57:09Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-8222
status: public
title: Parallel Real-Time Rendering using Heterogeneous PC Clusters
type: dissertation
user_id: '15415'
year: '2011'
...
---
_id: '18973'
author:
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
citation:
ama: Frahling G. Algorithms for Dynamic Geometric Data Streams. Vol 290.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.
apa: Frahling, G. (2011). Algorithms for Dynamic Geometric Data Streams (Vol.
290). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Frahling_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Algorithms for Dynamic Geometric Data Streams}, volume={290},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Frahling,
Gereon}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Frahling, Gereon. Algorithms for Dynamic Geometric Data Streams.
Vol. 290. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
ieee: G. Frahling, Algorithms for Dynamic Geometric Data Streams, vol. 290.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
mla: Frahling, Gereon. Algorithms for Dynamic Geometric Data Streams. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
short: G. Frahling, Algorithms for Dynamic Geometric Data Streams, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
date_created: 2020-09-04T06:52:56Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 290'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-09-0
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-20070301123
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Algorithms for Dynamic Geometric Data Streams
type: dissertation
user_id: '5786'
volume: 290
year: '2011'
...
---
_id: '18974'
author:
- first_name: Jan
full_name: Mehler, Jan
last_name: Mehler
citation:
ama: Mehler J. Power-Aware Online File Allocation in Dynamic Networks. Vol
287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.
apa: Mehler, J. (2011). Power-Aware Online File Allocation in Dynamic Networks
(Vol. 287). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Mehler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Power-Aware Online File Allocation in Dynamic Networks}, volume={287},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mehler,
Jan}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks.
Vol. 287. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
ieee: J. Mehler, Power-Aware Online File Allocation in Dynamic Networks,
vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
mla: Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
short: J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
date_created: 2020-09-04T06:58:58Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 287'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-06-9
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-20101020011
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: Power-Aware Online File Allocation in Dynamic Networks
type: dissertation
user_id: '5786'
volume: 287
year: '2011'
...
---
_id: '18976'
abstract:
- lang: eng
text: "Web computing is a variant of parallel computing where the idle times of
PCs\r\ndonated by worldwide distributed users are employed to execute parallel\r\nprograms.
In this thesis we consider a web computing variant with two\r\nimportant properties:
First, we support the execution of coupled, massively\r\nparallel algorithms (rather
than distributed data processing). And second,\r\nwe organize the system in peer-to-peer
fashion.\r\n\r\nWe present the Paderborn University BSP-based Web Computing (PUB-Web)
library,\r\nwhich supports the execution of parallel programs in the bulk-synchronous
style\r\n(BSP) in such a web computing setting. In this thesis, we focus on important\r\ntechnical
and algorithmic aspects, in particular: In order to schedule\r\nprocesses with
respect to the currently available computing power, which\r\ncontinually changes
in an unpredictable fashion, we need intelligent load\r\nbalancing algorithms
and -- as a basic precondition -- the technical ability\r\nto migrate threads
at runtime.\r\n\r\nTo achieve the latter in a way suitable for production use,
compatible with\r\nrecent Java versions, available for all important platforms,
and easy-to-use\r\nfor developers, we develop the PadMig thread migration and
checkpointing\r\nlibrary.\r\n\r\nIn order to tackle the distributed load balancing
problem, we present an\r\nalgorithm based on Distributed Heterogeneous Hash-Tables.
In order to judge\r\nthe quality of the schedules produced, we perform extensive
experiments to\r\ncompare several variants of the DHHT-based load balancer with
the well-\r\nestablished Work Stealing algorithm, using realistic input data obtained
by\r\nprofiling the utilization of several hundred PCs for a period of several\r\nmonths.\r\n\r\nBeside
the available computing power, we finally also consider the network\r\nbandwidth
as a secondary criterion for load balancing. For this purpose, we\r\ncluster the
PUB-Web network according to bandwidth, employing a novel,\r\nfault-tolerant,
adaptive, and scaling distributed clustering algorithm called\r\nDiDiC. In order
to judge the quality of the clusterings produces by DiDiC,\r\nwe experimentally
compare it to the well-established MCL algorithm using a\r\nsimulator."
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
citation:
ama: Gehweiler J. Peer-to-Peer Based Parallel Web Computing. Vol 298. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2011.
apa: Gehweiler, J. (2011). Peer-to-Peer Based Parallel Web Computing (Vol.
298). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Gehweiler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Peer-to-Peer Based Parallel Web Computing}, volume={298}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Gehweiler, Joachim}, year={2011},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Vol.
298. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
ieee: J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, vol. 298.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
mla: Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
short: J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
date_created: 2020-09-04T07:46:32Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 298'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-17-5
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:2-186
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Peer-to-Peer Based Parallel Web Computing
type: dissertation
user_id: '5786'
volume: 298
year: '2011'
...
---
_id: '19026'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
citation:
ama: 'Briest P, Raupach C. The car sharing problem. In: Proceedings of the 23rd
ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ;
2011. doi:10.1145/1989493.1989518'
apa: Briest, P., & Raupach, C. (2011). The car sharing problem. In Proceedings
of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA
’11. https://doi.org/10.1145/1989493.1989518
bibtex: '@inproceedings{Briest_Raupach_2011, title={The car sharing problem}, DOI={10.1145/1989493.1989518}, booktitle={Proceedings
of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA
’11}, author={Briest, Patrick and Raupach, Christoph}, year={2011} }'
chicago: Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” In Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
’11, 2011. https://doi.org/10.1145/1989493.1989518.
ieee: P. Briest and C. Raupach, “The car sharing problem,” in Proceedings of
the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11,
2011.
mla: Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
’11, 2011, doi:10.1145/1989493.1989518.
short: 'P. Briest, C. Raupach, in: Proceedings of the 23rd ACM Symposium on Parallelism
in Algorithms and Architectures - SPAA ’11, 2011.'
date_created: 2020-09-04T11:58:54Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1145/1989493.1989518
language:
- iso: eng
publication: Proceedings of the 23rd ACM symposium on Parallelism in algorithms and
architectures - SPAA '11
publication_identifier:
isbn:
- '9781450307437'
publication_status: published
status: public
title: The car sharing problem
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '19040'
author:
- first_name: Sascha
full_name: Effert, Sascha
last_name: Effert
citation:
ama: Effert S. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen.
Universität Paderborn; 2011.
apa: Effert, S. (2011). Verfahren zur redundanten Datenplatzierung in skalierbaren
Speichersystemen. Universität Paderborn.
bibtex: '@book{Effert_2011, place={Universität Paderborn}, title={Verfahren zur
redundanten Datenplatzierung in skalierbaren Speichersystemen}, author={Effert,
Sascha}, year={2011} }'
chicago: Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren
Speichersystemen. Universität Paderborn, 2011.
ieee: S. Effert, Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen.
Universität Paderborn, 2011.
mla: Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren
Speichersystemen. 2011.
short: S. Effert, Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen,
Universität Paderborn, 2011.
date_created: 2020-09-04T13:31:29Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-385
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen
type: dissertation
user_id: '15415'
year: '2011'
...
---
_id: '23739'
abstract:
- lang: eng
text: "This paper deals with the design of efficiently computable incentive-compatible
mechanisms for combinatorial optimization problems with single-minded agents each
possibly having multiple private parameters. We focus on approximation algorithms
for NP-hard mechanism design problems. These algorithms need to satisfy certain
monotonicity properties to ensure truthfulness. Since most of the known approximation
techniques do not fulfill these properties, we study alternative techniques. Our
first contribution is a quite general method to transform a pseudopolynomial algorithm
into a monotone fully polynomial time approximation scheme (FPTAS). This can be
applied to various problems like, e.g., knapsack, constrained shortest path, or
job scheduling with deadlines. For example, the monotone FPTAS for the knapsack
problem gives a very efficient, truthful mechanism for single-minded multiunit
auctions. The best previous result for such auctions was a 2-appro-xi-ma-tion.
In addition, we present a monotone PTAS for the generalized assignment problem
with any constant number of private parameters per agent. The most efficient way
to solve packing integer programs (PIPs) is linear programming–based randomized
rounding, which also is in general not monotone. We show that primal-dual greedy
algorithms achieve almost the same approximation ratios for PIPs as randomized
rounding. The advantage is that these algorithms are inherently monotone. This
way, we can significantly improve the approximation ratios of truthful mechanisms
for various fundamental mechanism design problems like single-minded combinatorial
auctions (CAs), unsplittable flow routing, and multicast routing. Our primal-dual
approximation algorithms can also be used for the winner determination in CAs
with general bidders specifying their bids through an oracle.\r\n"
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Briest P, Krysta P, Vöcking B. Approximation Techniques for Utilitarian Mechanism
Design. SIAM Journal on Computing. 2011:1587-1622. doi:10.1137/090772988
apa: Briest, P., Krysta, P., & Vöcking, B. (2011). Approximation Techniques
for Utilitarian Mechanism Design. SIAM Journal on Computing, 1587–1622.
https://doi.org/10.1137/090772988
bibtex: '@article{Briest_Krysta_Vöcking_2011, title={Approximation Techniques for
Utilitarian Mechanism Design}, DOI={10.1137/090772988},
journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr
and Vöcking, Berthold}, year={2011}, pages={1587–1622} }'
chicago: Briest, Patrick, Piotr Krysta, and Berthold Vöcking. “Approximation Techniques
for Utilitarian Mechanism Design.” SIAM Journal on Computing, 2011, 1587–1622.
https://doi.org/10.1137/090772988.
ieee: P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian
Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011.
mla: Briest, Patrick, et al. “Approximation Techniques for Utilitarian Mechanism
Design.” SIAM Journal on Computing, 2011, pp. 1587–622, doi:10.1137/090772988.
short: P. Briest, P. Krysta, B. Vöcking, SIAM Journal on Computing (2011) 1587–1622.
date_created: 2021-09-03T10:41:04Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
doi: 10.1137/090772988
language:
- iso: eng
page: 1587-1622
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: Approximation Techniques for Utilitarian Mechanism Design
type: journal_article
user_id: '15415'
year: '2011'
...
---
_id: '23740'
abstract:
- lang: eng
text: "We investigate nonparametric multiproduct pricing problems, in which we want
to find revenue maximizing prices for products $\\mathcal{P}$ based on a set of
customer samples $\\mathcal{C}$. We mostly focus on the unit-demand case, in which
products constitute strict substitutes and each customer aims to purchase a single
product. In this setting a customer sample consists of a number of nonzero values
for different products and possibly an additional product ranking. Once prices
are fixed, each customer chooses to buy one of the products she can afford based
on some predefined selection rule. We distinguish between the min-buying, max-buying,
and rank-buying models. Some of our results also extend to single-minded pricing,
in which case products are strict complements and every customer seeks to buy
a single set of products, which she purchases if the sum of prices is below her
valuation for that set. For the min-buying model we show that the revenue maximization
problem is not approximable within factor $\\mathcal{O}(\\log^{\\varepsilon}|\\mathcal{C}|)$
for some constant $\\varepsilon>0$, unless $\\mathrm{NP}\\subseteq\\mathrm{DTIME}(n^{\\mathcal{O}(\\log\\log
n)})$, thereby almost closing the gap between the known algorithmic results and
previous lower bounds. We also prove inapproximability within $\\mathcal{O}(\\ell^{\\varepsilon})$,
$\\ell$ being an upper bound on the number of nonzero values per customer, and
$\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ under slightly stronger assumptions
and provide matching upper bounds. Surprisingly, these hardness results hold even
if a price ladder constraint, i.e., a predefined order on the prices of all products,
is given. Without the price ladder constraint we obtain similar hardness results
for the special case of uniform valuations, i.e., the case that every customer
has identical values for all the products she is interested in, assuming specific
hardness of the balanced bipartite independent set problem in constant degree
graphs or hardness of refuting random 3CNF formulas. Introducing a slightly more
general problem definition in which customers are given as an explicit probability
distribution, we obtain inapproximability within $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$
assuming $\\mathrm{NP}\\nsubseteq\\bigcap_{\\delta>0}\\mathrm{BPTIME}(2^{\\mathcal{O}(n^{\\delta})})$.
These results apply to single-minded pricing as well. For the max-buying model
a polynomial-time approximation scheme exists if a price ladder is given. We give
a matching lower bound by proving strong NP-hardness. Assuming limited product
supply, we analyze a generic local search algorithm and prove that it is 2-approximate.
Finally, we discuss implications for the rank-buying model.\r\n"
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: Approximability of Combinatorial
Pricing Problems. SIAM Journal on Computing. 2011:1554-1586. doi:10.1137/090752353'
apa: 'Briest, P., & Krysta, P. (2011). Buying Cheap Is Expensive: Approximability
of Combinatorial Pricing Problems. SIAM Journal on Computing, 1554–1586.
https://doi.org/10.1137/090752353'
bibtex: '@article{Briest_Krysta_2011, title={Buying Cheap Is Expensive: Approximability
of Combinatorial Pricing Problems}, DOI={10.1137/090752353},
journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr},
year={2011}, pages={1554–1586} }'
chicago: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability
of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, 1554–86.
https://doi.org/10.1137/090752353.'
ieee: 'P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial
Pricing Problems,” SIAM Journal on Computing, pp. 1554–1586, 2011.'
mla: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability
of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, pp.
1554–86, doi:10.1137/090752353.'
short: P. Briest, P. Krysta, SIAM Journal on Computing (2011) 1554–1586.
date_created: 2021-09-03T10:48:52Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
doi: 10.1137/090752353
language:
- iso: eng
page: 1554-1586
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: 'Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems'
type: journal_article
user_id: '15415'
year: '2011'
...
---
_id: '20709'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm Meyer
full_name: auf der Heide, Friedhelm Meyer
last_name: auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots
with an Extent. In: SOFSEM 2011: Theory and Practice of Computer Science.
Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-18381-2_15'
apa: 'Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In
SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-18381-2_15'
bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_auf
der Heide_et al._2011, place={Berlin, Heidelberg}, title={Collisionless Gathering
of Robots with an Extent}, DOI={10.1007/978-3-642-18381-2_15},
booktitle={SOFSEM 2011: Theory and Practice of Computer Science}, author={Cord-Landwehr,
Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and auf der Heide, Friedhelm Meyer and et al.}, year={2011} }'
chicago: 'Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering
of Robots with an Extent.” In SOFSEM 2011: Theory and Practice of Computer
Science. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-18381-2_15.'
ieee: 'A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an
Extent,” in SOFSEM 2011: Theory and Practice of Computer Science, Berlin,
Heidelberg, 2011.'
mla: 'Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an
Extent.” SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.'
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F.M. auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: SOFSEM 2011: Theory and Practice of Computer
Science, Berlin, Heidelberg, 2011.'
date_created: 2020-12-12T11:15:30Z
date_updated: 2022-01-06T06:54:33Z
department:
- _id: '63'
doi: 10.1007/978-3-642-18381-2_15
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'SOFSEM 2011: Theory and Practice of Computer Science'
publication_identifier:
isbn:
- '9783642183805'
- '9783642183812'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Collisionless Gathering of Robots with an Extent
type: book_chapter
user_id: '3902'
year: '2011'
...
---
_id: '20710'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing
Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming.
Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52'
apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms
for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-22012-8_52
bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for
Analyzing Convergence Algorithms for Mobile Robots}, DOI={10.1007/978-3-642-22012-8_52},
booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas
and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }'
chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing
Convergence Algorithms for Mobile Robots.” In Automata, Languages and Programming.
Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52.
ieee: A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence
Algorithms for Mobile Robots,” in Automata, Languages and Programming,
Berlin, Heidelberg, 2011.
mla: Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms
for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming,
Berlin, Heidelberg, 2011.'
date_created: 2020-12-12T12:22:41Z
date_updated: 2022-01-06T06:54:33Z
department:
- _id: '63'
doi: 10.1007/978-3-642-22012-8_52
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '9783642220111'
- '9783642220128'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A New Approach for Analyzing Convergence Algorithms for Mobile Robots
type: book_chapter
user_id: '3902'
year: '2011'
...
---
_id: '18193'
author:
- first_name: Hendrik
full_name: Renken, Hendrik
last_name: Renken
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Renken H, Laroque C, Fischer M. An Easy Extendable Modeling Framework for
Discrete Event Simulation Models and their Visualization. In: Proceedings of
The 25th European Simulation and Modelling Conference - ESM2011. ; 2011.'
apa: Renken, H., Laroque, C., & Fischer, M. (2011). An Easy Extendable Modeling
Framework for Discrete Event Simulation Models and their Visualization. In Proceedings
of The 25th European Simulation and Modelling Conference - ESM2011.
bibtex: '@inproceedings{Renken_Laroque_Fischer_2011, title={An Easy Extendable Modeling
Framework for Discrete Event Simulation Models and their Visualization}, booktitle={Proceedings
of The 25th European Simulation and Modelling Conference - ESM2011}, author={Renken,
Hendrik and Laroque, Christoph and Fischer, Matthias}, year={2011} }'
chicago: Renken, Hendrik, Christoph Laroque, and Matthias Fischer. “An Easy Extendable
Modeling Framework for Discrete Event Simulation Models and Their Visualization.”
In Proceedings of The 25th European Simulation and Modelling Conference - ESM2011,
2011.
ieee: H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework
for Discrete Event Simulation Models and their Visualization,” in Proceedings
of The 25th European Simulation and Modelling Conference - ESM2011, 2011.
mla: Renken, Hendrik, et al. “An Easy Extendable Modeling Framework for Discrete
Event Simulation Models and Their Visualization.” Proceedings of The 25th European
Simulation and Modelling Conference - ESM2011, 2011.
short: 'H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European
Simulation and Modelling Conference - ESM2011, 2011.'
date_created: 2020-08-24T14:01:49Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of The 25th European Simulation and Modelling Conference
- ESM2011
status: public
title: An Easy Extendable Modeling Framework for Discrete Event Simulation Models
and their Visualization
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '18194'
abstract:
- lang: eng
text: 'We present a parallel rendering system for PC-Clusters to visualize large
3D scenes. One single visualization node, equipped with a high-end graphics adapter,
is supported by a group of backend nodes with weak graphics performance. The objects
of the scene are distributed among these backend nodes, they serve two purposes:
First, they provide an out-of-core memory system for the visualization node. Second,
they assist the visualization node''s rendering by performing visibility calculations
and only sending visible objects to the visualization node. In order to obtain
fast rendering with our system, we have to distribute the objects among the backend
nodes in a way that does not only guarantee an even distribution of the objects,
but also an even distribution of the visibility calculations and the amount of
data send to the visualization node. We identify necessary properties of the distribution
and argue that a random distribution is a good candidate. Further, in order to
reduce the number of objects sent to the visualization node per frame, we employ
an approximate hierarchical occlusion culling in each backend node. For this,
they are equipped, in addition to the objects assigned to them, with simplified
versions of the other objects of the 3D scene. The visualization node is equipped
with 512 MiB video memory and supported by 15 backend nodes. This system is able
to render a approx. 350 million polygons (approx. 8.5 GiB) large aircraft model
between 20 - 30 fps and thus allows a walkthrough in real-time.'
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Clemens
full_name: Koch, Clemens
last_name: Koch
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Parallel Out-of-Core
Occlusion Culling. Published online 2011.
apa: Suess, T., Koch, C., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2011).
Parallel Out-of-Core Occlusion Culling.
bibtex: '@article{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2011, title={Parallel
Out-of-Core Occlusion Culling}, author={Suess, Tim and Koch, Clemens and Jähn,
Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2011}
}'
chicago: Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm
Meyer auf der Heide. “Parallel Out-of-Core Occlusion Culling,” 2011.
ieee: T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel
Out-of-Core Occlusion Culling.” 2011.
mla: Suess, Tim, et al. Parallel Out-of-Core Occlusion Culling. 2011.
short: T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, (2011).
date_created: 2020-08-24T14:14:10Z
date_updated: 2022-01-06T06:53:27Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-24T14:13:46Z
date_updated: 2020-08-24T14:13:46Z
file_id: '18195'
file_name: pre-03-2011-5220.pdf
file_size: 3091853
relation: main_file
success: 1
file_date_updated: 2020-08-24T14:13:46Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Parallel Out-of-Core Occlusion Culling
type: preprint
user_id: '15415'
year: '2011'
...
---
_id: '18568'
author:
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Martin
full_name: Hoefer, Martin
last_name: Hoefer
- first_name: 'Alexander '
full_name: 'Skopalik, Alexander '
last_name: Skopalik
- first_name: Michal
full_name: Penn, Michal
last_name: Penn
- first_name: Maria
full_name: Polukarov, Maria
last_name: Polukarov
citation:
ama: 'Vöcking B, Hoefer M, Skopalik A, Penn M, Polukarov M. Considerate Equilibrium.
In: {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on
Artificial Intelligence,. ; 2011:234--239.'
apa: Vöcking, B., Hoefer, M., Skopalik, A., Penn, M., & Polukarov, M. (2011).
Considerate Equilibrium. In {IJCAI} 2011, Proceedings of the 22nd International
Joint Conference on Artificial Intelligence, (pp. 234--239).
bibtex: '@inproceedings{Vöcking_Hoefer_Skopalik_Penn_Polukarov_2011, title={Considerate
Equilibrium}, booktitle={{IJCAI} 2011, Proceedings of the 22nd International Joint
Conference on Artificial Intelligence,}, author={Vöcking, Berthold and Hoefer,
Martin and Skopalik, Alexander and Penn, Michal and Polukarov, Maria}, year={2011},
pages={234--239} }'
chicago: Vöcking, Berthold, Martin Hoefer, Alexander Skopalik, Michal Penn, and
Maria Polukarov. “Considerate Equilibrium.” In {IJCAI} 2011, Proceedings of
the 22nd International Joint Conference on Artificial Intelligence, 234--239,
2011.
ieee: B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, and M. Polukarov, “Considerate
Equilibrium,” in {IJCAI} 2011, Proceedings of the 22nd International Joint
Conference on Artificial Intelligence, 2011, pp. 234--239.
mla: Vöcking, Berthold, et al. “Considerate Equilibrium.” {IJCAI} 2011, Proceedings
of the 22nd International Joint Conference on Artificial Intelligence, 2011,
pp. 234--239.
short: 'B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, M. Polukarov, in: {IJCAI} 2011,
Proceedings of the 22nd International Joint Conference on Artificial Intelligence,
2011, pp. 234--239.'
date_created: 2020-08-28T12:23:42Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
language:
- iso: eng
page: 234--239
publication: '{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
on Artificial Intelligence,'
related_material:
link:
- relation: confirmation
url: http://ijcai.org/papers11/Papers/IJCAI11-050.pdf
status: public
title: Considerate Equilibrium
type: conference
user_id: '15415'
year: '2011'
...