---
_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: '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'
...