---
_id: '20255'
abstract:
- lang: eng
text: 'By compiling macroscopic models we analyze the adaptive behavior in a swarm
of autonomous robots generated by a bio-inspired, distributed control algorithm.
We developed two macroscopic models by taking two different perspectives: A Stock
& Flow model, which is simple to implement and fast to simulate, and a spatially
resolved model based on diffusion processes. These two models were compared concerning
their prediction quality and their analytical power: One model allowed easy identification
of the major feedback loops governing the swarm behavior. The other model allowed
analysis of the expected shapes and positions of observable robot clusters. We
found a high correlation in the challenges posed by both modeling techniques and
we highlighted the inherent problems of inferring emergent macroscopic rules from
a microscopic description of swarm behavior.'
author:
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: Schmickl T, Hamann H, Wörn H, Crailsheim K. Two different approaches to a macroscopic
model of a bio-inspired robotic swarm. Robotics and Autonomous Systems.
2009;6(9):913-921. doi:10.1016/j.robot.2009.06.002
apa: Schmickl, T., Hamann, H., Wörn, H., & Crailsheim, K. (2009). Two different
approaches to a macroscopic model of a bio-inspired robotic swarm. Robotics
and Autonomous Systems, 6(9), 913–921. https://doi.org/10.1016/j.robot.2009.06.002
bibtex: '@article{Schmickl_Hamann_Wörn_Crailsheim_2009, title={Two different approaches
to a macroscopic model of a bio-inspired robotic swarm}, volume={6}, DOI={10.1016/j.robot.2009.06.002},
number={9}, journal={Robotics and Autonomous Systems}, author={Schmickl, Thomas
and Hamann, Heiko and Wörn, Heinz and Crailsheim, Karl}, year={2009}, pages={913–921}
}'
chicago: 'Schmickl, Thomas, Heiko Hamann, Heinz Wörn, and Karl Crailsheim. “Two
Different Approaches to a Macroscopic Model of a Bio-Inspired Robotic Swarm.”
Robotics and Autonomous Systems 6, no. 9 (2009): 913–21. https://doi.org/10.1016/j.robot.2009.06.002.'
ieee: T. Schmickl, H. Hamann, H. Wörn, and K. Crailsheim, “Two different approaches
to a macroscopic model of a bio-inspired robotic swarm,” Robotics and Autonomous
Systems, vol. 6, no. 9, pp. 913–921, 2009.
mla: Schmickl, Thomas, et al. “Two Different Approaches to a Macroscopic Model of
a Bio-Inspired Robotic Swarm.” Robotics and Autonomous Systems, vol. 6,
no. 9, 2009, pp. 913–21, doi:10.1016/j.robot.2009.06.002.
short: T. Schmickl, H. Hamann, H. Wörn, K. Crailsheim, Robotics and Autonomous Systems
6 (2009) 913–921.
date_created: 2020-11-02T14:07:44Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
doi: 10.1016/j.robot.2009.06.002
intvolume: ' 6'
issue: '9'
language:
- iso: eng
page: 913-921
publication: Robotics and Autonomous Systems
publication_identifier:
issn:
- 0921-8890
publication_status: published
status: public
title: Two different approaches to a macroscopic model of a bio-inspired robotic swarm
type: journal_article
user_id: '15415'
volume: 6
year: '2009'
...
---
_id: '20259'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Inge
full_name: Troch, Inge
last_name: Troch
- first_name: F.
full_name: Breitenecker, F.
last_name: Breitenecker
citation:
ama: 'Hamann H, Troch I, Breitenecker F. Pattern Formation as a Transient Phenomenon
in the Nonlinear Dynamics of a Multi-Agent System. In: MATHMOD 2009 - 6th Vienna
International Conference on Mathematical Modelling. ; 2009.'
apa: Hamann, H., Troch, I., & Breitenecker, F. (2009). Pattern Formation as
a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System. In MATHMOD
2009 - 6th Vienna International Conference on Mathematical Modelling.
bibtex: '@inproceedings{Hamann_Troch_Breitenecker_2009, title={Pattern Formation
as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System},
booktitle={MATHMOD 2009 - 6th Vienna International Conference on Mathematical
Modelling}, author={Hamann, Heiko and Troch, Inge and Breitenecker, F.}, year={2009}
}'
chicago: Hamann, Heiko, Inge Troch, and F. Breitenecker. “Pattern Formation as a
Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System.” In MATHMOD
2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.
ieee: H. Hamann, I. Troch, and F. Breitenecker, “Pattern Formation as a Transient
Phenomenon in the Nonlinear Dynamics of a Multi-Agent System,” in MATHMOD 2009
- 6th Vienna International Conference on Mathematical Modelling, 2009.
mla: Hamann, Heiko, et al. “Pattern Formation as a Transient Phenomenon in the Nonlinear
Dynamics of a Multi-Agent System.” MATHMOD 2009 - 6th Vienna International
Conference on Mathematical Modelling, 2009.
short: 'H. Hamann, I. Troch, F. Breitenecker, in: MATHMOD 2009 - 6th Vienna International
Conference on Mathematical Modelling, 2009.'
date_created: 2020-11-02T14:18:27Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling
status: public
title: Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a
Multi-Agent System
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '17453'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Franz-Josef
full_name: Rammig, Franz-Josef
last_name: Rammig
citation:
ama: 'Meyer auf der Heide F, Rammig F-J. Self-Organisation and Self-Optimization.
Public Service Review: Science and Technology. 2009;04.'
apa: 'Meyer auf der Heide, F., & Rammig, F.-J. (2009). Self-Organisation and
Self-Optimization. Public Service Review: Science and Technology, 04.'
bibtex: '@article{Meyer auf der Heide_Rammig_2009, title={Self-Organisation and
Self-Optimization}, volume={04}, journal={Public Service Review: Science and Technology},
author={Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef}, year={2009} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation
and Self-Optimization.” Public Service Review: Science and Technology 04
(2009).'
ieee: 'F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,”
Public Service Review: Science and Technology, vol. 04, 2009.'
mla: 'Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation
and Self-Optimization.” Public Service Review: Science and Technology,
vol. 04, 2009.'
short: 'F. Meyer auf der Heide, F.-J. Rammig, Public Service Review: Science and
Technology 04 (2009).'
date_created: 2020-07-29T13:51:54Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
intvolume: ' 4'
language:
- iso: eng
publication: 'Public Service Review: Science and Technology'
status: public
title: Self-Organisation and Self-Optimization
type: journal_article
user_id: '15415'
volume: '04'
year: '2009'
...
---
_id: '19031'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
citation:
ama: Briest P. Algorithmische und komplexitätstheoretische Aspekte kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). it
- Information Technology. 2009;51(1):62-65. doi:10.1524/itit.2009.0524
apa: Briest, P. (2009). Algorithmische und komplexitätstheoretische Aspekte kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). It
- Information Technology, 51(1), 62–65. https://doi.org/10.1524/itit.2009.0524
bibtex: '@article{Briest_2009, title={Algorithmische und komplexitätstheoretische
Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial
Pricing Problems)}, volume={51}, DOI={10.1524/itit.2009.0524},
number={1}, journal={it - Information Technology}, author={Briest, Patrick}, year={2009},
pages={62–65} }'
chicago: 'Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte
Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing
Problems).” It - Information Technology 51, no. 1 (2009): 62–65. https://doi.org/10.1524/itit.2009.0524.'
ieee: P. Briest, “Algorithmische und komplexitätstheoretische Aspekte kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems),” it
- Information Technology, vol. 51, no. 1, pp. 62–65, 2009.
mla: Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).” It
- Information Technology, vol. 51, no. 1, 2009, pp. 62–65, doi:10.1524/itit.2009.0524.
short: P. Briest, It - Information Technology 51 (2009) 62–65.
date_created: 2020-09-04T12:05:57Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1524/itit.2009.0524
intvolume: ' 51'
issue: '1'
language:
- iso: eng
page: 62-65
publication: it - Information Technology
publication_identifier:
issn:
- 1611-2776
publication_status: published
status: public
title: Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung
(Computational Aspects of Combinatorial Pricing Problems)
type: journal_article
user_id: '15415'
volume: 51
year: '2009'
...
---
_id: '23744'
abstract:
- lang: eng
text: "In a Stackelberg pricing game a leader aims to set prices on a subset of
a given collection of items, such as to maximize her revenue from a follower purchasing
a feasible subset of the items. We focus on the case of computationally bounded
followers who cannot optimize exactly over the range of all feasible subsets,
but apply some publicly known algorithm to determine the set of items to purchase.
This corresponds to general multi-dimensional pricing assuming that consumers
cannot optimize over the full domain of their valuation functions but still aim
to act rationally to the best of their ability.\r\n\r\nWe consider two versions
of this novel type of Stackelberg pricing games. Assuming that items are weighted
objects and the follower seeks to purchase a min-cost selection of objects of
some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate
algorithm, we show how an extension of the known single-price algorithm can be
used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s
revenue maximization problem based on so-called near-uniform price assignments.
We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case
that items are subsets of some ground set which the follower seeks to cover (the
Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform
price assignments fail to yield a good approximation guarantee. However, in the
special case of elements with frequency 2 (the Vertex-Cover problem) it turns
out that exact revenue maximization can be done in polynomial-time. This stands
in sharp contrast to the fact that revenue maximization becomes APX-hard already
for elements with frequency 3."
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Martin
full_name: Hoefer, Martin
last_name: Hoefer
- first_name: Luciano
full_name: Gualà, Luciano
last_name: Gualà
- first_name: Carmine
full_name: Ventre, Carmine
last_name: Ventre
citation:
ama: 'Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally
Bounded Consumers. In: Lecture Notes in Computer Science. Berlin, Heidelberg;
2009. doi:10.1007/978-3-642-10841-9_6'
apa: Briest, P., Hoefer, M., Gualà, L., & Ventre, C. (2009). On Stackelberg
Pricing with Computationally Bounded Consumers. In Lecture Notes in Computer
Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_6
bibtex: '@inbook{Briest_Hoefer_Gualà_Ventre_2009, place={Berlin, Heidelberg}, title={On
Stackelberg Pricing with Computationally Bounded Consumers}, DOI={10.1007/978-3-642-10841-9_6},
booktitle={Lecture Notes in Computer Science}, author={Briest, Patrick and Hoefer,
Martin and Gualà, Luciano and Ventre, Carmine}, year={2009} }'
chicago: Briest, Patrick, Martin Hoefer, Luciano Gualà, and Carmine Ventre. “On
Stackelberg Pricing with Computationally Bounded Consumers.” In Lecture Notes
in Computer Science. Berlin, Heidelberg, 2009. https://doi.org/10.1007/978-3-642-10841-9_6.
ieee: P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with
Computationally Bounded Consumers,” in Lecture Notes in Computer Science,
Berlin, Heidelberg, 2009.
mla: Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded
Consumers.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.
short: 'P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 2009.'
date_created: 2021-09-03T10:55:38Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
doi: 10.1007/978-3-642-10841-9_6
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: On Stackelberg Pricing with Computationally Bounded Consumers
type: book_chapter
user_id: '15415'
year: '2009'
...
---
_id: '18138'
abstract:
- lang: eng
text: Modern companies are nowadays confronted with an increasing demand of multiple
products, where they need to perform more flexible every day. Cost-intensive decisions
are to be confirmed in short times, in order to minimize risks and secure efficient
production programs as well as material flows. Tools for this digital planning
via simulation methods are one well established possibility to receive decision
support. Nevertheless, the creation of the necessary simulation models is a complicated
and error-prone process, where complexity of modeling, validation and verification
depends on the used tool and its functionalities. This paper presents implemented
concepts for an innovative user support in his tasks of verification and validation
of simulation models during the execution of a simulation run. Time-intensive
procedures like stopping simulation, parameterization and restarting within the
problem analysis are simplified. So the user is able to focus on the real problem
solving task.
author:
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation
during Simulation Runtime. In: European Simulation and Modelling Conference
(ESM 2009). EUROSIS-ETI; 2009.'
apa: Laroque, C., Fischer, M., & Dangelmaier, W. (2009). Concepts for Model
Verification and Validation during Simulation Runtime. In European Simulation
and Modelling Conference (ESM 2009). EUROSIS-ETI.
bibtex: '@inproceedings{Laroque_Fischer_Dangelmaier_2009, title={Concepts for Model
Verification and Validation during Simulation Runtime}, booktitle={European Simulation
and Modelling Conference (ESM 2009)}, publisher={EUROSIS-ETI}, author={Laroque,
Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2009} }'
chicago: Laroque, Christoph, Matthias Fischer, and Wilhelm Dangelmaier. “Concepts
for Model Verification and Validation during Simulation Runtime.” In European
Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI, 2009.
ieee: C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification
and Validation during Simulation Runtime,” in European Simulation and Modelling
Conference (ESM 2009), 2009.
mla: Laroque, Christoph, et al. “Concepts for Model Verification and Validation
during Simulation Runtime.” European Simulation and Modelling Conference (ESM
2009), EUROSIS-ETI, 2009.
short: 'C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling
Conference (ESM 2009), EUROSIS-ETI, 2009.'
date_created: 2020-08-24T07:28:23Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
publication: European Simulation and Modelling Conference (ESM 2009)
publisher: EUROSIS-ETI
status: public
title: Concepts for Model Verification and Validation during Simulation Runtime
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '18291'
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Huber, Daniel
last_name: Huber
- first_name: 'Christoph '
full_name: 'Laroque, Christoph '
last_name: Laroque
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Suess T, Fischer M, Huber D, Laroque C, Dangelmaier W. Ein System zur aggregierten
Visualisierung verteilter Materialflusssimulationen. In: Augmented & Virtual
Reality in Der Produktentstehung. Vol 252. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2009:111--126.'
apa: Suess, T., Fischer, M., Huber, D., Laroque, C., & Dangelmaier, W. (2009).
Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen.
In Augmented & Virtual Reality in der Produktentstehung (Vol. 252,
pp. 111--126). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@inbook{Suess_Fischer_Huber_Laroque_Dangelmaier_2009, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Ein System zur aggregierten Visualisierung
verteilter Materialflusssimulationen}, volume={252}, booktitle={Augmented &
Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn}, author={Suess, Tim and Fischer, Matthias
and Huber, Daniel and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2009},
pages={111--126}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Suess, Tim, Matthias Fischer, Daniel Huber, Christoph Laroque, and Wilhelm
Dangelmaier. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.”
In Augmented & Virtual Reality in Der Produktentstehung, 252:111--126.
Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009.
ieee: T. Suess, M. Fischer, D. Huber, C. Laroque, and W. Dangelmaier, “Ein System
zur aggregierten Visualisierung verteilter Materialflusssimulationen,” in Augmented
& Virtual Reality in der Produktentstehung, vol. 252, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.
mla: Suess, Tim, et al. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.”
Augmented & Virtual Reality in Der Produktentstehung, vol. 252, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.
short: 'T. Suess, M. Fischer, D. Huber, C. Laroque, W. Dangelmaier, in: Augmented
& Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 2009, pp. 111--126.'
date_created: 2020-08-25T14:25:41Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 252'
language:
- iso: eng
page: 111--126
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen
type: book_chapter
user_id: '5786'
volume: 252
year: '2009'
...
---
_id: '18346'
abstract:
- lang: eng
text: "For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition
p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others)
from p? The present work explores the trade-off between query time\r\nand preprocessing
space for these quantities in 2D: exactly, in the approximate\r\ndeterministic,
and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space
data structure for S that, given p and time O(log n), allows\r\nto approximate
the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here
m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically
is just linear in the size n of the scene S. On the other hand,\r\nwe present
a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing
time and space with similar approximation properties and query\r\ntime O(k*polylog
n), where kProc. 25th European Workshop on Computational Geometry. ;
2009:203-206.'
apa: Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler,
M. (2009). Planar Visibility Counting. In Proc. 25th European Workshop on Computational
Geometry (pp. 203–206).
bibtex: '@inproceedings{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2009, title={Planar
Visibility Counting}, booktitle={Proc. 25th European Workshop on Computational
Geometry}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and
Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2009}, pages={203–206}
}'
chicago: Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf
der Heide, and Martin Ziegler. “Planar Visibility Counting.” In Proc. 25th
European Workshop on Computational Geometry, 203–6, 2009.
ieee: M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar
Visibility Counting,” in Proc. 25th European Workshop on Computational Geometry,
2009, pp. 203–206.
mla: Fischer, Matthias, et al. “Planar Visibility Counting.” Proc. 25th European
Workshop on Computational Geometry, 2009, pp. 203–06.
short: 'M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, in:
Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206.'
date_created: 2020-08-26T08:49:50Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '63'
language:
- iso: eng
page: 203-206
publication: Proc. 25th European Workshop on Computational Geometry
status: public
title: Planar Visibility Counting
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '16429'
author:
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Kutyłowski J, Meyer auf der Heide F. Optimal strategies for maintaining a chain
of relays between an explorer and a base camp. Theoretical Computer Science.
2009:3391-3405. doi:10.1016/j.tcs.2008.04.010
apa: Kutyłowski, J., & Meyer auf der Heide, F. (2009). Optimal strategies for
maintaining a chain of relays between an explorer and a base camp. Theoretical
Computer Science, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010
bibtex: '@article{Kutyłowski_Meyer auf der Heide_2009, title={Optimal strategies
for maintaining a chain of relays between an explorer and a base camp}, DOI={10.1016/j.tcs.2008.04.010},
journal={Theoretical Computer Science}, author={Kutyłowski, Jarosław and Meyer
auf der Heide, Friedhelm}, year={2009}, pages={3391–3405} }'
chicago: Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies
for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical
Computer Science, 2009, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010.
ieee: J. Kutyłowski and F. Meyer auf der Heide, “Optimal strategies for maintaining
a chain of relays between an explorer and a base camp,” Theoretical Computer
Science, pp. 3391–3405, 2009.
mla: Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies
for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical
Computer Science, 2009, pp. 3391–405, doi:10.1016/j.tcs.2008.04.010.
short: J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009)
3391–3405.
date_created: 2020-04-06T13:52:18Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2008.04.010
language:
- iso: eng
page: 3391-3405
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Optimal strategies for maintaining a chain of relays between an explorer and
a base camp
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '16430'
author:
- first_name: Jan
full_name: Mehler, Jan
last_name: Mehler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Mehler J, Meyer auf der Heide F. Power-aware online file allocation in mobile
ad hoc networks. In: Proceedings of the Twenty-First Annual Symposium on Parallelism
in Algorithms and Architectures - SPAA ’09. ; 2009. doi:10.1145/1583991.1584072'
apa: Mehler, J., & Meyer auf der Heide, F. (2009). Power-aware online file allocation
in mobile ad hoc networks. In Proceedings of the twenty-first annual symposium
on Parallelism in algorithms and architectures - SPAA ’09. https://doi.org/10.1145/1583991.1584072
bibtex: '@inproceedings{Mehler_Meyer auf der Heide_2009, title={Power-aware online
file allocation in mobile ad hoc networks}, DOI={10.1145/1583991.1584072},
booktitle={Proceedings of the twenty-first annual symposium on Parallelism in
algorithms and architectures - SPAA ’09}, author={Mehler, Jan and Meyer auf der
Heide, Friedhelm}, year={2009} }'
chicago: Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File
Allocation in Mobile Ad Hoc Networks.” In Proceedings of the Twenty-First Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.
https://doi.org/10.1145/1583991.1584072.
ieee: J. Mehler and F. Meyer auf der Heide, “Power-aware online file allocation
in mobile ad hoc networks,” in Proceedings of the twenty-first annual symposium
on Parallelism in algorithms and architectures - SPAA ’09, 2009.
mla: Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation
in Mobile Ad Hoc Networks.” Proceedings of the Twenty-First Annual Symposium
on Parallelism in Algorithms and Architectures - SPAA ’09, 2009, doi:10.1145/1583991.1584072.
short: 'J. Mehler, F. Meyer auf der Heide, in: Proceedings of the Twenty-First Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.'
date_created: 2020-04-06T13:53:57Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1583991.1584072
language:
- iso: eng
publication: Proceedings of the twenty-first annual symposium on Parallelism in algorithms
and architectures - SPAA '09
publication_identifier:
isbn:
- '9781605586069'
publication_status: published
status: public
title: Power-aware online file allocation in mobile ad hoc networks
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '16431'
citation:
ama: Meyer auf der Heide F, Bender MA, eds. Proceedings of the Twenty-First Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’09.; 2009.
doi:10.1145/1583991
apa: Meyer auf der Heide, F., & Bender, M. A. (Eds.). (2009). Proceedings
of the twenty-first annual symposium on Parallelism in algorithms and architectures
- SPAA ’09. https://doi.org/10.1145/1583991
bibtex: '@book{Meyer auf der Heide_Bender_2009, title={Proceedings of the twenty-first
annual symposium on Parallelism in algorithms and architectures - SPAA ’09}, DOI={10.1145/1583991}, year={2009} }'
chicago: Meyer auf der Heide, Friedhelm, and Michael A. Bender, eds. Proceedings
of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’09, 2009. https://doi.org/10.1145/1583991.
ieee: F. Meyer auf der Heide and M. A. Bender, Eds., Proceedings of the twenty-first
annual symposium on Parallelism in algorithms and architectures - SPAA ’09.
2009.
mla: Meyer auf der Heide, Friedhelm, and Michael A. Bender, editors. Proceedings
of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’09. 2009, doi:10.1145/1583991.
short: F. Meyer auf der Heide, M.A. Bender, eds., Proceedings of the Twenty-First
Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.
date_created: 2020-04-06T13:55:23Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1583991
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael A.
full_name: Bender, Michael A.
last_name: Bender
language:
- iso: eng
publication_identifier:
isbn:
- '9781605586069'
publication_status: published
status: public
title: Proceedings of the twenty-first annual symposium on Parallelism in algorithms
and architectures - SPAA '09
type: conference_editor
user_id: '15415'
year: '2009'
...
---
_id: '16398'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Jaroslaw
full_name: Byrka, Jaroslaw
last_name: Byrka
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Bienkowski M, Byrka J, Korzeniowski M, Meyer auf der Heide F. Optimal algorithms
for page migration in dynamic networks. Journal of Discrete Algorithms.
2009:545-569. doi:10.1016/j.jda.2008.07.006
apa: Bienkowski, M., Byrka, J., Korzeniowski, M., & Meyer auf der Heide, F.
(2009). Optimal algorithms for page migration in dynamic networks. Journal
of Discrete Algorithms, 545–569. https://doi.org/10.1016/j.jda.2008.07.006
bibtex: '@article{Bienkowski_Byrka_Korzeniowski_Meyer auf der Heide_2009, title={Optimal
algorithms for page migration in dynamic networks}, DOI={10.1016/j.jda.2008.07.006},
journal={Journal of Discrete Algorithms}, author={Bienkowski, Marcin and Byrka,
Jaroslaw and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2009},
pages={545–569} }'
chicago: Bienkowski, Marcin, Jaroslaw Byrka, Miroslaw Korzeniowski, and Friedhelm
Meyer auf der Heide. “Optimal Algorithms for Page Migration in Dynamic Networks.”
Journal of Discrete Algorithms, 2009, 545–69. https://doi.org/10.1016/j.jda.2008.07.006.
ieee: M. Bienkowski, J. Byrka, M. Korzeniowski, and F. Meyer auf der Heide, “Optimal
algorithms for page migration in dynamic networks,” Journal of Discrete Algorithms,
pp. 545–569, 2009.
mla: Bienkowski, Marcin, et al. “Optimal Algorithms for Page Migration in Dynamic
Networks.” Journal of Discrete Algorithms, 2009, pp. 545–69, doi:10.1016/j.jda.2008.07.006.
short: M. Bienkowski, J. Byrka, M. Korzeniowski, F. Meyer auf der Heide, Journal
of Discrete Algorithms (2009) 545–569.
date_created: 2020-04-03T10:40:45Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.jda.2008.07.006
language:
- iso: eng
page: 545-569
publication: Journal of Discrete Algorithms
publication_identifier:
issn:
- 1570-8667
publication_status: published
status: public
title: Optimal algorithms for page migration in dynamic networks
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '19615'
author:
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: Schomaker G. Distributed Resource Allocation and Management in Heterogeneous
Networks. Vol 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2008.
apa: Schomaker, G. (2008). Distributed Resource Allocation and Management in
Heterogeneous Networks (Vol. 259). Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn.
bibtex: '@book{Schomaker_2008, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Distributed Resource Allocation and Management in Heterogeneous
Networks}, volume={259}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Schomaker, Gunnar}, year={2008}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Schomaker, Gunnar. Distributed Resource Allocation and Management in
Heterogeneous Networks. Vol. 259. Verlagsschriftenreihe Des Heinz Nixdorf
Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008.
ieee: G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous
Networks, vol. 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008.
mla: Schomaker, Gunnar. Distributed Resource Allocation and Management in Heterogeneous
Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
short: G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous
Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
date_created: 2020-09-22T08:10:41Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 259'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-78-1
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090114013
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Distributed Resource Allocation and Management in Heterogeneous Networks
type: dissertation
user_id: '5786'
volume: 259
year: '2008'
...
---
_id: '19686'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
citation:
ama: 'Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP).
; 2008. doi:10.1007/978-3-540-70575-8_66'
apa: Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP).
https://doi.org/10.1007/978-3-540-70575-8_66
bibtex: '@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing
Problem}, DOI={10.1007/978-3-540-70575-8_66},
booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages
and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }'
chicago: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In
Proceedings of the 35th InternationalColloquium on Automata, Languages and
Programming (ICALP), 2008. https://doi.org/10.1007/978-3-540-70575-8_66.
ieee: P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP),
2008.
mla: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP),
2008, doi:10.1007/978-3-540-70575-8_66.
short: 'P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata,
Languages and Programming (ICALP), 2008.'
date_created: 2020-09-25T09:45:40Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-540-70575-8_66
language:
- iso: eng
publication: Proceedings of the 35th InternationalColloquium on Automata, Languages
and Programming (ICALP)
publication_identifier:
isbn:
- '9783540705741'
- '9783540705758'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Uniform Budgets and the Envy-Free Pricing Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19687'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
- first_name: Moshe
full_name: Babaioff, Moshe
last_name: Babaioff
citation:
ama: 'Briest P, Krysta P, Babaioff M. On the Approximability of Combinatorial Exchange
Problems. In: Proceedings of the 1st International Symposium on Algorithmic
Game Theory (SAGT). Cham; 2008. doi:https://doi.org/10.1007/978-3-540-79309-0_9'
apa: Briest, P., Krysta, P., & Babaioff, M. (2008). On the Approximability of
Combinatorial Exchange Problems. In Proceedings of the 1st International Symposium
on Algorithmic Game Theory (SAGT). Cham. https://doi.org/10.1007/978-3-540-79309-0_9
bibtex: '@inproceedings{Briest_Krysta_Babaioff_2008, place={Cham}, title={On the
Approximability of Combinatorial Exchange Problems}, DOI={https://doi.org/10.1007/978-3-540-79309-0_9},
booktitle={Proceedings of the 1st International Symposium on Algorithmic Game
Theory (SAGT)}, author={Briest, Patrick and Krysta, Piotr and Babaioff, Moshe},
year={2008} }'
chicago: Briest, Patrick, Piotr Krysta, and Moshe Babaioff. “On the Approximability
of Combinatorial Exchange Problems.” In Proceedings of the 1st International
Symposium on Algorithmic Game Theory (SAGT). Cham, 2008. https://doi.org/10.1007/978-3-540-79309-0_9.
ieee: P. Briest, P. Krysta, and M. Babaioff, “On the Approximability of Combinatorial
Exchange Problems,” in Proceedings of the 1st International Symposium on Algorithmic
Game Theory (SAGT), 2008.
mla: Briest, Patrick, et al. “On the Approximability of Combinatorial Exchange Problems.”
Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT),
2008, doi:https://doi.org/10.1007/978-3-540-79309-0_9.
short: 'P. Briest, P. Krysta, M. Babaioff, in: Proceedings of the 1st International
Symposium on Algorithmic Game Theory (SAGT), Cham, 2008.'
date_created: 2020-09-25T09:49:43Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: https://doi.org/10.1007/978-3-540-79309-0_9
language:
- iso: eng
place: Cham
publication: Proceedings of the 1st International Symposium on Algorithmic Game Theory
(SAGT)
publication_status: published
status: public
title: On the Approximability of Combinatorial Exchange Problems
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19688'
abstract:
- lang: eng
text: "We study the problem of computing approximate Nash equilibria (epsilon-Nash\r\nequilibria)
in normal form games, where the number of players is a small\r\nconstant. We consider
the approach of looking for solutions with constant\r\nsupport size. It is known
from recent work that in the 2-player case, a\r\n1/2-Nash equilibrium can be easily
found, but in general one cannot achieve a\r\nsmaller value of epsilon than 1/2.
In this paper we extend those results to the\r\nk-player case, and find that epsilon
= 1-1/k is feasible, but cannot be\r\nimproved upon. We show how stronger results
for the 2-player case may be used\r\nin order to slightly improve upon the epsilon
= 1-1/k obtained in the k-player\r\ncase."
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Paul W.
full_name: Goldberg, Paul W.
last_name: Goldberg
- first_name: Heiko
full_name: Roeglin, Heiko
last_name: Roeglin
citation:
ama: Briest P, Goldberg PW, Roeglin H. Approximate Equilibria in Games with Few
Players.; 2008.
apa: Briest, P., Goldberg, P. W., & Roeglin, H. (2008). Approximate Equilibria
in Games with Few Players.
bibtex: '@book{Briest_Goldberg_Roeglin_2008, title={Approximate Equilibria in Games
with Few Players}, author={Briest, Patrick and Goldberg, Paul W. and Roeglin,
Heiko}, year={2008} }'
chicago: Briest, Patrick, Paul W. Goldberg, and Heiko Roeglin. Approximate Equilibria
in Games with Few Players, 2008.
ieee: P. Briest, P. W. Goldberg, and H. Roeglin, Approximate Equilibria in Games
with Few Players. 2008.
mla: Briest, Patrick, et al. Approximate Equilibria in Games with Few Players.
2008.
short: P. Briest, P.W. Goldberg, H. Roeglin, Approximate Equilibria in Games with
Few Players, 2008.
date_created: 2020-09-25T09:52:57Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
external_id:
arxiv:
- '0804.4524 '
language:
- iso: eng
status: public
title: Approximate Equilibria in Games with Few Players
type: report
user_id: '15415'
year: '2008'
...
---
_id: '19812'
abstract:
- lang: eng
text: 'Modern peer-to-peer networks consist of several network layers and distributed
algorithms providing features like indexing, resource balancing, entry protocols,
security, anonymity, and cryptography. Since peer-to-peer networks are highly
dynamic, a fundamental task in the design of these networks is to provide high
connectivity. We propose a solution by distributed random link exchange algorithms
such that the overlay network can be a connected random graph or use a random
graph as backbone. Random graphs are expander graphs have logarithmic diameter,
high node connectivity, excellent communication properties, and are expander graphs
with high probability. In summary: they are an excellent choice to improve the
stability and robustness of a dynamic network.'
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
citation:
ama: 'Schindelhauer C, Mahlmann P. Random Graphs for Peer-to-Peer Overlays. In:
The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2008:1-22.'
apa: Schindelhauer, C., & Mahlmann, P. (2008). Random Graphs for Peer-to-Peer
Overlays. The European Integrated Project "Dynamically Evolving, Large Scale
Information Systems (DELIS), Proceedings of the Final Workshop, 222,
1–22.
bibtex: '@inproceedings{Schindelhauer_Mahlmann_2008, title={Random Graphs for Peer-to-Peer
Overlays}, number={222}, booktitle={The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schindelhauer,
Christian and Mahlmann, Peter}, year={2008}, pages={1–22} }'
chicago: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
Overlays.” In The European Integrated Project "Dynamically Evolving, Large
Scale Information Systems (DELIS), Proceedings of the Final Workshop, 1–22.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
ieee: C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,”
in The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop, 2008, no. 222, pp. 1–22.
mla: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
Overlays.” The European Integrated Project "Dynamically Evolving, Large Scale
Information Systems (DELIS), Proceedings of the Final Workshop, no. 222, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.
short: 'C. Schindelhauer, P. Mahlmann, in: The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.'
date_created: 2020-09-30T13:24:15Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '26'
issue: '222'
language:
- iso: eng
page: 1-22
publication: The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Random Graphs for Peer-to-Peer Overlays
type: conference
user_id: '5786'
year: '2008'
...
---
_id: '19813'
abstract:
- lang: eng
text: 'Autonomous robotic systems have been gaining the attention of research community
in mobile ad hoc network since the past few years. While motion cost and communications
cost constitute the primary energy consumers, each of them is investigated independently.
By taking into account the power consumption of both entities, the overall energy
efficiency of a system can be further improved. In this paper, the energy optimization
problem of radio communication and motion is examined. We consider a hybrid wireless network
that consists of a single autonomous mobile node and multiple relay nodes. The
mobile node interacts with the relays within its vicinity by continuously communicating
high-bandwidth data, e.g. triggered by a multimedia application like video surveillance.
The goal is to find the best path such that the energy consumption for both mobility
and communications is minimized. We introduce the Radio-Energy-Aware (REA) path
computation strategy by utilizing node mobility. Given the starting point, the
target point and the position of the relays, our simulation results show that
the proposed strategy improves the energy efficiency of mobile node compared to
the Motion-Energy-Aware (MEA) path constructed based only on the mobility cost. '
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Ooi CC, Schindelhauer C. Detours Save Energy in Mobile Wireless Networks.
In: MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008). Springer;
2008. doi:10.1007/978-0-387-84839-6_6'
apa: 'Ooi, C. C., & Schindelhauer, C. (2008). Detours Save Energy in Mobile
Wireless Networks. In MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
2008). Springer. https://doi.org/10.1007/978-0-387-84839-6_6'
bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Detours Save Energy in Mobile
Wireless Networks}, DOI={10.1007/978-0-387-84839-6_6},
booktitle={MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)}, publisher={Springer},
author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2008} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in
Mobile Wireless Networks.” In MWCN’08: Proc. of IFIP Joint Conference on Mobile
Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
(PWC 2008). Springer, 2008. https://doi.org/10.1007/978-0-387-84839-6_6.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Detours Save Energy in Mobile Wireless Networks,”
in MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), 2008.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile
Wireless Networks.” MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
2008), Springer, 2008, doi:10.1007/978-0-387-84839-6_6.'
short: 'C.C. Ooi, C. Schindelhauer, in: MWCN’08: Proc. of IFIP Joint Conference
on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
(PWC 2008), Springer, 2008.'
date_created: 2020-09-30T13:27:54Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-0-387-84839-6_6
language:
- iso: eng
publication: 'MWCN''08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)'
publication_identifier:
isbn:
- '9780387848389'
- '9780387848396'
issn:
- 1571-5736
publication_status: published
publisher: Springer
status: public
title: Detours Save Energy in Mobile Wireless Networks
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19832'
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Ooi CC, Schindelhauer C. Energy-Efficient Distributed Target Tracking Using
Wireless Relay Robots. In: ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008). ; 2008. doi:10.1007/978-3-642-00644-9_4'
apa: 'Ooi, C. C., & Schindelhauer, C. (2008). Energy-Efficient Distributed Target
Tracking Using Wireless Relay Robots. In ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008). https://doi.org/10.1007/978-3-642-00644-9_4'
bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots}, DOI={10.1007/978-3-642-00644-9_4},
booktitle={ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous
Robotic Systems (DARS 2008)}, author={Ooi, Chia Ching and Schindelhauer, Christian},
year={2008} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots.” In ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008. https://doi.org/10.1007/978-3-642-00644-9_4.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Energy-Efficient Distributed Target Tracking
Using Wireless Relay Robots,” in ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008), 2008.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots.” ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008, doi:10.1007/978-3-642-00644-9_4.'
short: 'C.C. Ooi, C. Schindelhauer, in: ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008), 2008.'
date_created: 2020-10-01T10:14:06Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-3-642-00644-9_4
language:
- iso: eng
publication: 'ARS''08: Proc. of the 9th International Symposium on Distributed Autonomous
Robotic Systems (DARS 2008)'
publication_identifier:
isbn:
- '9783642006432'
- '9783642006449'
publication_status: published
status: public
title: Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19950'
author:
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: Pietrzyk P. Lokale Strategien Zur Optimierung von Kommunikationsketten.;
2008.
apa: Pietrzyk, P. (2008). Lokale Strategien zur Optimierung von Kommunikationsketten.
bibtex: '@book{Pietrzyk_2008, title={Lokale Strategien zur Optimierung von Kommunikationsketten},
author={Pietrzyk, Peter}, year={2008} }'
chicago: Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten,
2008.
ieee: P. Pietrzyk, Lokale Strategien zur Optimierung von Kommunikationsketten.
2008.
mla: Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten.
2008.
short: P. Pietrzyk, Lokale Strategien Zur Optimierung von Kommunikationsketten,
2008.
date_created: 2020-10-07T14:23:26Z
date_updated: 2022-01-06T06:54:16Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-10-07T14:22:49Z
date_updated: 2020-10-07T14:22:49Z
file_id: '19951'
file_name: pub-hni-3364.pdf
file_size: 638802
relation: main_file
success: 1
file_date_updated: 2020-10-07T14:22:49Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Lokale Strategien zur Optimierung von Kommunikationsketten
type: mastersthesis
user_id: '15415'
year: '2008'
...