---
_id: '16358'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: 'Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph
of the visibility graph on the gathering of mobile autonomous robots. In: Algorithms
for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer; 2016.
doi:10.1007/978-3-319-53058-1_5
'
apa: Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2016). The impact of
the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
robots. In Algorithms for Sensor Systems, Proceedings of the 12th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS).
Springer. https://doi.org/10.1007/978-3-319-53058-1_5
bibtex: '@inproceedings{Li_Meyer auf der Heide_Podlipyan_2016, title={The impact
of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
robots}, DOI={10.1007/978-3-319-53058-1_5
}, booktitle={Algorithms for Sensor Systems, Proceedings of the 12th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)},
publisher={Springer}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and
Podlipyan, Pavel}, year={2016} }'
chicago: Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact
of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous
Robots.” In Algorithms for Sensor Systems, Proceedings of the 12th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS).
Springer, 2016. https://doi.org/10.1007/978-3-319-53058-1_5
.
ieee: S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel
subgraph of the visibility graph on the gathering of mobile autonomous robots,”
in Algorithms for Sensor Systems, Proceedings of the 12th International Symposium
on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS),
2016.
mla: Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph
on the Gathering of Mobile Autonomous Robots.” Algorithms for Sensor Systems,
Proceedings of the 12th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016, doi:10.1007/978-3-319-53058-1_5 .
short: 'S. Li, F. Meyer auf der Heide, P. Podlipyan, in: Algorithms for Sensor Systems,
Proceedings of the 12th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016.'
date_created: 2020-04-01T12:28:09Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: '10.1007/978-3-319-53058-1_5 '
language:
- iso: eng
publication: Algorithms for Sensor Systems, Proceedings of the 12th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)
publisher: Springer
status: public
title: The impact of the Gabriel subgraph of the visibility graph on the gathering
of mobile autonomous robots
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16359'
abstract:
- lang: eng
text: In this paper, we solve the local gathering problem of a swarm of n indistinguishable,
point-shaped robots on a two dimensional grid in asymptotically optimal time O(n)
in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet
connected) swarm of robots, the gathering problem on the grid is to locate all
robots within a 2x2- sized area that is not known beforehand. Two robots are connected
if they are vertical or horizontal neighbors on the grid. The locality constraint
means that no global control, no compass, no global communication and only local
vision is available; hence, a robot can only see its grid neighbors up to a constant
L1-distance, which also limits its movements. A robot can move to one of its eight
neighboring grid cells and if two or more robots move to the same location they
are merged to be only one robot. The locality constraint is the significant challenging
issue here, since robot move- ments must not harm the (only globally checkable)
swarm connectivity. For solving the gathering problem, we provide a synchronous
algorithm { executed by every robot { which ensures that robots merge without
breaking the swarm con- nectivity. In our model, robots can obtain a special state,
which marks such a robot to be performing specific connec- tivity preserving movements
in order to allow later merge operations of the swarm. Compared to the grid, for
gath- ering in the Euclidean plane for the same robot and time model the best
known upper bound is O(n^2).
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically
Optimal Gathering on a Grid. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ACM; 2016:301-312. doi:10.1145/2935764.2935789'
apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016).
Asymptotically Optimal Gathering on a Grid. In Proceedings of the 28th ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 301–312).
ACM. https://doi.org/10.1145/2935764.2935789
bibtex: '@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically
Optimal Gathering on a Grid}, DOI={10.1145/2935764.2935789},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and
Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016},
pages={301–312} }'
chicago: Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer
auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In Proceedings
of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
301–12. ACM, 2016. https://doi.org/10.1145/2935764.2935789.
ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically
Optimal Gathering on a Grid,” in Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 301–312.
mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.”
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.
short: 'A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings
of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
ACM, 2016, pp. 301–312.'
date_created: 2020-04-01T12:46:35Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1145/2935764.2935789
language:
- iso: eng
page: 301-312
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publisher: ACM
status: public
title: Asymptotically Optimal Gathering on a Grid
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16360'
abstract:
- lang: eng
text: 'We consider the following variant of the two dimensional gathering problem
for swarms of robots: Given a swarm of n indistinguishable, point shaped robots
on a two dimensional grid. Initially, the robots form a closed chain on the grid
and must keep this connectivity during the whole process of their gathering. Connectivity
means, that neighboring robots of the chain need to be positioned at the same
or neighboring points of the grid. In our model, gathering means to keep shortening
the chain until the robots are located inside a 2*2 subgrid. Our model is completely
local (no global control, no global coordinates, no compass, no global communication
or vision, ...). Each robot can only see its next constant number of left and
right neighbors on the chain. This fixed constant is called the viewing path length.
All its operations and detections are restricted to this constant number of robots.
Other robots, even if located at neighboring or the same grid point cannot be
detected. Only based on the relative positions of its detectable chain neighbors,
a robot can decide to obtain a certain state. Based on this state and their local
knowledge, the robots do local modifications to the chain by moving to neighboring
grid points without breaking the chain. These modifications are performed without
the knowledge whether they lead to a global progress or not. We assume the fully
synchronous FSYNC model. For this problem, we present a gathering algorithm which
needs linear time. This result generalizes a result, where an open chain with
specified distinguishable (and fixed) endpoints is considered. '
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering
a Closed Chain of Robots on a Grid. In: Proceedings of the 30th International
Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2016:689-699.
doi:10.1109/IPDPS.2016.51'
apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der
Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In Proceedings
of the 30th International Parallel and Distributed Processing Symposium (IPDPS)
(pp. 689–699). IEEE. https://doi.org/10.1109/IPDPS.2016.51
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016,
title={Gathering a Closed Chain of Robots on a Grid}, DOI={10.1109/IPDPS.2016.51},
booktitle={Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr,
Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
year={2016}, pages={689–699} }'
chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung,
and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.”
In Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS), 689–99. IEEE, 2016. https://doi.org/10.1109/IPDPS.2016.51.
ieee: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide,
“Gathering a Closed Chain of Robots on a Grid,” in Proceedings of the 30th
International Parallel and Distributed Processing Symposium (IPDPS), 2016,
pp. 689–699.
mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”
Proceedings of the 30th International Parallel and Distributed Processing Symposium
(IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.
short: 'S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide,
in: Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS), IEEE, 2016, pp. 689–699.'
date_created: 2020-04-01T12:56:43Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1109/IPDPS.2016.51
language:
- iso: eng
page: 689-699
publication: Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Gathering a Closed Chain of Robots on a Grid
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16364'
author:
- first_name: Alexander
full_name: Macker, Alexander
last_name: Macker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Macker A, Malatyali M, Meyer auf der Heide F. On Competitive Algorithms for
Approximations of Top-k-Position Monitoring of Distributed Streams. In: 2016
IEEE International Parallel and Distributed Processing Symposium (IPDPS).
; 2016. doi:10.1109/ipdps.2016.91'
apa: Macker, A., Malatyali, M., & Meyer auf der Heide, F. (2016). On Competitive
Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.
In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).
https://doi.org/10.1109/ipdps.2016.91
bibtex: '@inproceedings{Macker_Malatyali_Meyer auf der Heide_2016, title={On Competitive
Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams},
DOI={10.1109/ipdps.2016.91},
booktitle={2016 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)}, author={Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide,
Friedhelm}, year={2016} }'
chicago: Macker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide.
“On Competitive Algorithms for Approximations of Top-k-Position Monitoring of
Distributed Streams.” In 2016 IEEE International Parallel and Distributed Processing
Symposium (IPDPS), 2016. https://doi.org/10.1109/ipdps.2016.91.
ieee: A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms
for Approximations of Top-k-Position Monitoring of Distributed Streams,” in 2016
IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2016.
mla: Macker, Alexander, et al. “On Competitive Algorithms for Approximations of
Top-k-Position Monitoring of Distributed Streams.” 2016 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91.
short: 'A. Macker, M. Malatyali, F. Meyer auf der Heide, in: 2016 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2016.'
date_created: 2020-04-02T10:14:25Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1109/ipdps.2016.91
language:
- iso: eng
publication: 2016 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)
publication_identifier:
isbn:
- '9781509021406'
publication_status: published
status: public
title: On Competitive Algorithms for Approximations of Top-k-Position Monitoring of
Distributed Streams
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16396'
abstract:
- lang: eng
text: "We consider a scheduling problem where machines need to be rented from the\r\ncloud
in order to process jobs. There are two types of machines available which\r\ncan
be rented for machine-type dependent prices and for arbitrary durations.\r\nHowever,
a machine-type dependent setup time is required before a machine is\r\navailable
for processing. Jobs arrive online over time, have machine-type\r\ndependent sizes
and have individual deadlines. The objective is to rent\r\nmachines and schedule
jobs so as to meet all deadlines while minimizing the\r\nrental cost.\r\n Since
we observe the slack of jobs to have a fundamental influence on the\r\ncompetitiveness,
we study the model when instances are parameterized by their\r\n(minimum) slack.
An instance is called to have a slack of $\\beta$ if, for all\r\njobs, the difference
between the job's release time and the latest point in\r\ntime at which it needs
to be started is at least $\\beta$. While for $\\beta < s$\r\nno finite competitiveness
is possible, our main result is an\r\n$O(\\frac{c}{\\varepsilon} + \\frac{1}{\\varepsilon^3})$-competitive
online\r\nalgorithm for $\\beta = (1+\\varepsilon)s$ with $\\frac{1}{s} \\leq
\\varepsilon\r\n\\leq 1$, where $s$ and $c$ denotes the largest setup time and
the cost ratio of\r\nthe machine-types, respectively. It is complemented by a
lower bound of\r\n$\\Omega(\\frac{c}{\\varepsilon})$."
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling
on Machines from the Cloud. arXiv:160901184. 2016.
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016).
Cost-efficient Scheduling on Machines from the Cloud. ArXiv:1609.01184.
bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient
Scheduling on Machines from the Cloud}, journal={arXiv:1609.01184}, author={Mäcker,
Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers,
Sören}, year={2016} }'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184,
2016.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” arXiv:1609.01184. 2016.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
ArXiv:1609.01184, 2016.
short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, ArXiv:1609.01184
(2016).
date_created: 2020-04-03T09:24:28Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1609.01184'
language:
- iso: eng
publication: arXiv:1609.01184
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: preprint
user_id: '15415'
year: '2016'
...
---
_id: '139'
abstract:
- lang: eng
text: 'We consider online optimization problems in which certain goods have to be
acquired in order to provide a service or infrastructure. Classically, decisions
for such problems are considered as final: one buys the goods. However, in many
real world applications, there is a shift away from the idea of buying goods.
Instead, leasing is often a more flexible and lucrative business model. Research
has realized this shift and recently initiated the theoretical study of leasing
models (Anthony and Gupta in Proceedings of the integer programming and combinatorial
optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27,
2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations
of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan
and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work
and suggest a more systematic study of leasing aspects for a class of online optimization
problems. We provide two major technical results. We introduce the leasing variant
of online set multicover and give an O(log(mK)logn)-competitive algorithm (with
n, m, and K being the number of elements, sets, and leases, respectively). Our
results also imply improvements for the non-leasing variant of online set cover.
Moreover, we extend results for the leasing variant of online facility location.
Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive
algorithm for this problem (with n and K being the number of clients and leases,
respectively). We remove the dependency on n (and, thereby, on time). In general,
this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax).
For many natural problem instances, the bound improves to O(K2).'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: 'Peter '
full_name: 'Pietrzyk, Peter '
last_name: Pietrzyk
citation:
ama: Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards
the price of leasing online. Journal of Combinatorial Optimization. 2016;(4):1197--1216.
doi:10.1007/s10878-015-9915-5
apa: Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk,
P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization,
(4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5
bibtex: '@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards
the price of leasing online}, DOI={10.1007/s10878-015-9915-5},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer
auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216}
}'
chicago: 'Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer
auf der Heide, and Peter Pietrzyk. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4 (2016): 1197--1216. https://doi.org/10.1007/s10878-015-9915-5.'
ieee: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk,
“Towards the price of leasing online,” Journal of Combinatorial Optimization,
no. 4, pp. 1197--1216, 2016.
mla: Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
short: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk,
Journal of Combinatorial Optimization (2016) 1197--1216.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-015-9915-5
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:57:25Z
date_updated: 2018-11-02T15:57:25Z
file_id: '5318'
file_name: Abshoff-TowardsThePriceOfLeasingOnline.pdf
file_size: 654903
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:57:25Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: ' 1197--1216'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Towards the price of leasing online
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '143'
abstract:
- lang: eng
text: 'We present an efficient parallel algorithm for the general Monotone Circuit
Value Problem (MCVP) with n gates and an underlying graph of bounded genus k.
Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP
with toroidal embedding (genus 1) is in NC when the input contains a toroidal
embedding of the circuit. In addition to extending this result from genus 1 to
any bounded genus k, and unlike the work reported by Limaye et al., we do not
require a precomputed embedding to be given. Most importantly, our results imply
that given a P-complete problem, it is possible to find an algorithm that makes
the problem fall into NC by fixing one or more parameters. Hence, we deduce the
interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete
what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work
that uses treewidth as parameter was also presented by Elberfeld et al. in [6].'
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone
Circuit Value Problem with Bounded Genus Is in NC. In: Proceedings of the 22nd
International Conference on Computing and Combinatorics (COCOON). LNCS. ;
2016:92-102. doi:10.1007/978-3-319-42634-1_8'
apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In
Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON) (pp. 92–102). https://doi.org/10.1007/978-3-319-42634-1_8
bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016,
series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is
in NC}, DOI={10.1007/978-3-319-42634-1_8},
booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102},
collection={LNCS} }'
chicago: Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded
Genus Is in NC.” In Proceedings of the 22nd International Conference on Computing
and Combinatorics (COCOON), 92–102. LNCS, 2016. https://doi.org/10.1007/978-3-319-42634-1_8.
ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings
of the 22nd International Conference on Computing and Combinatorics (COCOON),
2016, pp. 92–102.
mla: Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded
Genus Is in NC.” Proceedings of the 22nd International Conference on Computing
and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.
short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
in: Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON), 2016, pp. 92–102.'
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:57Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-42634-1_8
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:20:45Z
date_updated: 2018-11-02T14:20:45Z
file_id: '5269'
file_name: TheMonotoneCircuitValueProblem.pdf
file_size: 234587
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:20:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 92-102
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON)
series_title: LNCS
status: public
title: The Monotone Circuit Value Problem with Bounded Genus Is in NC
type: conference
user_id: '477'
year: '2016'
...
---
_id: '145'
abstract:
- lang: eng
text: 'Comparative evaluations of peer-to-peer protocols through simulations are
a viable approach to judge the performance and costs of the individual protocols
in large-scale networks. In order to support this work, we present the peer-to-peer
system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM
comes with an extensive layer model to support various facets and protocols of
peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show
how it can be used for detailed measurements of large-scale peer-to-peer networks.
We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive
automated measurements and gnuplot generators as well as a coordination control
to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments
and protocols only once and starting the simulator, all desired measurements are
performed, analyzed, evaluated, and combined, resulting in a holistic environment
for the comparative evaluation of peer-to-peer systems. An immediate comparison
of different configurations and overlays under different aspects is possible directly
after the execution without any manual post-processing. '
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using
PeerfactSim.KOM. Concurrency and Computation: Practice and Experience.
2016;28(5):1655-1677. doi:10.1002/cpe.3716'
apa: 'Feldotto, M., & Graffi, K. (2016). Systematic evaluation of peer-to-peer
systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience,
28(5), 1655–1677. https://doi.org/10.1002/cpe.3716'
bibtex: '@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer
systems using PeerfactSim.KOM}, volume={28}, DOI={10.1002/cpe.3716},
number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley
Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016},
pages={1655–1677} }'
chicago: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience
28, no. 5 (2016): 1655–77. https://doi.org/10.1002/cpe.3716.'
ieee: 'M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems
using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience,
vol. 28, no. 5, pp. 1655–1677, 2016.'
mla: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience,
vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.'
short: 'M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience
28 (2016) 1655–1677.'
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:52:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1002/cpe.3716
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:57:57Z
date_updated: 2018-03-21T12:57:57Z
file_id: '1556'
file_name: 145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf
file_size: 3121363
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:57:57Z
has_accepted_license: '1'
intvolume: ' 28'
issue: '5'
page: 1655-1677
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: 'Concurrency and Computation: Practice and Experience'
publication_status: published
publisher: Wiley Online Library
status: public
title: Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM
type: journal_article
user_id: '14052'
volume: 28
year: '2016'
...
---
_id: '251'
author:
- first_name: Karlson
full_name: Pfannschmidt, Karlson
last_name: Pfannschmidt
citation:
ama: Pfannschmidt K. Solving the Aggregated Bandits Problem. Universität
Paderborn; 2015.
apa: Pfannschmidt, K. (2015). Solving the aggregated bandits problem. Universität
Paderborn.
bibtex: '@book{Pfannschmidt_2015, title={Solving the aggregated bandits problem},
publisher={Universität Paderborn}, author={Pfannschmidt, Karlson}, year={2015}
}'
chicago: Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität
Paderborn, 2015.
ieee: K. Pfannschmidt, Solving the aggregated bandits problem. Universität
Paderborn, 2015.
mla: Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität
Paderborn, 2015.
short: K. Pfannschmidt, Solving the Aggregated Bandits Problem, Universität Paderborn,
2015.
date_created: 2017-10-17T12:41:41Z
date_updated: 2022-01-06T06:56:50Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Solving the aggregated bandits problem
type: mastersthesis
user_id: '14052'
year: '2015'
...
---
_id: '19959'
author:
- first_name: Mostafa
full_name: Wahby, Mostafa
last_name: Wahby
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Wahby M, Hamann H. On the Tradeoff between Hardware Protection and Optimization
Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel
Parking. In: Applications of Evolutionary Computation (EvoApplications 2015).
; 2015. doi:10.1007/978-3-319-16549-3_61'
apa: 'Wahby, M., & Hamann, H. (2015). On the Tradeoff between Hardware Protection
and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous
Parallel Parking. In Applications of Evolutionary Computation (EvoApplications
2015). https://doi.org/10.1007/978-3-319-16549-3_61'
bibtex: '@inproceedings{Wahby_Hamann_2015, title={On the Tradeoff between Hardware
Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics
for Autonomous Parallel Parking}, DOI={10.1007/978-3-319-16549-3_61},
booktitle={Applications of Evolutionary Computation (EvoApplications 2015)}, author={Wahby,
Mostafa and Hamann, Heiko}, year={2015} }'
chicago: 'Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection
and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous
Parallel Parking.” In Applications of Evolutionary Computation (EvoApplications
2015), 2015. https://doi.org/10.1007/978-3-319-16549-3_61.'
ieee: 'M. Wahby and H. Hamann, “On the Tradeoff between Hardware Protection and
Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous
Parallel Parking,” in Applications of Evolutionary Computation (EvoApplications
2015), 2015.'
mla: 'Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection
and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous
Parallel Parking.” Applications of Evolutionary Computation (EvoApplications
2015), 2015, doi:10.1007/978-3-319-16549-3_61.'
short: 'M. Wahby, H. Hamann, in: Applications of Evolutionary Computation (EvoApplications
2015), 2015.'
date_created: 2020-10-08T12:36:48Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-16549-3_61
language:
- iso: eng
publication: Applications of Evolutionary Computation (EvoApplications 2015)
status: public
title: 'On the Tradeoff between Hardware Protection and Optimization Success: A Case
Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19960'
abstract:
- lang: eng
text: Besides the life-as-it-could-be driver of artificial life research there is
also the concept of extending natural life by creating hybrids or mixed societies
that are built from natural and artificial components. In this paper we motivate
and present the research program of the project flora robotica. Our objective
is to develop and to investigate closely linked symbiotic relationships between
robots and natural plants and to explore the potentials of a plant-robot society
able to produce architectural artifacts and living spaces. These robot-plant bio-hybrids
create synergies that allow for new functions of plants and robots. They also
create novel design opportunities for an architecture that fuses the design and
construction phase. The bio-hybrid is an example of mixed societies between 'hard'
artificial and 'wet' natural life, which enables an interaction between natural
and artificial ecologies. They form an embodied, self-organizing, and distributed
cognitive system which is supposed to grow and develop over long periods of time
resulting in the creation of meaningful architectural structures. A key idea is
to assign equal roles to robots and plants in order to create a highly integrated,
symbiotic system. Besides the gain of knowledge, this project has the objective
to create a bio-hybrid system with a defined function and application -- growing
architectural artifacts.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Mostafa
full_name: Wahby, Mostafa
last_name: Wahby
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Payam
full_name: Zahadat, Payam
last_name: Zahadat
- first_name: Daniel
full_name: Hofstadler, Daniel
last_name: Hofstadler
- first_name: Kasper
full_name: Stoy, Kasper
last_name: Stoy
- first_name: Sebastian
full_name: Risi, Sebastian
last_name: Risi
- first_name: Andres
full_name: Faina, Andres
last_name: Faina
- first_name: Frank
full_name: Veenstra, Frank
last_name: Veenstra
- first_name: Serge
full_name: Kernbach, Serge
last_name: Kernbach
- first_name: Igor
full_name: Kuksin, Igor
last_name: Kuksin
- first_name: Olga
full_name: Kernbach, Olga
last_name: Kernbach
- first_name: Phil
full_name: Ayres, Phil
last_name: Ayres
- first_name: Przemyslaw
full_name: Wojtaszek, Przemyslaw
last_name: Wojtaszek
citation:
ama: 'Hamann H, Wahby M, Schmickl T, et al. Flora Robotica - Mixed Societies of
Symbiotic Robot-Plant Bio-Hybrids. In: Proceedings of the 2015 IEEE Symposium
on Artificial Life (IEEE ALIFE’15). ; 2015. doi:10.1109/ssci.2015.158'
apa: Hamann, H., Wahby, M., Schmickl, T., Zahadat, P., Hofstadler, D., Stoy, K.,
… Wojtaszek, P. (2015). Flora Robotica - Mixed Societies of Symbiotic Robot-Plant
Bio-Hybrids. In Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE
ALIFE’15). https://doi.org/10.1109/ssci.2015.158
bibtex: '@inproceedings{Hamann_Wahby_Schmickl_Zahadat_Hofstadler_Stoy_Risi_Faina_Veenstra_Kernbach_et
al._2015, title={Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids},
DOI={10.1109/ssci.2015.158},
booktitle={Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15)},
author={Hamann, Heiko and Wahby, Mostafa and Schmickl, Thomas and Zahadat, Payam
and Hofstadler, Daniel and Stoy, Kasper and Risi, Sebastian and Faina, Andres
and Veenstra, Frank and Kernbach, Serge and et al.}, year={2015} }'
chicago: Hamann, Heiko, Mostafa Wahby, Thomas Schmickl, Payam Zahadat, Daniel Hofstadler,
Kasper Stoy, Sebastian Risi, et al. “Flora Robotica - Mixed Societies of Symbiotic
Robot-Plant Bio-Hybrids.” In Proceedings of the 2015 IEEE Symposium on Artificial
Life (IEEE ALIFE’15), 2015. https://doi.org/10.1109/ssci.2015.158.
ieee: H. Hamann et al., “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant
Bio-Hybrids,” in Proceedings of the 2015 IEEE Symposium on Artificial Life
(IEEE ALIFE’15), 2015.
mla: Hamann, Heiko, et al. “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant
Bio-Hybrids.” Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE
ALIFE’15), 2015, doi:10.1109/ssci.2015.158.
short: 'H. Hamann, M. Wahby, T. Schmickl, P. Zahadat, D. Hofstadler, K. Stoy, S.
Risi, A. Faina, F. Veenstra, S. Kernbach, I. Kuksin, O. Kernbach, P. Ayres, P.
Wojtaszek, in: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE
ALIFE’15), 2015.'
date_created: 2020-10-08T12:44:10Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/ssci.2015.158
language:
- iso: eng
publication: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE'15)
publication_identifier:
isbn:
- '9781479975600'
publication_status: published
status: public
title: Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19962'
abstract:
- lang: eng
text: Recent approaches in evolutionary robotics (ER) propose to generate behavioral
diversity in order to evolve desired behaviors more easily. These approaches require
the definition of a behavioral distance, which often includes task-specific features
and hence a priori knowledge. Alternative methods, which do not explicitly force
selective pressure towards diversity (SPTD) but still generate it, are known from
the field of artificial life, such as in artificial ecologies (AEs). In this study,
we investigate how SPTD is generated without task-specific behavioral features
or other forms of a priori knowledge and detect how methods of generating SPTD
can be transferred from the domain of AE to ER. A promising finding is that in
both types of systems, in systems from ER that generate behavioral diversity and
also in the investigated speciation model, selective pressure is generated towards
unpopulated regions of search space. In a simple case study we investigate the
practical implications of these findings and point to options for transferring
the idea of self-organizing SPTD in AEs to the domain of ER.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Hamann H. Lessons from Speciation Dynamics: How to Generate Selective Pressure
Towards Diversity. Artificial Life. 2015:464-480. doi:10.1162/artl_a_00186'
apa: 'Hamann, H. (2015). Lessons from Speciation Dynamics: How to Generate Selective
Pressure Towards Diversity. Artificial Life, 464–480. https://doi.org/10.1162/artl_a_00186'
bibtex: '@article{Hamann_2015, title={Lessons from Speciation Dynamics: How to Generate
Selective Pressure Towards Diversity}, DOI={10.1162/artl_a_00186},
journal={Artificial Life}, author={Hamann, Heiko}, year={2015}, pages={464–480}
}'
chicago: 'Hamann, Heiko. “Lessons from Speciation Dynamics: How to Generate Selective
Pressure Towards Diversity.” Artificial Life, 2015, 464–80. https://doi.org/10.1162/artl_a_00186.'
ieee: 'H. Hamann, “Lessons from Speciation Dynamics: How to Generate Selective Pressure
Towards Diversity,” Artificial Life, pp. 464–480, 2015.'
mla: 'Hamann, Heiko. “Lessons from Speciation Dynamics: How to Generate Selective
Pressure Towards Diversity.” Artificial Life, 2015, pp. 464–80, doi:10.1162/artl_a_00186.'
short: H. Hamann, Artificial Life (2015) 464–480.
date_created: 2020-10-08T14:36:25Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1162/artl_a_00186
language:
- iso: eng
page: 464-480
publication: Artificial Life
publication_identifier:
issn:
- 1064-5462
- 1530-9185
publication_status: published
status: public
title: 'Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards
Diversity'
type: journal_article
user_id: '15415'
year: '2015'
...
---
_id: '19966'
abstract:
- lang: eng
text: Aggregation is a crucial task in swarm robotics to ensure cooperation. We
investigate the task of aggregation on an area specified indirectly by certain
environmental features, here it is a light distribution. We extend the original
BEECLUST algorithm, that implements an aggregation behavior, to an adaptive variant
that automatically adapts to any light conditions. We compare these two control
algorithms in a number of swarm robot experiments with different light conditions.
The improved, adaptive variant is found to be significantly better in the tested
setup.
author:
- first_name: Mostafa
full_name: Wahby, Mostafa
last_name: Wahby
- first_name: Alexander
full_name: Weinhold, Alexander
last_name: Weinhold
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Wahby M, Weinhold A, Hamann H. Revisiting BEECLUST: Aggregation of Swarm Robots
with Adaptiveness to Different Light Settings. In: Proceedings of the 9th EAI
International Conference on Bio-Inspired Information and Communications Technologies
(Formerly BIONETICS). ; 2015. doi:10.4108/eai.3-12-2015.2262877'
apa: 'Wahby, M., Weinhold, A., & Hamann, H. (2015). Revisiting BEECLUST: Aggregation
of Swarm Robots with Adaptiveness to Different Light Settings. In Proceedings
of the 9th EAI International Conference on Bio-inspired Information and Communications
Technologies (formerly BIONETICS). https://doi.org/10.4108/eai.3-12-2015.2262877'
bibtex: '@inproceedings{Wahby_Weinhold_Hamann_2015, title={Revisiting BEECLUST:
Aggregation of Swarm Robots with Adaptiveness to Different Light Settings}, DOI={10.4108/eai.3-12-2015.2262877},
booktitle={Proceedings of the 9th EAI International Conference on Bio-inspired
Information and Communications Technologies (formerly BIONETICS)}, author={Wahby,
Mostafa and Weinhold, Alexander and Hamann, Heiko}, year={2015} }'
chicago: 'Wahby, Mostafa, Alexander Weinhold, and Heiko Hamann. “Revisiting BEECLUST:
Aggregation of Swarm Robots with Adaptiveness to Different Light Settings.” In
Proceedings of the 9th EAI International Conference on Bio-Inspired Information
and Communications Technologies (Formerly BIONETICS), 2015. https://doi.org/10.4108/eai.3-12-2015.2262877.'
ieee: 'M. Wahby, A. Weinhold, and H. Hamann, “Revisiting BEECLUST: Aggregation of
Swarm Robots with Adaptiveness to Different Light Settings,” in Proceedings
of the 9th EAI International Conference on Bio-inspired Information and Communications
Technologies (formerly BIONETICS), 2015.'
mla: 'Wahby, Mostafa, et al. “Revisiting BEECLUST: Aggregation of Swarm Robots with
Adaptiveness to Different Light Settings.” Proceedings of the 9th EAI International
Conference on Bio-Inspired Information and Communications Technologies (Formerly
BIONETICS), 2015, doi:10.4108/eai.3-12-2015.2262877.'
short: 'M. Wahby, A. Weinhold, H. Hamann, in: Proceedings of the 9th EAI International
Conference on Bio-Inspired Information and Communications Technologies (Formerly
BIONETICS), 2015.'
date_created: 2020-10-09T13:41:56Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.4108/eai.3-12-2015.2262877
language:
- iso: eng
publication: Proceedings of the 9th EAI International Conference on Bio-inspired Information
and Communications Technologies (formerly BIONETICS)
publication_identifier:
isbn:
- '9781631901003'
publication_status: published
status: public
title: 'Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different
Light Settings'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19967'
author:
- first_name: Mostafa
full_name: Wahby, Mostafa
last_name: Wahby
- first_name: Mohammad
full_name: Divband Soorati, Mohammad
last_name: Divband Soorati
- first_name: Sebastian
full_name: von Mammen, Sebastian
last_name: von Mammen
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Wahby M, Divband Soorati M, von Mammen S, Hamann H. Evolution of Controllers
for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth
and Motion. In: Proceedings. 25. Computational Intelligence Workshop. ;
2015.'
apa: 'Wahby, M., Divband Soorati, M., von Mammen, S., & Hamann, H. (2015). Evolution
of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model
of Plant Growth and Motion. In Proceedings. 25. Computational Intelligence
Workshop.'
bibtex: '@inproceedings{Wahby_Divband Soorati_von Mammen_Hamann_2015, title={Evolution
of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model
of Plant Growth and Motion}, booktitle={Proceedings. 25. Computational Intelligence
Workshop}, author={Wahby, Mostafa and Divband Soorati, Mohammad and von Mammen,
Sebastian and Hamann, Heiko}, year={2015} }'
chicago: 'Wahby, Mostafa, Mohammad Divband Soorati, Sebastian von Mammen, and Heiko
Hamann. “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case
Study Using a Model of Plant Growth and Motion.” In Proceedings. 25. Computational
Intelligence Workshop, 2015.'
ieee: 'M. Wahby, M. Divband Soorati, S. von Mammen, and H. Hamann, “Evolution of
Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of
Plant Growth and Motion,” in Proceedings. 25. Computational Intelligence Workshop,
2015.'
mla: 'Wahby, Mostafa, et al. “Evolution of Controllers for Robot-Plant Bio-Hybdrids:
A Simple Case Study Using a Model of Plant Growth and Motion.” Proceedings.
25. Computational Intelligence Workshop, 2015.'
short: 'M. Wahby, M. Divband Soorati, S. von Mammen, H. Hamann, in: Proceedings.
25. Computational Intelligence Workshop, 2015.'
date_created: 2020-10-09T13:50:38Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: Proceedings. 25. Computational Intelligence Workshop
status: public
title: 'Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study
Using a Model of Plant Growth and Motion'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19980'
abstract:
- lang: eng
text: Fitness function design is known to be a critical feature of the evolutionary-robotics
approach. Potentially, the complexity of evolving a successful controller for
a given task can be reduced by integrating a priori knowledge into the fitness
function which complicates the comparability of studies in evolutionary robotics.
Still, there are only few publications that study the actual effects of different
fitness functions on the robot's performance. In this paper, we follow the fitness
function classification of Nelson et al. (2009) and investigate a selection of
four classes of fitness functions that require different degrees of a priori knowledge.
The robot controllers are evolved in simulation using NEAT and we investigate
different tasks including obstacle avoidance and (periodic) goal homing. The best
evolved controllers were then post-evaluated by examining their potential for
adaptation, determining their convergence rates, and using cross-comparisons based
on the different fitness function classes. The results confirm that the integration
of more a priori knowledge can simplify a task and show that more attention should
be paid to fitness function classes when comparing different studies.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Mohammad
full_name: Divband Soorati, Mohammad
last_name: Divband Soorati
citation:
ama: 'Hamann H, Divband Soorati M. The Effect of Fitness Function Design on Performance
in Evolutionary Robotics: The Influence of a Priori Knowledge. In: Proceedings
of the Genetic and Evolutionary Computation Conference (GECCO 2015). ACM;
2015:153-160. doi:10.1145/2739480.2754676'
apa: 'Hamann, H., & Divband Soorati, M. (2015). The Effect of Fitness Function
Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.
In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
2015) (pp. 153–160). ACM. https://doi.org/10.1145/2739480.2754676'
bibtex: '@inproceedings{Hamann_Divband Soorati_2015, title={The Effect of Fitness
Function Design on Performance in Evolutionary Robotics: The Influence of a Priori
Knowledge}, DOI={10.1145/2739480.2754676},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO 2015)}, publisher={ACM}, author={Hamann, Heiko and Divband Soorati, Mohammad},
year={2015}, pages={153–160} }'
chicago: 'Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function
Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.”
In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
2015), 153–60. ACM, 2015. https://doi.org/10.1145/2739480.2754676.'
ieee: 'H. Hamann and M. Divband Soorati, “The Effect of Fitness Function Design
on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge,”
in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
2015), 2015, pp. 153–160.'
mla: 'Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function
Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.”
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015),
ACM, 2015, pp. 153–60, doi:10.1145/2739480.2754676.'
short: 'H. Hamann, M. Divband Soorati, in: Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO 2015), ACM, 2015, pp. 153–160.'
date_created: 2020-10-12T13:12:25Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1145/2739480.2754676
language:
- iso: eng
page: 153-160
publication: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
2015)
publisher: ACM
status: public
title: 'The Effect of Fitness Function Design on Performance in Evolutionary Robotics:
The Influence of a Priori Knowledge'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19988'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Payam
full_name: Zahadat, Payam
last_name: Zahadat
citation:
ama: 'Hamann H, Schmickl T, Zahadat P. Evolving Collective Behaviors With Diverse
But Predictable Sensor States. In: 13th European Conference on Artificial Life
(ECAL 2015). MIT Press; 2015:174. doi:10.7551/978-0-262-33027-5-ch036'
apa: Hamann, H., Schmickl, T., & Zahadat, P. (2015). Evolving Collective Behaviors
With Diverse But Predictable Sensor States. In 13th European Conference on
Artificial Life (ECAL 2015) (p. 174). MIT Press. https://doi.org/10.7551/978-0-262-33027-5-ch036
bibtex: '@inproceedings{Hamann_Schmickl_Zahadat_2015, title={Evolving Collective
Behaviors With Diverse But Predictable Sensor States}, DOI={10.7551/978-0-262-33027-5-ch036},
booktitle={13th European Conference on Artificial Life (ECAL 2015)}, publisher={MIT
Press}, author={Hamann, Heiko and Schmickl, Thomas and Zahadat, Payam}, year={2015},
pages={174} }'
chicago: Hamann, Heiko, Thomas Schmickl, and Payam Zahadat. “Evolving Collective
Behaviors With Diverse But Predictable Sensor States.” In 13th European Conference
on Artificial Life (ECAL 2015), 174. MIT Press, 2015. https://doi.org/10.7551/978-0-262-33027-5-ch036.
ieee: H. Hamann, T. Schmickl, and P. Zahadat, “Evolving Collective Behaviors With
Diverse But Predictable Sensor States,” in 13th European Conference on Artificial
Life (ECAL 2015), 2015, p. 174.
mla: Hamann, Heiko, et al. “Evolving Collective Behaviors With Diverse But Predictable
Sensor States.” 13th European Conference on Artificial Life (ECAL 2015),
MIT Press, 2015, p. 174, doi:10.7551/978-0-262-33027-5-ch036.
short: 'H. Hamann, T. Schmickl, P. Zahadat, in: 13th European Conference on Artificial
Life (ECAL 2015), MIT Press, 2015, p. 174.'
date_created: 2020-10-13T08:50:38Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.7551/978-0-262-33027-5-ch036
language:
- iso: eng
page: '174'
publication: 13th European Conference on Artificial Life (ECAL 2015)
publisher: MIT Press
status: public
title: Evolving Collective Behaviors With Diverse But Predictable Sensor States
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19989'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Nikolaus
full_name: Correll, Nikolaus
last_name: Correll
- first_name: Janusz
full_name: Kacprzyk, Janusz
last_name: Kacprzyk
- first_name: Witold
full_name: Pedrycz, Witold
last_name: Pedrycz
citation:
ama: 'Hamann H, Correll N, Kacprzyk J, Pedrycz W. Probabilistic Modeling of Swarming
Systems. In: Springer Handbook of Computational Intelligence. Springer;
2015:1423-1431. doi:10.1007/978-3-662-43505-2_74'
apa: Hamann, H., Correll, N., Kacprzyk, J., & Pedrycz, W. (2015). Probabilistic
Modeling of Swarming Systems. In Springer Handbook of Computational Intelligence
(pp. 1423–1431). Springer. https://doi.org/10.1007/978-3-662-43505-2_74
bibtex: '@inbook{Hamann_Correll_Kacprzyk_Pedrycz_2015, title={Probabilistic Modeling
of Swarming Systems}, DOI={10.1007/978-3-662-43505-2_74},
booktitle={Springer Handbook of Computational Intelligence}, publisher={Springer},
author={Hamann, Heiko and Correll, Nikolaus and Kacprzyk, Janusz and Pedrycz,
Witold}, year={2015}, pages={1423–1431} }'
chicago: Hamann, Heiko, Nikolaus Correll, Janusz Kacprzyk, and Witold Pedrycz. “Probabilistic
Modeling of Swarming Systems.” In Springer Handbook of Computational Intelligence,
1423–31. Springer, 2015. https://doi.org/10.1007/978-3-662-43505-2_74.
ieee: H. Hamann, N. Correll, J. Kacprzyk, and W. Pedrycz, “Probabilistic Modeling
of Swarming Systems,” in Springer Handbook of Computational Intelligence,
Springer, 2015, pp. 1423–1431.
mla: Hamann, Heiko, et al. “Probabilistic Modeling of Swarming Systems.” Springer
Handbook of Computational Intelligence, Springer, 2015, pp. 1423–31, doi:10.1007/978-3-662-43505-2_74.
short: 'H. Hamann, N. Correll, J. Kacprzyk, W. Pedrycz, in: Springer Handbook of
Computational Intelligence, Springer, 2015, pp. 1423–1431.'
date_created: 2020-10-13T09:04:19Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-662-43505-2_74
language:
- iso: eng
page: 1423-1431
publication: Springer Handbook of Computational Intelligence
publisher: Springer
status: public
title: Probabilistic Modeling of Swarming Systems
type: book_chapter
user_id: '15415'
year: '2015'
...
---
_id: '19990'
author:
- first_name: Hongli
full_name: Ding, Hongli
last_name: Ding
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Ding H, Hamann H. Dependability in Swarm Robotics: Error Detection and Correction.
In: First International Symposium on Swarm Behavior and Bio-Inspired Robotics
(SWARM 2015). ; 2015.'
apa: 'Ding, H., & Hamann, H. (2015). Dependability in Swarm Robotics: Error
Detection and Correction. In First International Symposium on Swarm Behavior
and Bio-Inspired Robotics (SWARM 2015).'
bibtex: '@inproceedings{Ding_Hamann_2015, title={Dependability in Swarm Robotics:
Error Detection and Correction}, booktitle={First International Symposium on Swarm
Behavior and Bio-Inspired Robotics (SWARM 2015)}, author={Ding, Hongli and Hamann,
Heiko}, year={2015} }'
chicago: 'Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error
Detection and Correction.” In First International Symposium on Swarm Behavior
and Bio-Inspired Robotics (SWARM 2015), 2015.'
ieee: 'H. Ding and H. Hamann, “Dependability in Swarm Robotics: Error Detection
and Correction,” in First International Symposium on Swarm Behavior and Bio-Inspired
Robotics (SWARM 2015), 2015.'
mla: 'Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error Detection
and Correction.” First International Symposium on Swarm Behavior and Bio-Inspired
Robotics (SWARM 2015), 2015.'
short: 'H. Ding, H. Hamann, in: First International Symposium on Swarm Behavior
and Bio-Inspired Robotics (SWARM 2015), 2015.'
date_created: 2020-10-13T09:09:20Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: First International Symposium on Swarm Behavior and Bio-Inspired Robotics
(SWARM 2015)
status: public
title: 'Dependability in Swarm Robotics: Error Detection and Correction'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19991'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Daniela
full_name: Kengyel, Daniela
last_name: Kengyel
- first_name: Payam
full_name: Zahadat, Payam
last_name: Zahadat
- first_name: Gerald
full_name: Radspieler, Gerald
last_name: Radspieler
- first_name: Franz
full_name: Wotawa, Franz
last_name: Wotawa
citation:
ama: 'Hamann H, Schmickl T, Kengyel D, Zahadat P, Radspieler G, Wotawa F. Potential
of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms.
In: Principles and Practice of Multi-Agent Systems (PRIMA 2015). ; 2015:201-217.'
apa: 'Hamann, H., Schmickl, T., Kengyel, D., Zahadat, P., Radspieler, G., &
Wotawa, F. (2015). Potential of Heterogeneity in Collective Behaviors: A Case
Study on Heterogeneous Swarms. In Principles and Practice of Multi-Agent Systems
(PRIMA 2015) (pp. 201–217).'
bibtex: '@inproceedings{Hamann_Schmickl_Kengyel_Zahadat_Radspieler_Wotawa_2015,
title={Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous
Swarms}, booktitle={Principles and Practice of Multi-Agent Systems (PRIMA 2015)},
author={Hamann, Heiko and Schmickl, Thomas and Kengyel, Daniela and Zahadat, Payam
and Radspieler, Gerald and Wotawa, Franz}, year={2015}, pages={201–217} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, Daniela Kengyel, Payam Zahadat, Gerald
Radspieler, and Franz Wotawa. “Potential of Heterogeneity in Collective Behaviors:
A Case Study on Heterogeneous Swarms.” In Principles and Practice of Multi-Agent
Systems (PRIMA 2015), 201–17, 2015.'
ieee: 'H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, and F. Wotawa,
“Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous
Swarms,” in Principles and Practice of Multi-Agent Systems (PRIMA 2015),
2015, pp. 201–217.'
mla: 'Hamann, Heiko, et al. “Potential of Heterogeneity in Collective Behaviors:
A Case Study on Heterogeneous Swarms.” Principles and Practice of Multi-Agent
Systems (PRIMA 2015), 2015, pp. 201–17.'
short: 'H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, F. Wotawa,
in: Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–217.'
date_created: 2020-10-13T09:24:32Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 201-217
publication: Principles and Practice of Multi-Agent Systems (PRIMA 2015)
status: public
title: 'Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous
Swarms'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19992'
author:
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Valentini G, Hamann H. Time-variant feedback processes in collective decision-making
systems: influence and effect of dynamic neighborhood sizes. Swarm Intelligence.
2015:153-176. doi:10.1007/s11721-015-0108-8'
apa: 'Valentini, G., & Hamann, H. (2015). Time-variant feedback processes in
collective decision-making systems: influence and effect of dynamic neighborhood
sizes. Swarm Intelligence, 153–176. https://doi.org/10.1007/s11721-015-0108-8'
bibtex: '@article{Valentini_Hamann_2015, title={Time-variant feedback processes
in collective decision-making systems: influence and effect of dynamic neighborhood
sizes}, DOI={10.1007/s11721-015-0108-8},
journal={Swarm Intelligence}, author={Valentini, Gabriele and Hamann, Heiko},
year={2015}, pages={153–176} }'
chicago: 'Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes
in Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood
Sizes.” Swarm Intelligence, 2015, 153–76. https://doi.org/10.1007/s11721-015-0108-8.'
ieee: 'G. Valentini and H. Hamann, “Time-variant feedback processes in collective
decision-making systems: influence and effect of dynamic neighborhood sizes,”
Swarm Intelligence, pp. 153–176, 2015.'
mla: 'Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes in
Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood
Sizes.” Swarm Intelligence, 2015, pp. 153–76, doi:10.1007/s11721-015-0108-8.'
short: G. Valentini, H. Hamann, Swarm Intelligence (2015) 153–176.
date_created: 2020-10-13T09:27:48Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/s11721-015-0108-8
language:
- iso: eng
page: 153-176
publication: Swarm Intelligence
publication_identifier:
issn:
- 1935-3812
- 1935-3820
publication_status: published
status: public
title: 'Time-variant feedback processes in collective decision-making systems: influence
and effect of dynamic neighborhood sizes'
type: journal_article
user_id: '15415'
year: '2015'
...
---
_id: '20005'
author:
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
citation:
ama: 'Dorigo M, Hamann H, Valentini G. Efficient Decision-Making in a Self-Organizing
Robot Swarm: On the Speed Versus Accuracy Trade-Off. In: Proceedings of the
14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015).
; 2015.'
apa: 'Dorigo, M., Hamann, H., & Valentini, G. (2015). Efficient Decision-Making
in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off. In Proceedings
of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015).'
bibtex: '@inproceedings{Dorigo_Hamann_Valentini_2015, title={Efficient Decision-Making
in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off}, booktitle={Proceedings
of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)},
author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015}
}'
chicago: 'Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Efficient Decision-Making
in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off.” In
Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems
(AAMAS 2015), 2015.'
ieee: 'M. Dorigo, H. Hamann, and G. Valentini, “Efficient Decision-Making in a Self-Organizing
Robot Swarm: On the Speed Versus Accuracy Trade-Off,” in Proceedings of the
14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015),
2015.'
mla: 'Dorigo, Marco, et al. “Efficient Decision-Making in a Self-Organizing Robot
Swarm: On the Speed Versus Accuracy Trade-Off.” Proceedings of the 14th Int.
Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.'
short: 'M. Dorigo, H. Hamann, G. Valentini, in: Proceedings of the 14th Int. Conf.
on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.'
date_created: 2020-10-15T12:29:26Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent
Systems (AAMAS 2015)
status: public
title: 'Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus
Accuracy Trade-Off'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '20006'
author:
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
citation:
ama: 'Dorigo M, Hamann H, Valentini G. Self-organized collective decisions in a
robot swarm. In: AAAI-15 Video Proceedings. ; 2015.'
apa: Dorigo, M., Hamann, H., & Valentini, G. (2015). Self-organized collective
decisions in a robot swarm. In AAAI-15 Video Proceedings.
bibtex: '@inproceedings{Dorigo_Hamann_Valentini_2015, title={Self-organized collective
decisions in a robot swarm}, booktitle={AAAI-15 Video Proceedings}, author={Dorigo,
Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015} }'
chicago: Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Self-Organized Collective
Decisions in a Robot Swarm.” In AAAI-15 Video Proceedings, 2015.
ieee: M. Dorigo, H. Hamann, and G. Valentini, “Self-organized collective decisions
in a robot swarm,” in AAAI-15 Video Proceedings, 2015.
mla: Dorigo, Marco, et al. “Self-Organized Collective Decisions in a Robot Swarm.”
AAAI-15 Video Proceedings, 2015.
short: 'M. Dorigo, H. Hamann, G. Valentini, in: AAAI-15 Video Proceedings, 2015.'
date_created: 2020-10-15T12:38:13Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: AAAI-15 Video Proceedings
status: public
title: Self-organized collective decisions in a robot swarm
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '266'
abstract:
- lang: eng
text: 'Many markets have seen a shift from the idea of buying and moved to leasing
instead. Arguably, the latter has been the major catalyst for their success. Ten
years ago, research realized this shift and initiated the study of "online leasing
problems" by introducing leasing to online optimization problems. Resources required
to provide a service in an "online leasing problem" are no more bought but leased
for different durations. In this paper, we provide an overview of results that
contribute to the understanding of "online resource leasing problems". '
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). ;
2015:343-344. doi:10.1145/2767386.2767454'
apa: Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing.
In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454
bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource
Leasing}, DOI={10.1145/2767386.2767454},
booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm},
year={2015}, pages={343–344} }'
chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource
Leasing.” In Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC), 343–44, 2015. https://doi.org/10.1145/2767386.2767454.
ieee: C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015,
pp. 343–344.
mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.”
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.
short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium
on Principles of Distributed Computing (PODC), 2015, pp. 343–344.'
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:22Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2767386.2767454
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:33:11Z
date_updated: 2018-03-21T09:33:11Z
file_id: '1478'
file_name: 266-p343-markarian.pdf
file_size: 679580
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:33:11Z
has_accepted_license: '1'
page: 343-344
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC)
status: public
title: Online Resource Leasing
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '267'
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
citation:
ama: Markarian C. Online Resource Leasing. Universität Paderborn; 2015.
apa: Markarian, C. (2015). Online Resource Leasing. Universität Paderborn.
bibtex: '@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität
Paderborn}, author={Markarian, Christine}, year={2015} }'
chicago: Markarian, Christine. Online Resource Leasing. Universität Paderborn,
2015.
ieee: C. Markarian, Online Resource Leasing. Universität Paderborn, 2015.
mla: Markarian, Christine. Online Resource Leasing. Universität Paderborn,
2015.
short: C. Markarian, Online Resource Leasing, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:26Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:33:41Z
date_updated: 2018-03-21T09:33:41Z
file_id: '1479'
file_name: 267-Dissertation_-_Markarian.pdf
file_size: 1328685
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:33:41Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Online Resource Leasing
type: dissertation
user_id: '15415'
year: '2015'
...
---
_id: '320'
abstract:
- lang: eng
text: 'We consider structural and algorithmic questions related to the Nash dynamics
of weighted congestion games. In weighted congestion games with linear latency
functions, the existence of pure Nash equilibria is guaranteed by a potential
function argument. Unfortunately, this proof of existence is inefficient and computing
pure Nash equilibria in such games is a PLS-hard problem even when all players
have unit weights. The situation gets worse when superlinear (e.g., quadratic)
latency functions come into play; in this case, the Nash dynamics of the game
may contain cycles and pure Nash equilibria may not even exist. Given these obstacles,
we consider approximate pure Nash equilibria as alternative solution concepts.
A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game
from which no player has any incentive to deviate in order to improve her cost
by a multiplicative factor higher than ρ. Do such equilibria exist for small values
of ρ? And if so, can we compute them efficiently?We provide positive answers to
both questions for weighted congestion games with polynomial latency functions
by exploiting an “approximation” of such games by a new class of potential games
that we call Ψ-games. This allows us to show that these games have d!-approximate
pure Nash equilibria, where d is the maximum degree of the latency functions.
Our main technical contribution is an efficient algorithm for computing O(1)-approximate
pure Nash equilibria when d is a constant. For games with linear latency functions,
the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency
functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial
in the number of bits in the representation of the game and 1/γ. As a byproduct
of our techniques, we also show the following interesting structural statement
for weighted congestion games with polynomial latency functions of maximum degree
d ≥ 2: polynomially-long sequences of best-response moves from any initial state
to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified
in such games as long as d is a constant.To the best of our knowledge, these are
the first positive algorithmic results for approximate pure Nash equilibria in
weighted congestion games. Our techniques significantly extend our recent work
on unweighted congestion games through the use of Ψ-games. The concept of approximating
nonpotential games by potential ones is interesting in itself and might have further
applications.'
article_number: '2'
author:
- first_name: Ioannis
full_name: Caragiannis, Ioannis
last_name: Caragiannis
- first_name: Angelo
full_name: Fanelli, Angelo
last_name: Fanelli
- first_name: Nick
full_name: Gravin, Nick
last_name: Gravin
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria
in Weighted Congestion Games: Existence, Efficient Computation, and Structure.
Transactions on Economics and Computation. 2015;3(1). doi:10.1145/2614687'
apa: 'Caragiannis, I., Fanelli, A., Gravin, N., & Skopalik, A. (2015). Approximate
Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
and Structure. Transactions on Economics and Computation, 3(1).
https://doi.org/10.1145/2614687'
bibtex: '@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure
Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
and Structure}, volume={3}, DOI={10.1145/2614687},
number={12}, journal={Transactions on Economics and Computation}, publisher={ACM},
author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik,
Alexander}, year={2015} }'
chicago: 'Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik.
“Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient
Computation, and Structure.” Transactions on Economics and Computation
3, no. 1 (2015). https://doi.org/10.1145/2614687.'
ieee: 'I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure
Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
and Structure,” Transactions on Economics and Computation, vol. 3, no.
1, 2015.'
mla: 'Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted
Congestion Games: Existence, Efficient Computation, and Structure.” Transactions
on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.'
short: I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics
and Computation 3 (2015).
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:04Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1145/2614687
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:40:55Z
date_updated: 2018-03-20T07:40:55Z
file_id: '1433'
file_name: 320-a2-caragiannis.pdf
file_size: 260503
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:40:55Z
has_accepted_license: '1'
intvolume: ' 3'
issue: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Transactions on Economics and Computation
publisher: ACM
status: public
title: 'Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence,
Efficient Computation, and Structure'
type: journal_article
user_id: '477'
volume: 3
year: '2015'
...
---
_id: '316'
author:
- first_name: Jannis
full_name: Pautz, Jannis
last_name: Pautz
citation:
ama: Pautz J. Budget Games with Priced Strategies. Universität Paderborn;
2015.
apa: Pautz, J. (2015). Budget Games with priced strategies. Universität Paderborn.
bibtex: '@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität
Paderborn}, author={Pautz, Jannis}, year={2015} }'
chicago: Pautz, Jannis. Budget Games with Priced Strategies. Universität
Paderborn, 2015.
ieee: J. Pautz, Budget Games with priced strategies. Universität Paderborn,
2015.
mla: Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn,
2015.
short: J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:53Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Budget Games with priced strategies
type: bachelorsthesis
user_id: '14052'
year: '2015'
...
---
_id: '317'
author:
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
citation:
ama: Jähn C. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn; 2015.
apa: Jähn, C. (2015). Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn.
bibtex: '@book{Jähn_2015, title={Bewertung von Renderingalgorithmen für komplexe
3-D-Szenen}, publisher={Universität Paderborn}, author={Jähn, Claudius}, year={2015}
}'
chicago: Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn, 2015.
ieee: C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn, 2015.
mla: Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen.
Universität Paderborn, 2015.
short: C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:53Z
date_updated: 2022-01-06T06:59:02Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:20:34Z
date_updated: 2018-03-21T09:20:34Z
file_id: '1462'
file_name: 317-Dissertation_ClaudiusJaehn.pdf
file_size: 20442332
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:20:34Z
has_accepted_license: '1'
language:
- iso: ger
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen
type: dissertation
user_id: '14052'
year: '2015'
...
---
_id: '270'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
citation:
ama: Abshoff S. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks.
Universität Paderborn; 2015.
apa: Abshoff, S. (2015). On the Complexity of Fundamental Problems in Dynamic
Ad-hoc Networks. Universität Paderborn.
bibtex: '@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in
Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff,
Sebastian}, year={2015} }'
chicago: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic
Ad-Hoc Networks. Universität Paderborn, 2015.
ieee: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-hoc
Networks. Universität Paderborn, 2015.
mla: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic
Ad-Hoc Networks. Universität Paderborn, 2015.
short: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:32Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:30:02Z
date_updated: 2018-03-21T09:30:02Z
file_id: '1476'
file_name: 270-Dissertation_-_Abshoff.pdf
file_size: 448614
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:30:02Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '271'
abstract:
- lang: eng
text: In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists
of various demands on different resources. The player's utility is at most the
sum of these demands, provided they are fully satisfied. Every resource has a
limited capacity and if it is exceeded by the total demand, it has to be split
between the players. Since these games generally do not have pure Nash equilibria,
we consider approximate pure Nash equilibria, in which no player can improve her
utility by more than some fixed factor $\alpha$ through unilateral strategy changes.
There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits
the demand of each player on a specific resource) such that $\alpha$-approximate
pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for
$\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold
$\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard.
We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$.
For a restricted version of the game, where demands of players only differ slightly
from each other (e.g. symmetric games), we show that approximate Nash equilibria
can be reached (and thus also be computed) in polynomial time using the best-response
dynamic. Finally, we show that a broader class of utility-maximization games (which
includes BAGs) converges quickly towards states whose social welfare is close
to the optimum.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of
Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: Proceedings
of the 8th International Symposium on Algorithmic Game Theory (SAGT). Lecture
Notes in Computer Science. ; 2015:178-189. doi:10.1007/978-3-662-48433-3_14'
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2015). On Existence
and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.
In Proceedings of the 8th International Symposium on Algorithmic Game Theory
(SAGT) (pp. 178–189). https://doi.org/10.1007/978-3-662-48433-3_14
bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes
in Computer Science}, title={On Existence and Properties of Approximate Pure Nash
Equilibria in Bandwidth Allocation Games}, DOI={10.1007/978-3-662-48433-3_14},
booktitle={Proceedings of the 8th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers,
Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture
Notes in Computer Science} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
Allocation Games.” In Proceedings of the 8th International Symposium on Algorithmic
Game Theory (SAGT), 178–89. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-48433-3_14.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties
of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in Proceedings
of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015,
pp. 178–189.
mla: Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure
Nash Equilibria in Bandwidth Allocation Games.” Proceedings of the 8th International
Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14.
short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:34Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-48433-3_14
external_id:
arxiv:
- '1507.02908'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:29:34Z
date_updated: 2018-03-21T09:29:34Z
file_id: '1475'
file_name: 271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf
file_size: 256718
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:29:34Z
has_accepted_license: '1'
page: 178-189
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 8th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
Allocation Games
type: conference
user_id: '14052'
year: '2015'
...
---
_id: '274'
abstract:
- lang: eng
text: Consider the problem in which n jobs that are classified into k types are
to be scheduled on m identical machines without preemption. A machine requires
a proper setup taking s time units before processing jobs of a given type. The
objective is to minimize the makespan of the resulting schedule. We design and
analyze an approximation algorithm that runs in time polynomial in n,m and k and
computes a solution with an approximation factor that can be made arbitrarily
close to 3/2.
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling
on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings. Lecture Notes in Computer Science. ; 2015:542--553.
doi:10.1007/978-3-319-21840-3_45'
apa: 'Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2015).
Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack,
& U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium,
WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings (pp. 542--553).
https://doi.org/10.1007/978-3-319-21840-3_45'
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture
Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with
Setup Times}, DOI={10.1007/978-3-319-21840-3_45},
booktitle={Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015},
pages={542--553}, collection={Lecture Notes in Computer Science} }'
chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings, edited by Frank Dehne, Jörg Rüdiger Sack, and
Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21840-3_45.'
ieee: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive
Scheduling on Machines with Setup Times,” in Algorithms and Data Structures:
14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015.
Proceedings, 2015, pp. 542--553.'
mla: 'Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup
Times.” Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank
Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.'
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne,
J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International
Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015,
pp. 542--553.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:39Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21840-3_45
editor:
- first_name: Frank
full_name: Dehne, Frank
last_name: Dehne
- first_name: Jörg Rüdiger
full_name: Sack, Jörg Rüdiger
last_name: Sack
- first_name: Ulrike
full_name: Stege, Ulrike
last_name: Stege
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:28:34Z
date_updated: 2018-03-21T09:28:34Z
file_id: '1473'
file_name: 274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf
file_size: 215498
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:28:34Z
has_accepted_license: '1'
page: 542--553
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: 'Algorithms and Data Structures: 14th International Symposium, WADS 2015,
Victoria, BC, Canada, August 5-7, 2015. Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Non-preemptive Scheduling on Machines with Setup Times
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '275'
abstract:
- lang: eng
text: 'We investigate a non-cooperative game-theoretic model for the formation of
communication networks by selfish agents. Each agent aims for a central position
at minimum cost for creating edges. In particular, the general model (Fabrikant
et al., PODC''03) became popular for studying the structure of the Internet or
social networks. Despite its significance, locality in this game was first studied
only recently (Bilò et al., SPAA''14), where a worst case locality model was presented,
which came with a high efficiency loss in terms of quality of equilibria. Our
main contribution is a new and more optimistic view on locality: agents are limited
in their knowledge and actions to their local view ranges, but can probe different
strategies and finally choose the best. We study the influence of our locality
notion on the hardness of computing best responses, convergence to equilibria,
and quality of equilibria. Moreover, we compare the strength of local versus non-local
strategy changes. Our results address the gap between the original model and the
worst case locality variant. On the bright side, our efficiency results are in
line with observations from the original model, yet we have a non-constant lower
bound on the Price of Anarchy.'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Pascal
full_name: Lenzner, Pascal
last_name: Lenzner
citation:
ama: 'Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local.
In: Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS). LNCS. ; 2015:248--260. doi:10.1007/978-3-662-48054-0_21'
apa: 'Cord-Landwehr, A., & Lenzner, P. (2015). Network Creation Games: Think
Global - Act Local. In Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS) (pp. 248--260). https://doi.org/10.1007/978-3-662-48054-0_21'
bibtex: '@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network
Creation Games: Think Global - Act Local}, DOI={10.1007/978-3-662-48054-0_21},
booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015},
pages={248--260}, collection={LNCS} }'
chicago: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” In Proceedings of the 40th Conference on Mathematical
Foundations of Computer Science (MFCS), 248--260. LNCS, 2015. https://doi.org/10.1007/978-3-662-48054-0_21.'
ieee: 'A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global -
Act Local,” in Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260.'
mla: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260, doi:10.1007/978-3-662-48054-0_21.'
short: 'A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on
Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:40Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-662-48054-0_21
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:27:12Z
date_updated: 2018-03-21T09:27:12Z
file_id: '1472'
file_name: 275-978-3-662-48054-0_21.pdf
file_size: 279995
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:27:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--260
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS)
series_title: LNCS
status: public
title: 'Network Creation Games: Think Global - Act Local'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '277'
author:
- first_name: Nils
full_name: Kothe, Nils
last_name: Kothe
citation:
ama: Kothe N. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn; 2015.
apa: Kothe, N. (2015). Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk. Universität Paderborn.
bibtex: '@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils},
year={2015} }'
chicago: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk. Universität Paderborn, 2015.
ieee: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn, 2015.
mla: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn, 2015.
short: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:44Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk
type: bachelorsthesis
user_id: '14052'
year: '2015'
...
---
_id: '17425'
author:
- first_name: 'Jan '
full_name: 'Berssenbrügge, Jan '
last_name: Berssenbrügge
- first_name: Olga
full_name: Wiederkehr, Olga
last_name: Wiederkehr
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Berssenbrügge J, Wiederkehr O, Jähn C, Fischer M. Anbindung des Virtuellen
Prototypen an die Partialmodelle intelligenter technischer Systeme. In: 12.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung.
Vol 343. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:65-78.'
apa: Berssenbrügge, J., Wiederkehr, O., Jähn, C., & Fischer, M. (2015). Anbindung
des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme.
12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
343, 65–78.
bibtex: '@inproceedings{Berssenbrügge_Wiederkehr_Jähn_Fischer_2015, place={Paderborn},
title={Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter
technischer Systeme}, volume={343}, booktitle={12. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, author={Berssenbrügge, Jan and Wiederkehr, Olga
and Jähn, Claudius and Fischer, Matthias}, year={2015}, pages={65–78} }'
chicago: 'Berssenbrügge, Jan , Olga Wiederkehr, Claudius Jähn, and Matthias Fischer.
“Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer
Systeme.” In 12. Paderborner Workshop Augmented & Virtual Reality in Der
Produktentstehung, 343:65–78. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf
Instituts, 2015.'
ieee: J. Berssenbrügge, O. Wiederkehr, C. Jähn, and M. Fischer, “Anbindung des Virtuellen
Prototypen an die Partialmodelle intelligenter technischer Systeme,” in 12.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
2015, vol. 343, pp. 65–78.
mla: Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle
Intelligenter Technischer Systeme.” 12. Paderborner Workshop Augmented &
Virtual Reality in Der Produktentstehung, vol. 343, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015, pp. 65–78.
short: 'J. Berssenbrügge, O. Wiederkehr, C. Jähn, M. Fischer, in: 12. Paderborner
Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 65–78.'
date_created: 2020-07-28T09:49:42Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 343'
language:
- iso: eng
page: 65-78
place: Paderborn
publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer
Systeme
type: conference
user_id: '15415'
volume: 343
year: '2015'
...
---
_id: '17427'
author:
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Maria
full_name: Gerges, Maria
last_name: Gerges
- first_name: Jan
full_name: Berssenbrügge, Jan
last_name: Berssenbrügge
citation:
ama: 'Jähn C, Fischer M, Gerges M, Berssenbrügge J. Automatische Ableitung geometrischer
Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. In: 12. Paderborner
Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 342.
Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120.'
apa: Jähn, C., Fischer, M., Gerges, M., & Berssenbrügge, J. (2015). Automatische
Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell.
12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
342, 107–120.
bibtex: '@inproceedings{Jähn_Fischer_Gerges_Berssenbrügge_2015, place={Paderborn},
title={Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem
3-D-Polygonmodell}, volume={342}, booktitle={12. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, author={Jähn, Claudius and Fischer, Matthias and
Gerges, Maria and Berssenbrügge, Jan}, year={2015}, pages={107–120} }'
chicago: 'Jähn, Claudius, Matthias Fischer, Maria Gerges, and Jan Berssenbrügge.
“Automatische Ableitung Geometrischer Eigenschaften von Bauteilen Aus Dem 3-D-Polygonmodell.”
In 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
342:107–20. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.'
ieee: C. Jähn, M. Fischer, M. Gerges, and J. Berssenbrügge, “Automatische Ableitung
geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell,” in 12.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
2015, vol. 342, pp. 107–120.
mla: Jähn, Claudius, et al. “Automatische Ableitung Geometrischer Eigenschaften
von Bauteilen Aus Dem 3-D-Polygonmodell.” 12. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung, vol. 342, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015, pp. 107–20.
short: 'C. Jähn, M. Fischer, M. Gerges, J. Berssenbrügge, in: 12. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 107–120.'
date_created: 2020-07-28T10:23:18Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 342'
language:
- iso: eng
page: 107-120
place: Paderborn
publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell
type: conference
user_id: '15415'
volume: 342
year: '2015'
...
---
_id: '17431'
citation:
ama: 'Gausemeier J, Grafe M, Meyer auf der Heide F, eds. Augmented & Virtual
Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions-
Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme
Mit AR/VR. Vol 342. 12. Paderborner Workshop Augmented & Virtual Reality
in der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015.'
apa: 'Gausemeier, J., Grafe, M., & Meyer auf der Heide, F. (Eds.). (2015). Augmented
& Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge;
Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter
technischer Systeme mit AR/VR (12. Paderborner Workshop Augmented & Virtual
Reality in der Produktentstehung, Vol. 342). Verlagsschriftenreihe des Heinz Nixdorf
Instituts.'
bibtex: '@book{Gausemeier_Grafe_Meyer auf der Heide_2015, place={Paderborn}, edition={12.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung},
title={Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden
und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping
intelligenter technischer Systeme mit AR/VR}, volume={342}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, year={2015} }'
chicago: 'Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide,
eds. Augmented & Virtual Reality in Der Produktentstehung: Grundlagen,
Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping
Intelligenter Technischer Systeme Mit AR/VR. 12. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung. Vol. 342. Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015.'
ieee: 'J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., Augmented &
Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge;
Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter
technischer Systeme mit AR/VR, 12. Paderborner Workshop Augmented & Virtual
Reality in der Produktentstehung., vol. 342. Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015.'
mla: 'Gausemeier, Jürgen, et al., editors. Augmented & Virtual Reality in
Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken,
Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR. 12. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung, vol. 342, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015.'
short: 'J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., Augmented & Virtual
Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions-
Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme
Mit AR/VR, 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.'
date_created: 2020-07-28T13:39:25Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
edition: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
editor:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Michael
full_name: Grafe, Michael
last_name: Grafe
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 342'
language:
- iso: eng
place: Paderborn
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: 'Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden
und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter
technischer Systeme mit AR/VR'
type: book_editor
user_id: '15415'
volume: 342
year: '2015'
...
---
_id: '17657'
abstract:
- lang: eng
text: Inter-datacenter transfers of non-interactive but timely large flows over
a private (managed) network is an important problem faced by many cloud service
providers. The considered flows are non-interactive because they do not explicitly
target the end users. However, most of them must be performed on a timely basis
and are associated with a deadline. We propose to schedule these flows by a centralized
controller, which determines when to transmit each flow and which path to use.
Two scheduling models are presented in this paper. In the first, the controller
also determines the rate of each flow, while in the second bandwidth is assigned
by the network according to the TCP rules. We develop scheduling algorithms for
both models and compare their complexity and performance.
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. Cloud
Computing, IEEE Transactions on. 2015;PP(99):1-1. doi:10.1109/TCC.2015.2487964
apa: Cohen, R., & Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data
Flows. Cloud Computing, IEEE Transactions On, PP(99), 1–1. https://doi.org/10.1109/TCC.2015.2487964
bibtex: '@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large
Data Flows}, volume={PP}, DOI={10.1109/TCC.2015.2487964},
number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R.
and Polevoy, Gleb}, year={2015}, pages={1–1} }'
chicago: 'Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data
Flows.” Cloud Computing, IEEE Transactions On PP, no. 99 (2015): 1–1. https://doi.org/10.1109/TCC.2015.2487964.'
ieee: R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,”
Cloud Computing, IEEE Transactions on, vol. PP, no. 99, pp. 1–1, 2015.
mla: Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.”
Cloud Computing, IEEE Transactions On, vol. PP, no. 99, 2015, pp. 1–1,
doi:10.1109/TCC.2015.2487964.
short: R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1.
date_created: 2020-08-06T15:20:58Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TCC.2015.2487964
extern: '1'
issue: '99'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Cloud computing
- Routing
- Schedules
- Scheduling
language:
- iso: eng
page: 1-1
publication: Cloud Computing, IEEE Transactions on
publication_identifier:
issn:
- 2168-7161
status: public
title: Inter-Datacenter Scheduling of Large Data Flows
type: journal_article
user_id: '83983'
volume: PP
year: '2015'
...
---
_id: '17658'
abstract:
- lang: eng
text: 'Abstract We study the problem of bandwidth allocation with multiple interferences.
In this problem the input consists of a set of users and a set of base stations.
Each user has a list of requests, each consisting of a base station, a frequency
demand, and a profit that may be gained by scheduling this request. The goal is
to find a maximum profit set of user requests S that satisfies the following conditions:
(i) S contains at most one request per user, (ii) the frequency sets allotted
to requests in S that correspond to the same base station are pairwise non-intersecting,
and (iii) the QoS received by any user at any frequency is reasonable according
to an interference model. In this paper we consider two variants of bandwidth
allocation with multiple interferences. In the first each request specifies a
demand that can be satisfied by any subset of frequencies that is large enough.
In the second each request specifies a specific frequency interval. Furthermore,
we consider two interference models, multiplicative and additive. We show that
these problems are extremely hard to approximate if the interferences depend on
both the interfered and the interfering base stations. On the other hand, we provide
constant factor approximation algorithms for both variants of bandwidth allocation
with multiple interferences for the case where the interferences depend only on
the interfering base stations. We also consider a restrictive special case that
is closely related to the Knapsack problem. We show that this special case is
NP-hard and that it admits an FPTAS. '
author:
- first_name: Reuven
full_name: Bar-Yehuda, Reuven
last_name: Bar-Yehuda
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Dror
full_name: Rawitz, Dror
last_name: Rawitz
citation:
ama: Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks
with multiple interferences. Discrete Applied Mathematics . 2015;194:23-36.
doi:http://dx.doi.org/10.1016/j.dam.2015.05.013
apa: Bar-Yehuda, R., Polevoy, G., & Rawitz, D. (2015). Bandwidth allocation
in cellular networks with multiple interferences. Discrete Applied Mathematics
, 194, 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013
bibtex: '@article{Bar-Yehuda_Polevoy_Rawitz_2015, title={Bandwidth allocation in
cellular networks with multiple interferences}, volume={194}, DOI={http://dx.doi.org/10.1016/j.dam.2015.05.013},
journal={Discrete Applied Mathematics }, publisher={Elsevier}, author={Bar-Yehuda,
Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2015}, pages={23–36} }'
chicago: 'Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation
in Cellular Networks with Multiple Interferences.” Discrete Applied Mathematics
194 (2015): 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013.'
ieee: R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular
networks with multiple interferences,” Discrete Applied Mathematics , vol.
194, pp. 23–36, 2015.
mla: Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with
Multiple Interferences.” Discrete Applied Mathematics , vol. 194, Elsevier,
2015, pp. 23–36, doi:http://dx.doi.org/10.1016/j.dam.2015.05.013.
short: R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics 194 (2015)
23–36.
date_created: 2020-08-06T15:21:15Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: http://dx.doi.org/10.1016/j.dam.2015.05.013
extern: '1'
intvolume: ' 194'
keyword:
- Local ratio
language:
- iso: eng
page: 23 - 36
publication: 'Discrete Applied Mathematics '
publication_identifier:
issn:
- 0166-218X
publisher: Elsevier
status: public
title: Bandwidth allocation in cellular networks with multiple interferences
type: journal_article
user_id: '83983'
volume: 194
year: '2015'
...
---
_id: '240'
abstract:
- lang: eng
text: We consider online leasing problems in which demands arrive over time and
need to be served by leasing resources. We introduce a new model for these problems
such that a resource can be leased for K different durations each incurring a
different cost (longer leases cost less per time unit). Each demand i can be served
anytime between its arrival ai and its deadline ai+di by a leased resource. The
objective is to meet all deadlines while minimizing the total leasing costs. This
model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005)
in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive
where dmax and lmin denote the largest di and the shortest available lease length,
respectively. We also extend the SetCoverLeasing problem by deadlines and give
a competitive online algorithm which also improves on existing solutions for the
original SetCoverLeasing problem.
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible
Demands in Online Leasing Problems. In: Proceedings of the 21st Annual International
Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer
Science. ; 2015:277--288. doi:10.1007/978-3-319-21398-9_22'
apa: Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., & Riechers,
S. (2015). Towards Flexible Demands in Online Leasing Problems. In Proceedings
of the 21st Annual International Computing and Combinatorics Conference (COCOON)
(pp. 277--288). https://doi.org/10.1007/978-3-319-21398-9_22
bibtex: '@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture
Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing
Problems}, DOI={10.1007/978-3-319-21398-9_22},
booktitle={Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015},
pages={277--288}, collection={Lecture Notes in Computer Science} }'
chicago: Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf
der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.”
In Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON), 277--288. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21398-9_22.
ieee: S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards
Flexible Demands in Online Leasing Problems,” in Proceedings of the 21st Annual
International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288.
mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.”
Proceedings of the 21st Annual International Computing and Combinatorics Conference
(COCOON), 2015, pp. 277--288, doi:10.1007/978-3-319-21398-9_22.
short: 'S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in:
Proceedings of the 21st Annual International Computing and Combinatorics Conference
(COCOON), 2015, pp. 277--288.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:56:05Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21398-9_22
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:28:50Z
date_updated: 2018-03-21T10:28:50Z
file_id: '1498'
file_name: 240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf
file_size: 264482
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:28:50Z
has_accepted_license: '1'
page: 277--288
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON)
series_title: Lecture Notes in Computer Science
status: public
title: Towards Flexible Demands in Online Leasing Problems
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '16449'
abstract:
- lang: eng
text: "We consider the following variant of the two dimensional gathering problem\r\nfor
swarms of robots: Given a swarm of $n$ indistinguishable, point shaped\r\nrobots
on a two dimensional grid. Initially, the robots form a closed chain on\r\nthe
grid and must keep this connectivity during the whole process of their\r\ngathering.
Connectivity means, that neighboring robots of the chain need to be\r\npositioned
at the same or neighboring points of the grid. In our model,\r\ngathering means
to keep shortening the chain until the robots are located\r\ninside a $2\\times
2$ subgrid. Our model is completely local (no global control,\r\nno global coordinates,
no compass, no global communication or vision, \\ldots).\r\nEach robot can only
see its next constant number of left and right neighbors on\r\nthe chain. This
fixed constant is called the \\emph{viewing path length}. All\r\nits operations
and detections are restricted to this constant number of robots.\r\nOther robots,
even if located at neighboring or the same grid point cannot be\r\ndetected. Only
based on the relative positions of its detectable chain\r\nneighbors, a robot
can decide to obtain a certain state. Based on this state\r\nand their local knowledge,
the robots do local modifications to the chain by\r\nmoving to neighboring grid
points without breaking the chain. These\r\nmodifications are performed without
the knowledge whether they lead to a global\r\nprogress or not. We assume the
fully synchronous $\\mathcal{FSYNC}$ model. For\r\nthis problem, we present a
gathering algorithm which needs linear time. This\r\nresult generalizes the result
from \\cite{hopper}, where an open chain with\r\nspecified distinguishable (and
fixed) endpoints is considered."
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: 'Andreas '
full_name: 'Cord-Landwehr, Andreas '
last_name: Cord-Landwehr
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering
a Closed Chain of Robots on a Grid. arXiv:151005454. 2015.
apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der
Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. ArXiv:1510.05454.
bibtex: '@article{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2015, title={Gathering
a Closed Chain of Robots on a Grid}, journal={arXiv:1510.05454}, author={Abshoff,
Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and
Meyer auf der Heide, Friedhelm}, year={2015} }'
chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung,
and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.”
ArXiv:1510.05454, 2015.
ieee: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide,
“Gathering a Closed Chain of Robots on a Grid,” arXiv:1510.05454. 2015.
mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”
ArXiv:1510.05454, 2015.
short: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide,
ArXiv:1510.05454 (2015).
date_created: 2020-04-07T07:20:46Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1510.05454'
language:
- iso: eng
publication: arXiv:1510.05454
status: public
title: Gathering a Closed Chain of Robots on a Grid
type: preprint
user_id: '15415'
year: '2015'
...
---
_id: '16452'
abstract:
- lang: eng
text: "We consider the problem of dominating set-based virtual backbone used for\r\nrouting
in asymmetric wireless ad-hoc networks. These networks have non-uniform\r\ntransmission
ranges and are modeled using the well-established disk graphs. The\r\ncorresponding
graph theoretic problem seeks a strongly connected\r\ndominating-absorbent set
of minimum cardinality in a digraph. A subset of nodes\r\nin a digraph is a strongly
connected dominating-absorbent set if the subgraph\r\ninduced by these nodes is
strongly connected and each node in the graph is\r\neither in the set or has both
an in-neighbor and an out-neighbor in it.\r\nDistributed algorithms for this problem
are of practical significance due to\r\nthe dynamic nature of ad-hoc networks.
We present a first distributed\r\napproximation algorithm, with a constant approximation
factor and O(Diam)\r\nrunning time, where Diam is the diameter of the graph. Moreover
we present a\r\nsimple heuristic algorithm and conduct an extensive simulation
study showing\r\nthat our heuristic outperforms previously known approaches for
the problem."
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.
arXiv:151001866. 2015.
apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M.
(2015). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-Hoc Networks. ArXiv:1510.01866.
bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2015, title={Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks},
journal={arXiv:1510.01866}, author={Abu-Khzam, Faisal N. and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2015} }'
chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
in Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.
ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks,”
arXiv:1510.01866. 2015.
mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
Backbones in Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.
short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, ArXiv:1510.01866
(2015).
date_created: 2020-04-07T12:22:48Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1510.01866'
language:
- iso: eng
publication: arXiv:1510.01866
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-Hoc Networks
type: preprint
user_id: '15415'
year: '2015'
...
---
_id: '16460'
abstract:
- lang: eng
text: "Consider n nodes connected to a single coordinator. Each node receives an\r\nindividual
online data stream of numbers and, at any point in time, the\r\ncoordinator has
to know the k nodes currently observing the largest values, for\r\na given k between
1 and n. We design and analyze an algorithm that solves this\r\nproblem while
bounding the amount of messages exchanged between the nodes and\r\nthe coordinator.
Our algorithm employs the idea of using filters which,\r\nintuitively speaking,
leads to few messages to be sent, if the new input is\r\n\"similar\" to the previous
ones. The algorithm uses a number of messages that is\r\non expectation by a factor
of O((log {\\Delta} + k) log n) larger than that of\r\nan offline algorithm that
sets filters in an optimal way, where {\\Delta} is\r\nupper bounded by the largest
value observed by any node."
author:
- first_name: Alexander
full_name: Mäcker, Alexander
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F. Online Top-k-Position Monitoring
of Distributed Data Streams. In: Proceedings of the 29th International Parallel
and Distributed Processing Symposium (IPDPS). IEEE; 2015:357-364. doi:10.1109/IPDPS.2015.40'
apa: Mäcker, A., Malatyali, M., & Meyer auf der Heide, F. (2015). Online Top-k-Position
Monitoring of Distributed Data Streams. In Proceedings of the 29th International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 357–364). IEEE.
https://doi.org/10.1109/IPDPS.2015.40
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_2015, title={Online
Top-k-Position Monitoring of Distributed Data Streams}, DOI={10.1109/IPDPS.2015.40},
booktitle={Proceedings of the 29th International Parallel and Distributed Processing
Symposium (IPDPS)}, publisher={IEEE}, author={Mäcker, Alexander and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm}, year={2015}, pages={357–364} }'
chicago: Mäcker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide.
“Online Top-k-Position Monitoring of Distributed Data Streams.” In Proceedings
of the 29th International Parallel and Distributed Processing Symposium (IPDPS),
357–64. IEEE, 2015. https://doi.org/10.1109/IPDPS.2015.40.
ieee: A. Mäcker, M. Malatyali, and F. Meyer auf der Heide, “Online Top-k-Position
Monitoring of Distributed Data Streams,” in Proceedings of the 29th International
Parallel and Distributed Processing Symposium (IPDPS), 2015, pp. 357–364.
mla: Mäcker, Alexander, et al. “Online Top-k-Position Monitoring of Distributed
Data Streams.” Proceedings of the 29th International Parallel and Distributed
Processing Symposium (IPDPS), IEEE, 2015, pp. 357–64, doi:10.1109/IPDPS.2015.40.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the
29th International Parallel and Distributed Processing Symposium (IPDPS), IEEE,
2015, pp. 357–364.'
date_created: 2020-04-08T07:02:15Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1109/IPDPS.2015.40
external_id:
arxiv:
- '1410.7912'
language:
- iso: eng
page: 357-364
publication: Proceedings of the 29th International Parallel and Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Online Top-k-Position Monitoring of Distributed Data Streams
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '16391'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Degener B, Kempkes B, Kling P, Meyer auf der Heide F. Linear and Competitive
Strategies for Continuous Robot Formation Problems. ACM Transactions on Parallel
Computing. 2015:1-18. doi:10.1145/2742341
apa: Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2015).
Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM
Transactions on Parallel Computing, 1–18. https://doi.org/10.1145/2742341
bibtex: '@article{Degener_Kempkes_Kling_Meyer auf der Heide_2015, title={Linear
and Competitive Strategies for Continuous Robot Formation Problems}, DOI={10.1145/2742341},
journal={ACM Transactions on Parallel Computing}, author={Degener, Bastian and
Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2015},
pages={1–18} }'
chicago: Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf
der Heide. “Linear and Competitive Strategies for Continuous Robot Formation Problems.”
ACM Transactions on Parallel Computing, 2015, 1–18. https://doi.org/10.1145/2742341.
ieee: B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “Linear and
Competitive Strategies for Continuous Robot Formation Problems,” ACM Transactions
on Parallel Computing, pp. 1–18, 2015.
mla: Degener, Bastian, et al. “Linear and Competitive Strategies for Continuous
Robot Formation Problems.” ACM Transactions on Parallel Computing, 2015,
pp. 1–18, doi:10.1145/2742341.
short: B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, ACM Transactions
on Parallel Computing (2015) 1–18.
date_created: 2020-04-03T06:40:56Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/2742341
language:
- iso: eng
page: 1-18
publication: ACM Transactions on Parallel Computing
publication_identifier:
issn:
- 2329-4949
publication_status: published
status: public
title: Linear and Competitive Strategies for Continuous Robot Formation Problems
type: journal_article
user_id: '15415'
year: '2015'
...
---
_id: '16397'
abstract:
- lang: eng
text: "In the gathering problem, n autonomous robots have to meet on a single point.\r\nWe
consider the gathering of a closed chain of point-shaped, anonymous robots\r\non
a grid. The robots only have local knowledge about a constant number of\r\nneighboring
robots along the chain in both directions. Actions are performed in\r\nthe fully
synchronous time model FSYNC. Every robot has a limited memory that\r\nmay contain
one timestamp of the global clock, also visible to its direct\r\nneighbors. In
this synchronous time model, there is no limited view gathering\r\nalgorithm known
to perform better than in quadratic runtime. The configurations\r\nthat show the
quadratic lower bound are closed chains. In this paper, we\r\npresent the first
sub-quadratic---in fact linear time---gathering algorithm for\r\nclosed chains
on a grid."
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Andreas Cord-Landwehr, Andreas
last_name: Andreas Cord-Landwehr
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Andreas Cord-Landwehr A, Jung D, Meyer auf der Heide F. Towards
Gathering Robots with Limited View in Linear Time: The Closed Chain Case. ArXiv:
150104877. 2015.'
apa: 'Abshoff, S., Andreas Cord-Landwehr, A., Jung, D., & Meyer auf der Heide,
F. (2015). Towards Gathering Robots with Limited View in Linear Time: The Closed
Chain Case. ArXiv: 1501.04877.'
bibtex: '@article{Abshoff_Andreas Cord-Landwehr_Jung_Meyer auf der Heide_2015, title={Towards
Gathering Robots with Limited View in Linear Time: The Closed Chain Case}, journal={ArXiv:
1501.04877}, author={Abshoff, Sebastian and Andreas Cord-Landwehr, Andreas and
Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2015} }'
chicago: 'Abshoff, Sebastian, Andreas Andreas Cord-Landwehr, Daniel Jung, and Friedhelm
Meyer auf der Heide. “Towards Gathering Robots with Limited View in Linear Time:
The Closed Chain Case.” ArXiv: 1501.04877, 2015.'
ieee: 'S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, and F. Meyer auf der Heide,
“Towards Gathering Robots with Limited View in Linear Time: The Closed Chain
Case,” ArXiv: 1501.04877. 2015.'
mla: 'Abshoff, Sebastian, et al. “Towards Gathering Robots with Limited View in
Linear Time: The Closed Chain Case.” ArXiv: 1501.04877, 2015.'
short: 'S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, F. Meyer auf der Heide, ArXiv:
1501.04877 (2015).'
date_created: 2020-04-03T09:36:54Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1501.04877'
language:
- iso: eng
publication: 'ArXiv: 1501.04877'
status: public
title: 'Towards Gathering Robots with Limited View in Linear Time: The Closed Chain
Case'
type: preprint
user_id: '15415'
year: '2015'
...
---
_id: '20007'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Istvan
full_name: Karsai, Istvan
last_name: Karsai
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Allison
full_name: Hilbun, Allison
last_name: Hilbun
citation:
ama: 'Hamann H, Karsai I, Schmickl T, Hilbun A. The common stomach: Organizing task
allocation in wasp societies. In: Symposium on Biomathematics and Ecology:
Education and Research. ; 2014.'
apa: 'Hamann, H., Karsai, I., Schmickl, T., & Hilbun, A. (2014). The common
stomach: Organizing task allocation in wasp societies. In Symposium on Biomathematics
and Ecology: Education and Research.'
bibtex: '@inproceedings{Hamann_Karsai_Schmickl_Hilbun_2014, title={The common stomach:
Organizing task allocation in wasp societies}, booktitle={Symposium on Biomathematics
and Ecology: Education and Research}, author={Hamann, Heiko and Karsai, Istvan
and Schmickl, Thomas and Hilbun, Allison}, year={2014} }'
chicago: 'Hamann, Heiko, Istvan Karsai, Thomas Schmickl, and Allison Hilbun. “The
Common Stomach: Organizing Task Allocation in Wasp Societies.” In Symposium
on Biomathematics and Ecology: Education and Research, 2014.'
ieee: 'H. Hamann, I. Karsai, T. Schmickl, and A. Hilbun, “The common stomach: Organizing
task allocation in wasp societies,” in Symposium on Biomathematics and Ecology:
Education and Research, 2014.'
mla: 'Hamann, Heiko, et al. “The Common Stomach: Organizing Task Allocation in Wasp
Societies.” Symposium on Biomathematics and Ecology: Education and Research,
2014.'
short: 'H. Hamann, I. Karsai, T. Schmickl, A. Hilbun, in: Symposium on Biomathematics
and Ecology: Education and Research, 2014.'
date_created: 2020-10-15T13:56:46Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: 'Symposium on Biomathematics and Ecology: Education and Research'
status: public
title: 'The common stomach: Organizing task allocation in wasp societies'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20008'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
citation:
ama: 'Hamann H, Valentini G. Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing
Temporary Lock-ins. In: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014).
Cham; 2014. doi:10.1007/978-3-319-09952-1_15'
apa: 'Hamann, H., & Valentini, G. (2014). Swarm in a Fly Bottle: Feedback-Based
Analysis of Self-organizing Temporary Lock-ins. In Ninth Int. Conf. on Swarm
Intelligence (ANTS 2014). Cham. https://doi.org/10.1007/978-3-319-09952-1_15'
bibtex: '@inproceedings{Hamann_Valentini_2014, place={Cham}, title={Swarm in a Fly
Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins}, DOI={10.1007/978-3-319-09952-1_15},
booktitle={Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}, author={Hamann,
Heiko and Valentini, Gabriele}, year={2014} }'
chicago: 'Hamann, Heiko, and Gabriele Valentini. “Swarm in a Fly Bottle: Feedback-Based
Analysis of Self-Organizing Temporary Lock-Ins.” In Ninth Int. Conf. on Swarm
Intelligence (ANTS 2014). Cham, 2014. https://doi.org/10.1007/978-3-319-09952-1_15.'
ieee: 'H. Hamann and G. Valentini, “Swarm in a Fly Bottle: Feedback-Based Analysis
of Self-organizing Temporary Lock-ins,” in Ninth Int. Conf. on Swarm Intelligence
(ANTS 2014), 2014.'
mla: 'Hamann, Heiko, and Gabriele Valentini. “Swarm in a Fly Bottle: Feedback-Based
Analysis of Self-Organizing Temporary Lock-Ins.” Ninth Int. Conf. on Swarm
Intelligence (ANTS 2014), 2014, doi:10.1007/978-3-319-09952-1_15.'
short: 'H. Hamann, G. Valentini, in: Ninth Int. Conf. on Swarm Intelligence (ANTS
2014), Cham, 2014.'
date_created: 2020-10-15T14:13:51Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-09952-1_15
language:
- iso: eng
place: Cham
publication: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)
publication_identifier:
isbn:
- '9783319099514'
- '9783319099521'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary
Lock-ins'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20120'
abstract:
- lang: eng
text: A grand challenge in the field of artificial life is to find a general theory
of emergent self-organizing systems. In swarm systems most of the observed complexity
is based on motion of simple entities. Similarly, statistical mechanics focuses
on collective properties induced by the motion of many interacting particles.
In this article we apply methods from statistical mechanics to swarm systems.
We try to explain the emergent behavior of a simulated swarm by applying methods
based on the fluctuation theorem. Empirical results indicate that swarms are able
to produce negative entropy within an isolated subsystem due to frozen accidents.
Individuals of a swarm are able to locally detect fluctuations of the global entropy
measure and store them, if they are negative entropy productions. By accumulating
these stored fluctuations over time the swarm as a whole is producing negative
entropy and the system ends up in an ordered state. We claim that this indicates
the existence of an inverted fluctuation theorem for emergent self-organizing
dissipative systems. This approach bears the potential of general applicability.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: Hamann H, Schmickl T, Crailsheim K. Analysis of Swarm Behaviors Based on an
Inversion of the Fluctuation Theorem. Artificial Life. 2014;20(1):77-93.
doi:10.1162/ARTL_a_00097
apa: Hamann, H., Schmickl, T., & Crailsheim, K. (2014). Analysis of Swarm Behaviors
Based on an Inversion of the Fluctuation Theorem. Artificial Life, 20(1),
77–93. https://doi.org/10.1162/ARTL_a_00097
bibtex: '@article{Hamann_Schmickl_Crailsheim_2014, title={Analysis of Swarm Behaviors
Based on an Inversion of the Fluctuation Theorem}, volume={20}, DOI={10.1162/ARTL_a_00097},
number={1}, journal={Artificial Life}, author={Hamann, Heiko and Schmickl, Thomas
and Crailsheim, Karl}, year={2014}, pages={77–93} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Analysis of Swarm
Behaviors Based on an Inversion of the Fluctuation Theorem.” Artificial Life
20, no. 1 (2014): 77–93. https://doi.org/10.1162/ARTL_a_00097.'
ieee: H. Hamann, T. Schmickl, and K. Crailsheim, “Analysis of Swarm Behaviors Based
on an Inversion of the Fluctuation Theorem,” Artificial Life, vol. 20,
no. 1, pp. 77–93, 2014.
mla: Hamann, Heiko, et al. “Analysis of Swarm Behaviors Based on an Inversion of
the Fluctuation Theorem.” Artificial Life, vol. 20, no. 1, 2014, pp. 77–93,
doi:10.1162/ARTL_a_00097.
short: H. Hamann, T. Schmickl, K. Crailsheim, Artificial Life 20 (2014) 77–93.
date_created: 2020-10-19T08:41:18Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1162/ARTL_a_00097
intvolume: ' 20'
issue: '1'
language:
- iso: eng
page: 77-93
publication: Artificial Life
status: public
title: Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem
type: journal_article
user_id: '15415'
volume: 20
year: '2014'
...
---
_id: '20121'
abstract:
- lang: eng
text: Collective decision making in self-organized systems is challenging because
it relies on local perception and local communication. Globally defined qualities
such as consensus time and decision accuracy are both difficult to predict and
difficult to guarantee. We present the weighted voter model which implements a
self-organized collective decision making process. We provide an ODE model, a
master equation model (numerically solved by the Gillespie algorithm), and agent-based
simulations of the proposed decision-making strategy. This set of models enables
us to investigate the system behavior in the thermodynamic limit and to investigate
finite-size effects due to random fluctuations. Based on our results, we give
minimum requirements to guarantee consensus on the optimal decision, a minimum
swarm size to guarantee a certain accuracy, and we show that the proposed approach
scales with system size and is robust to noise.
author:
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
- first_name: Alessio
full_name: Lomuscio, Alessio
last_name: Lomuscio
- first_name: Paul
full_name: Scerri, Paul
last_name: Scerri
- first_name: Ana
full_name: Bazzan, Ana
last_name: Bazzan
- first_name: Michael
full_name: Huhns, Michael
last_name: Huhns
citation:
ama: 'Dorigo M, Hamann H, Valentini G, et al. Self-Organized Collective Decision
Making: The Weighted Voter Model. In: Proceedings of the 13th Int. Conf. on
Autonomous Agents and Multiagent Systems (AAMAS 2014). ; 2014.'
apa: 'Dorigo, M., Hamann, H., Valentini, G., Lomuscio, A., Scerri, P., Bazzan, A.,
& Huhns, M. (2014). Self-Organized Collective Decision Making: The Weighted
Voter Model. In Proceedings of the 13th Int. Conf. on Autonomous Agents and
Multiagent Systems (AAMAS 2014).'
bibtex: '@inproceedings{Dorigo_Hamann_Valentini_Lomuscio_Scerri_Bazzan_Huhns_2014,
title={Self-Organized Collective Decision Making: The Weighted Voter Model}, booktitle={Proceedings
of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014)},
author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Lomuscio,
Alessio and Scerri, Paul and Bazzan, Ana and Huhns, Michael}, year={2014} }'
chicago: 'Dorigo, Marco, Heiko Hamann, Gabriele Valentini, Alessio Lomuscio, Paul
Scerri, Ana Bazzan, and Michael Huhns. “Self-Organized Collective Decision Making:
The Weighted Voter Model.” In Proceedings of the 13th Int. Conf. on Autonomous
Agents and Multiagent Systems (AAMAS 2014), 2014.'
ieee: 'M. Dorigo et al., “Self-Organized Collective Decision Making: The
Weighted Voter Model,” in Proceedings of the 13th Int. Conf. on Autonomous
Agents and Multiagent Systems (AAMAS 2014), 2014.'
mla: 'Dorigo, Marco, et al. “Self-Organized Collective Decision Making: The Weighted
Voter Model.” Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent
Systems (AAMAS 2014), 2014.'
short: 'M. Dorigo, H. Hamann, G. Valentini, A. Lomuscio, P. Scerri, A. Bazzan, M.
Huhns, in: Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent
Systems (AAMAS 2014), 2014.'
date_created: 2020-10-19T08:49:05Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent
Systems (AAMAS 2014)
status: public
title: 'Self-Organized Collective Decision Making: The Weighted Voter Model'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20126'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Hamann H. Evolving Prediction Machines: Collective Behaviors Based on Minimal
Surprisal. In: Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014).
; 2014:31-32. doi:10.1145/2598394.2598507'
apa: 'Hamann, H. (2014). Evolving Prediction Machines: Collective Behaviors Based
on Minimal Surprisal. In Int. Conf. on Genetic and Evolutionary Computation
(GECCO 2014) (pp. 31–32). https://doi.org/10.1145/2598394.2598507'
bibtex: '@inproceedings{Hamann_2014, title={Evolving Prediction Machines: Collective
Behaviors Based on Minimal Surprisal}, DOI={10.1145/2598394.2598507},
booktitle={Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)}, author={Hamann,
Heiko}, year={2014}, pages={31–32} }'
chicago: 'Hamann, Heiko. “Evolving Prediction Machines: Collective Behaviors Based
on Minimal Surprisal.” In Int. Conf. on Genetic and Evolutionary Computation
(GECCO 2014), 31–32, 2014. https://doi.org/10.1145/2598394.2598507.'
ieee: 'H. Hamann, “Evolving Prediction Machines: Collective Behaviors Based on Minimal
Surprisal,” in Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014),
2014, pp. 31–32.'
mla: 'Hamann, Heiko. “Evolving Prediction Machines: Collective Behaviors Based on
Minimal Surprisal.” Int. Conf. on Genetic and Evolutionary Computation (GECCO
2014), 2014, pp. 31–32, doi:10.1145/2598394.2598507.'
short: 'H. Hamann, in: Int. Conf. on Genetic and Evolutionary Computation (GECCO
2014), 2014, pp. 31–32.'
date_created: 2020-10-20T07:45:46Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1145/2598394.2598507
language:
- iso: eng
page: 31-32
publication: Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)
status: public
title: 'Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20127'
author:
- first_name: Mauro
full_name: Birattari, Mauro
last_name: Birattari
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Simon
full_name: Garnier, Simon
last_name: Garnier
- first_name: Marco
full_name: Montes de Oca, Marco
last_name: Montes de Oca
- first_name: Christine
full_name: Solnon, Christine
last_name: Solnon
- first_name: Thomas
full_name: Stuetzle, Thomas
last_name: Stuetzle
- first_name: Hongli
full_name: Ding, Hongli
last_name: Ding
citation:
ama: 'Birattari M, Dorigo M, Hamann H, et al. Sorting in Swarm Robots Using Communication-Based
Cluster Size Estimation. In: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014).
Vol 8667. ; 2014:262-269. doi:10.1007/978-3-319-09952-1_25'
apa: Birattari, M., Dorigo, M., Hamann, H., Garnier, S., Montes de Oca, M., Solnon,
C., … Ding, H. (2014). Sorting in Swarm Robots Using Communication-Based Cluster
Size Estimation. In Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)
(Vol. 8667, pp. 262–269). https://doi.org/10.1007/978-3-319-09952-1_25
bibtex: '@inproceedings{Birattari_Dorigo_Hamann_Garnier_Montes de Oca_Solnon_Stuetzle_Ding_2014,
title={Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation},
volume={8667}, DOI={10.1007/978-3-319-09952-1_25},
booktitle={Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}, author={Birattari,
Mauro and Dorigo, Marco and Hamann, Heiko and Garnier, Simon and Montes de Oca,
Marco and Solnon, Christine and Stuetzle, Thomas and Ding, Hongli}, year={2014},
pages={262–269} }'
chicago: Birattari, Mauro, Marco Dorigo, Heiko Hamann, Simon Garnier, Marco Montes
de Oca, Christine Solnon, Thomas Stuetzle, and Hongli Ding. “Sorting in Swarm
Robots Using Communication-Based Cluster Size Estimation.” In Ninth Int. Conf.
on Swarm Intelligence (ANTS 2014), 8667:262–69, 2014. https://doi.org/10.1007/978-3-319-09952-1_25.
ieee: M. Birattari et al., “Sorting in Swarm Robots Using Communication-Based
Cluster Size Estimation,” in Ninth Int. Conf. on Swarm Intelligence (ANTS 2014),
2014, vol. 8667, pp. 262–269.
mla: Birattari, Mauro, et al. “Sorting in Swarm Robots Using Communication-Based
Cluster Size Estimation.” Ninth Int. Conf. on Swarm Intelligence (ANTS 2014),
vol. 8667, 2014, pp. 262–69, doi:10.1007/978-3-319-09952-1_25.
short: 'M. Birattari, M. Dorigo, H. Hamann, S. Garnier, M. Montes de Oca, C. Solnon,
T. Stuetzle, H. Ding, in: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014),
2014, pp. 262–269.'
date_created: 2020-10-20T07:54:18Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-09952-1_25
intvolume: ' 8667'
language:
- iso: eng
page: 262-269
publication: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)
status: public
title: Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation
type: conference
user_id: '15415'
volume: 8667
year: '2014'
...
---
_id: '20128'
author:
- first_name: Yara
full_name: Khaluf, Yara
last_name: Khaluf
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
- first_name: T.
full_name: Bartz-Beielstein, T.
last_name: Bartz-Beielstein
citation:
ama: 'Khaluf Y, Dorigo M, Hamann H, Valentini G, Bartz-Beielstein T. Derivation
of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network
Features Based on Drift Measurements. In: 13th International Conference on
Parallel Problem Solving from Nature (PPSN 2014). Vol 8672. Springer; 2014:181-190.
doi:10.1007/978-3-319-10762-2_18'
apa: 'Khaluf, Y., Dorigo, M., Hamann, H., Valentini, G., & Bartz-Beielstein,
T. (2014). Derivation of a Micro-Macro Link for Collective Decision-Making Systems:
Uncover Network Features Based on Drift Measurements. In 13th International
Conference on Parallel Problem Solving from Nature (PPSN 2014) (Vol. 8672,
pp. 181–190). Springer. https://doi.org/10.1007/978-3-319-10762-2_18'
bibtex: '@inbook{Khaluf_Dorigo_Hamann_Valentini_Bartz-Beielstein_2014, title={Derivation
of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network
Features Based on Drift Measurements}, volume={8672}, DOI={10.1007/978-3-319-10762-2_18},
booktitle={13th International Conference on Parallel Problem Solving from Nature
(PPSN 2014)}, publisher={Springer}, author={Khaluf, Yara and Dorigo, Marco and
Hamann, Heiko and Valentini, Gabriele and Bartz-Beielstein, T.}, year={2014},
pages={181–190} }'
chicago: 'Khaluf, Yara, Marco Dorigo, Heiko Hamann, Gabriele Valentini, and T. Bartz-Beielstein.
“Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover
Network Features Based on Drift Measurements.” In 13th International Conference
on Parallel Problem Solving from Nature (PPSN 2014), 8672:181–90. Springer,
2014. https://doi.org/10.1007/978-3-319-10762-2_18.'
ieee: 'Y. Khaluf, M. Dorigo, H. Hamann, G. Valentini, and T. Bartz-Beielstein, “Derivation
of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network
Features Based on Drift Measurements,” in 13th International Conference on
Parallel Problem Solving from Nature (PPSN 2014), vol. 8672, Springer, 2014,
pp. 181–190.'
mla: 'Khaluf, Yara, et al. “Derivation of a Micro-Macro Link for Collective Decision-Making
Systems: Uncover Network Features Based on Drift Measurements.” 13th International
Conference on Parallel Problem Solving from Nature (PPSN 2014), vol. 8672,
Springer, 2014, pp. 181–90, doi:10.1007/978-3-319-10762-2_18.'
short: 'Y. Khaluf, M. Dorigo, H. Hamann, G. Valentini, T. Bartz-Beielstein, in:
13th International Conference on Parallel Problem Solving from Nature (PPSN 2014),
Springer, 2014, pp. 181–190.'
date_created: 2020-10-20T08:26:59Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-10762-2_18
intvolume: ' 8672'
language:
- iso: eng
page: 181-190
publication: 13th International Conference on Parallel Problem Solving from Nature
(PPSN 2014)
publisher: Springer
status: public
title: 'Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover
Network Features Based on Drift Measurements'
type: book_chapter
user_id: '15415'
volume: 8672
year: '2014'
...
---
_id: '20129'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Hiroki
full_name: Sayama, Hiroki
last_name: Sayama
- first_name: John
full_name: Rieffel, John
last_name: Rieffel
- first_name: Sebastian
full_name: Risi, Sebastian
last_name: Risi
- first_name: Rene
full_name: Doursat, Rene
last_name: Doursat
- first_name: Hod
full_name: Lipson, Hod
last_name: Lipson
citation:
ama: 'Hamann H, Sayama H, Rieffel J, Risi S, Doursat R, Lipson H. Evolution of Collective
Behaviors by Minimizing Surprise. In: 14th Int. Conf. on the Synthesis and
Simulation of Living Systems (ALIFE 2014). MIT Press; 2014:344-351. doi:10.7551/978-0-262-32621-6-ch055'
apa: Hamann, H., Sayama, H., Rieffel, J., Risi, S., Doursat, R., & Lipson, H.
(2014). Evolution of Collective Behaviors by Minimizing Surprise. In 14th Int.
Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014) (pp.
344–351). MIT Press. https://doi.org/10.7551/978-0-262-32621-6-ch055
bibtex: '@inproceedings{Hamann_Sayama_Rieffel_Risi_Doursat_Lipson_2014, title={Evolution
of Collective Behaviors by Minimizing Surprise}, DOI={10.7551/978-0-262-32621-6-ch055},
booktitle={14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE
2014)}, publisher={MIT Press}, author={Hamann, Heiko and Sayama, Hiroki and Rieffel,
John and Risi, Sebastian and Doursat, Rene and Lipson, Hod}, year={2014}, pages={344–351}
}'
chicago: Hamann, Heiko, Hiroki Sayama, John Rieffel, Sebastian Risi, Rene Doursat,
and Hod Lipson. “Evolution of Collective Behaviors by Minimizing Surprise.” In
14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014),
344–51. MIT Press, 2014. https://doi.org/10.7551/978-0-262-32621-6-ch055.
ieee: H. Hamann, H. Sayama, J. Rieffel, S. Risi, R. Doursat, and H. Lipson, “Evolution
of Collective Behaviors by Minimizing Surprise,” in 14th Int. Conf. on the
Synthesis and Simulation of Living Systems (ALIFE 2014), 2014, pp. 344–351.
mla: Hamann, Heiko, et al. “Evolution of Collective Behaviors by Minimizing Surprise.”
14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014),
MIT Press, 2014, pp. 344–51, doi:10.7551/978-0-262-32621-6-ch055.
short: 'H. Hamann, H. Sayama, J. Rieffel, S. Risi, R. Doursat, H. Lipson, in: 14th
Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014), MIT
Press, 2014, pp. 344–351.'
date_created: 2020-10-20T09:02:49Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.7551/978-0-262-32621-6-ch055
language:
- iso: eng
page: 344-351
publication: 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE
2014)
publisher: MIT Press
status: public
title: Evolution of Collective Behaviors by Minimizing Surprise
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20130'
author:
- first_name: Enric
full_name: Cervera, Enric
last_name: Cervera
- first_name: Yara
full_name: Khaluf, Yara
last_name: Khaluf
- first_name: Mauro
full_name: Birattari, Mauro
last_name: Birattari
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Angel P. del
full_name: Pobil, Angel P. del
last_name: Pobil
- first_name: Eris
full_name: Chinellato, Eris
last_name: Chinellato
- first_name: Ester
full_name: Martinez-Martin, Ester
last_name: Martinez-Martin
- first_name: John
full_name: Hallam, John
last_name: Hallam
- first_name: Antonio
full_name: Morales, Antonio
last_name: Morales
citation:
ama: 'Cervera E, Khaluf Y, Birattari M, et al. A Swarm Robotics Approach to Task
Allocation Under Soft Deadlines and Negligible Switching Costs. In: Simulation
of Adaptive Behavior (SAB 2014). Vol 8575. ; 2014:270-279. doi:10.1007/978-3-319-08864-8_26'
apa: Cervera, E., Khaluf, Y., Birattari, M., Hamann, H., Pobil, A. P. del, Chinellato,
E., … Morales, A. (2014). A Swarm Robotics Approach to Task Allocation Under Soft
Deadlines and Negligible Switching Costs. In Simulation of Adaptive Behavior
(SAB 2014) (Vol. 8575, pp. 270–279). https://doi.org/10.1007/978-3-319-08864-8_26
bibtex: '@inproceedings{Cervera_Khaluf_Birattari_Hamann_Pobil_Chinellato_Martinez-Martin_Hallam_Morales_2014,
title={A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible
Switching Costs}, volume={8575}, DOI={10.1007/978-3-319-08864-8_26},
booktitle={Simulation of Adaptive Behavior (SAB 2014)}, author={Cervera, Enric
and Khaluf, Yara and Birattari, Mauro and Hamann, Heiko and Pobil, Angel P. del
and Chinellato, Eris and Martinez-Martin, Ester and Hallam, John and Morales,
Antonio}, year={2014}, pages={270–279} }'
chicago: Cervera, Enric, Yara Khaluf, Mauro Birattari, Heiko Hamann, Angel P. del
Pobil, Eris Chinellato, Ester Martinez-Martin, John Hallam, and Antonio Morales.
“A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible
Switching Costs.” In Simulation of Adaptive Behavior (SAB 2014), 8575:270–79,
2014. https://doi.org/10.1007/978-3-319-08864-8_26.
ieee: E. Cervera et al., “A Swarm Robotics Approach to Task Allocation Under
Soft Deadlines and Negligible Switching Costs,” in Simulation of Adaptive Behavior
(SAB 2014), 2014, vol. 8575, pp. 270–279.
mla: Cervera, Enric, et al. “A Swarm Robotics Approach to Task Allocation Under
Soft Deadlines and Negligible Switching Costs.” Simulation of Adaptive Behavior
(SAB 2014), vol. 8575, 2014, pp. 270–79, doi:10.1007/978-3-319-08864-8_26.
short: 'E. Cervera, Y. Khaluf, M. Birattari, H. Hamann, A.P. del Pobil, E. Chinellato,
E. Martinez-Martin, J. Hallam, A. Morales, in: Simulation of Adaptive Behavior
(SAB 2014), 2014, pp. 270–279.'
date_created: 2020-10-20T09:09:59Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-08864-8_26
intvolume: ' 8575'
language:
- iso: eng
page: 270-279
publication: Simulation of Adaptive Behavior (SAB 2014)
status: public
title: A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible
Switching Costs
type: conference
user_id: '15415'
volume: 8575
year: '2014'
...
---
_id: '368'
abstract:
- lang: eng
text: We consider the problem of scheduling a number of jobs on $m$ identical processors
sharing a continuously divisible resource. Each job j comes with a resource requirement
r_j \in {0,1}. The job can be processed at full speed if granted its full resource
requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction
of the full speed. Our goal is to find a resource assignment that minimizes the
makespan (i.e., the latest completion time). Variants of such problems, relating
the resource assignment of jobs to their \emph{processing speeds}, have been studied
under the term discrete-continuous scheduling. Known results are either very pessimistic
or heuristic in nature.In this paper, we suggest and analyze a slightly simplified
model. It focuses on the assignment of shared continuous resources to the processors.
The job assignment to processors and the ordering of the jobs have already been
fixed. It is shown that, even for unit size jobs, finding an optimal solution
is NP-hard if the number of processors is part of the input. Positive results
for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover,
we prove that balanced schedules yield a 2-1/m-approximation for a fixed number
of processors. Such schedules are computed by our GreedyBalance algorithm, for
which the bound is tight.
author:
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Lars
full_name: Nagel, Lars
last_name: Nagel
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: 'Tim '
full_name: 'Suess, Tim '
last_name: Suess
citation:
ama: 'Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Suess T.
Scheduling Shared Continuous Resources on Many-Cores. In: Proceedings of the
26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
; 2014:128-137. doi:10.1145/2612669.2612698'
apa: Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S.,
& Suess, T. (2014). Scheduling Shared Continuous Resources on Many-Cores.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 128–137. https://doi.org/10.1145/2612669.2612698
bibtex: '@inproceedings{Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Suess_2014,
title={Scheduling Shared Continuous Resources on Many-Cores}, DOI={10.1145/2612669.2612698},
booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Brinkmann, Andre and Kling, Peter and Meyer
auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim },
year={2014}, pages={128–137} }'
chicago: Brinkmann, Andre, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel,
Sören Riechers, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.”
In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 128–37, 2014. https://doi.org/10.1145/2612669.2612698.
ieee: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, and
T. Suess, “Scheduling Shared Continuous Resources on Many-Cores,” in Proceedings
of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2014, pp. 128–137, doi: 10.1145/2612669.2612698.'
mla: Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2014, pp. 128–37, doi:10.1145/2612669.2612698.
short: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, T.
Suess, in: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2014, pp. 128–137.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2612669.2612698
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:17:38Z
date_updated: 2018-03-20T07:17:38Z
file_id: '1403'
file_name: 368-BKMNRS14.pdf
file_size: 485767
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:17:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 128-137
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '370'
abstract:
- lang: eng
text: 'Max-min fairness (MMF) is a widely known approach to a fair allocation of
bandwidth to each of the users in a network. This allocation can be computed by
uniformly raising the bandwidths of all users without violating capacity constraints.
We consider an extension of these allocations by raising the bandwidth with arbitrary
and not necessarily uniform time-depending velocities (allocation rates). These
allocations are used in a game-theoretic context for routing choices, which we
formalize in progressive filling games (PFGs).We present a variety of results
for equilibria in PFGs. We show that these games possess pure Nash and strong
equilibria. While computation in general is NP-hard, there are polynomial-time
algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case
when all users have the same source-destination pair. We characterize prices of
anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when
players have different or the same source-destination pairs. In addition, we show
that when a designer can adjust allocation rates, it is possible to design games
with optimal strong equilibria. Some initial results on polynomial-time algorithms
in this direction are also derived. '
author:
- first_name: Tobias
full_name: Harks, Tobias
last_name: Harks
- first_name: Martin
full_name: Höfer, Martin
last_name: Höfer
- first_name: Kevin
full_name: Schewior, Kevin
last_name: Schewior
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling.
In: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14). ; 2014:352-360. doi:10.1109/TNET.2015.2468571'
apa: Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2014). Routing Games
with Progressive Filling. In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14) (pp. 352–360). https://doi.org/10.1109/TNET.2015.2468571
bibtex: '@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games
with Progressive Filling}, DOI={10.1109/TNET.2015.2468571},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior,
Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }'
chicago: Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing
Games with Progressive Filling.” In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14), 352–60, 2014. https://doi.org/10.1109/TNET.2015.2468571.
ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive
Filling,” in Proceedings of the 33rd Annual IEEE International Conference on
Computer Communications (INFOCOM’14), 2014, pp. 352–360.
mla: Harks, Tobias, et al. “Routing Games with Progressive Filling.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–60, doi:10.1109/TNET.2015.2468571.
short: 'T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd
Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–360.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2015.2468571
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:17:04Z
date_updated: 2018-03-20T07:17:04Z
file_id: '1402'
file_name: 370-HHSS14.pdf
file_size: 179583
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:17:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 352-360
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM'14)
status: public
title: Routing Games with Progressive Filling
type: conference
user_id: '477'
year: '2014'
...
---
_id: '373'
author:
- first_name: David
full_name: Pahl, David
last_name: Pahl
citation:
ama: Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität
Paderborn; 2014.
apa: Pahl, D. (2014). Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn.
bibtex: '@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen},
publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }'
chicago: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
ieee: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
mla: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
short: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Reputationssysteme für zusammengesetzte Dienstleistungen
type: bachelorsthesis
user_id: '14052'
year: '2014'
...
---
_id: '379'
abstract:
- lang: eng
text: In the leasing variant of Set Cover presented by Anthony et al.[1], elements
U arrive over time and must be covered by sets from a familyF of subsets of U.
Each set can be leased for K different periods of time.Let |U| = n and |F| = m.
Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements
for the next lk time steps. The objectiveis to minimize the total cost of the
sets leased, such that elements arrivingat any time t are covered by sets which
contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log
n)-approximation forthe problem in the offline setting, unless P = NP [22]. In
this paper, wegive randomized algorithms for variants of Set Cover Leasing in
the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented
by Alon et al. [2], where elements appear multiple times andmust be covered by
a different set at each arrival. Our results improve theO(log2(mn)) competitive
factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)),
where d is the maximum numberof sets an element belongs to.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms
for Set Cover Leasing Problems. In: Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ;
2014:25-34. doi:10.1007/978-3-319-12691-3_3'
apa: Abshoff, S., Markarian, C., & Meyer auf der Heide, F. (2014). Randomized
Online Algorithms for Set Cover Leasing Problems. In Proceedings of the 8th
Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 25–34). https://doi.org/10.1007/978-3-319-12691-3_3
bibtex: '@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS},
title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={10.1007/978-3-319-12691-3_3},
booktitle={Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide.
“Randomized Online Algorithms for Set Cover Leasing Problems.” In Proceedings
of the 8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 25–34. LNCS, 2014. https://doi.org/10.1007/978-3-319-12691-3_3.
ieee: S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms
for Set Cover Leasing Problems,” in Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp.
25–34.
mla: Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing
Problems.” Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.
short: 'S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2014, pp. 25–34.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-12691-3_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:12:57Z
date_updated: 2018-03-20T07:12:57Z
file_id: '1395'
file_name: 379-COCOA14.pdf
file_size: 214299
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:12:57Z
has_accepted_license: '1'
page: 25-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Randomized Online Algorithms for Set Cover Leasing Problems
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '380'
abstract:
- lang: eng
text: 'Network creation games model the creation and usage costs of networks formed
by n selfish nodes. Each node v can buy a set of edges, each for a fixed price
α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant
et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances
from v to all other nodes plus the prices of the bought edges. The above papers
show the existence of Nash equilibria as well as upper and lower bounds for the
prices of anarchy and stability. In several subsequent papers, these bounds were
improved for a wide range of prices α. In this paper, we extend these models by
incorporating quality-of-service aspects: Each edge cannot only be bought at a
fixed quality (edge length one) for a fixed price α. Instead, we assume that quality
levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series
= {LNCS}'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network
Creation Games. In: Proceedings of the 10th International Conference on Web
and Internet Economics (WINE). ; 2014:423-428. doi:10.1007/978-3-319-13129-0_34'
apa: Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality
of Service in Network Creation Games. In Proceedings of the 10th International
Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34
bibtex: '@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality
of Service in Network Creation Games}, DOI={10.1007/978-3-319-13129-0_34},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer
auf der Heide, Friedhelm}, year={2014}, pages={423–428} }'
chicago: Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide.
“Quality of Service in Network Creation Games.” In Proceedings of the 10th
International Conference on Web and Internet Economics (WINE), 423–28, 2014.
https://doi.org/10.1007/978-3-319-13129-0_34.
ieee: A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service
in Network Creation Games,” in Proceedings of the 10th International Conference
on Web and Internet Economics (WINE), 2014, pp. 423–428.
mla: Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.”
Proceedings of the 10th International Conference on Web and Internet Economics
(WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.
short: 'A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 423–428.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-13129-0_34
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:05:59Z
date_updated: 2018-03-20T07:05:59Z
file_id: '1394'
file_name: 380-WINE2014.pdf
file_size: 166640
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:05:59Z
has_accepted_license: '1'
page: 423-428
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
status: public
title: Quality of Service in Network Creation Games
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '17659'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Stojan
full_name: Trajanovski, Stojan
last_name: Trajanovski
- first_name: Mathijs M.
full_name: de Weerdt, Mathijs M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, Trajanovski S, de Weerdt MM. Nash Equilibria in Shared Effort Games.
In: Proceedings of the 2014 International Conference on Autonomous Agents and
Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for
Autonomous Agents and Multiagent Systems; 2014:861-868.'
apa: 'Polevoy, G., Trajanovski, S., & de Weerdt, M. M. (2014). Nash Equilibria
in Shared Effort Games. In Proceedings of the 2014 International Conference
on Autonomous Agents and Multi-agent Systems (pp. 861–868). Richland, SC:
International Foundation for Autonomous Agents and Multiagent Systems.'
bibtex: '@inproceedings{Polevoy_Trajanovski_de Weerdt_2014, place={Richland, SC},
series={AAMAS ’14}, title={Nash Equilibria in Shared Effort Games}, booktitle={Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-agent Systems},
publisher={International Foundation for Autonomous Agents and Multiagent Systems},
author={Polevoy, Gleb and Trajanovski, Stojan and de Weerdt, Mathijs M.}, year={2014},
pages={861–868}, collection={AAMAS ’14} }'
chicago: 'Polevoy, Gleb, Stojan Trajanovski, and Mathijs M. de Weerdt. “Nash Equilibria
in Shared Effort Games.” In Proceedings of the 2014 International Conference
on Autonomous Agents and Multi-Agent Systems, 861–68. AAMAS ’14. Richland,
SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.'
ieee: G. Polevoy, S. Trajanovski, and M. M. de Weerdt, “Nash Equilibria in Shared
Effort Games,” in Proceedings of the 2014 International Conference on Autonomous
Agents and Multi-agent Systems, 2014, pp. 861–868.
mla: Polevoy, Gleb, et al. “Nash Equilibria in Shared Effort Games.” Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems,
International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp.
861–68.
short: 'G. Polevoy, S. Trajanovski, M.M. de Weerdt, in: Proceedings of the 2014
International Conference on Autonomous Agents and Multi-Agent Systems, International
Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2014, pp.
861–868.'
date_created: 2020-08-06T15:21:26Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- competition
- equilibrium
- market
- models
- shared effort games
- simulation
language:
- iso: eng
page: 861-868
place: Richland, SC
publication: Proceedings of the 2014 International Conference on Autonomous Agents
and Multi-agent Systems
publication_identifier:
isbn:
- 978-1-4503-2738-1
publisher: International Foundation for Autonomous Agents and Multiagent Systems
series_title: AAMAS '14
status: public
title: Nash Equilibria in Shared Effort Games
type: conference
user_id: '83983'
year: '2014'
...
---
_id: '17660'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Mathijs M.
full_name: de Weerdt, Mathijs M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, de Weerdt MM. Improving Human Interaction in Crowdsensing. In:
Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent
Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous
Agents and Multiagent Systems; 2014:1741-1742.'
apa: 'Polevoy, G., & de Weerdt, M. M. (2014). Improving Human Interaction in
Crowdsensing. In Proceedings of the 2014 International Conference on Autonomous
Agents and Multi-agent Systems (pp. 1741–1742). Richland, SC: International
Foundation for Autonomous Agents and Multiagent Systems.'
bibtex: '@inproceedings{Polevoy_de Weerdt_2014, place={Richland, SC}, series={AAMAS
’14}, title={Improving Human Interaction in Crowdsensing}, booktitle={Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-agent Systems},
publisher={International Foundation for Autonomous Agents and Multiagent Systems},
author={Polevoy, Gleb and de Weerdt, Mathijs M.}, year={2014}, pages={1741–1742},
collection={AAMAS ’14} }'
chicago: 'Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction
in Crowdsensing.” In Proceedings of the 2014 International Conference on Autonomous
Agents and Multi-Agent Systems, 1741–42. AAMAS ’14. Richland, SC: International
Foundation for Autonomous Agents and Multiagent Systems, 2014.'
ieee: G. Polevoy and M. M. de Weerdt, “Improving Human Interaction in Crowdsensing,”
in Proceedings of the 2014 International Conference on Autonomous Agents and
Multi-agent Systems, 2014, pp. 1741–1742.
mla: Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction in Crowdsensing.”
Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent
Systems, International Foundation for Autonomous Agents and Multiagent Systems,
2014, pp. 1741–42.
short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 2014 International Conference
on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous
Agents and Multiagent Systems, Richland, SC, 2014, pp. 1741–1742.'
date_created: 2020-08-06T15:21:35Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- dynamics
- emotion modeling
- negotiation
- network interaction
- shared effort game
language:
- iso: eng
page: 1741-1742
place: Richland, SC
publication: Proceedings of the 2014 International Conference on Autonomous Agents
and Multi-agent Systems
publication_identifier:
isbn:
- 978-1-4503-2738-1
publisher: International Foundation for Autonomous Agents and Multiagent Systems
series_title: AAMAS '14
status: public
title: Improving Human Interaction in Crowdsensing
type: conference
user_id: '83983'
year: '2014'
...
---
_id: '17661'
author:
- first_name: Thomas C.
full_name: King, Thomas C.
last_name: King
- first_name: Qingzhi
full_name: Liu, Qingzhi
last_name: Liu
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Mathijs
full_name: de Weerdt, Mathijs
last_name: de Weerdt
- first_name: Virginia
full_name: Dignum, Virginia
last_name: Dignum
- first_name: M. Birna
full_name: van Riemsdijk, M. Birna
last_name: van Riemsdijk
- first_name: Martijn
full_name: Warnier, Martijn
last_name: Warnier
citation:
ama: 'King TC, Liu Q, Polevoy G, et al. Request Driven Social Sensing. In: Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems.
AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent
Systems; 2014:1651-1652.'
apa: 'King, T. C., Liu, Q., Polevoy, G., de Weerdt, M., Dignum, V., van Riemsdijk,
M. B., & Warnier, M. (2014). Request Driven Social Sensing. In Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-agent Systems
(pp. 1651–1652). Richland, SC: International Foundation for Autonomous Agents
and Multiagent Systems.'
bibtex: '@inproceedings{King_Liu_Polevoy_de Weerdt_Dignum_van Riemsdijk_Warnier_2014,
place={Richland, SC}, series={AAMAS ’14}, title={Request Driven Social Sensing},
booktitle={Proceedings of the 2014 International Conference on Autonomous Agents
and Multi-agent Systems}, publisher={International Foundation for Autonomous Agents
and Multiagent Systems}, author={King, Thomas C. and Liu, Qingzhi and Polevoy,
Gleb and de Weerdt, Mathijs and Dignum, Virginia and van Riemsdijk, M. Birna and
Warnier, Martijn}, year={2014}, pages={1651–1652}, collection={AAMAS ’14} }'
chicago: 'King, Thomas C., Qingzhi Liu, Gleb Polevoy, Mathijs de Weerdt, Virginia
Dignum, M. Birna van Riemsdijk, and Martijn Warnier. “Request Driven Social Sensing.”
In Proceedings of the 2014 International Conference on Autonomous Agents and
Multi-Agent Systems, 1651–52. AAMAS ’14. Richland, SC: International Foundation
for Autonomous Agents and Multiagent Systems, 2014.'
ieee: T. C. King et al., “Request Driven Social Sensing,” in Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-agent Systems,
2014, pp. 1651–1652.
mla: King, Thomas C., et al. “Request Driven Social Sensing.” Proceedings of
the 2014 International Conference on Autonomous Agents and Multi-Agent Systems,
International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp.
1651–52.
short: 'T.C. King, Q. Liu, G. Polevoy, M. de Weerdt, V. Dignum, M.B. van Riemsdijk,
M. Warnier, in: Proceedings of the 2014 International Conference on Autonomous
Agents and Multi-Agent Systems, International Foundation for Autonomous Agents
and Multiagent Systems, Richland, SC, 2014, pp. 1651–1652.'
date_created: 2020-08-06T15:21:45Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- crowd-sensing
- crowdsourcing
- data aggregation
- game theory
- norms
- reciprocation
- self interested agents
- simulation
language:
- iso: eng
page: 1651-1652
place: Richland, SC
publication: Proceedings of the 2014 International Conference on Autonomous Agents
and Multi-agent Systems
publication_identifier:
isbn:
- 978-1-4503-2738-1
publisher: International Foundation for Autonomous Agents and Multiagent Systems
series_title: AAMAS '14
status: public
title: Request Driven Social Sensing
type: conference
user_id: '83983'
year: '2014'
...
---
_id: '17662'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Rann
full_name: Smorodinsky, Rann
last_name: Smorodinsky
- first_name: Moshe
full_name: Tennenholtz, Moshe
last_name: Tennenholtz
citation:
ama: Polevoy G, Smorodinsky R, Tennenholtz M. Signaling Competition and Social Welfare.
ACM Trans Econ Comput. 2014;2(1):1:1-1:16. doi:10.1145/2560766
apa: Polevoy, G., Smorodinsky, R., & Tennenholtz, M. (2014). Signaling Competition
and Social Welfare. ACM Trans. Econ. Comput., 2(1), 1:1-1:16. https://doi.org/10.1145/2560766
bibtex: '@article{Polevoy_Smorodinsky_Tennenholtz_2014, title={Signaling Competition
and Social Welfare}, volume={2}, DOI={10.1145/2560766},
number={1}, journal={ACM Trans. Econ. Comput.}, publisher={ACM}, author={Polevoy,
Gleb and Smorodinsky, Rann and Tennenholtz, Moshe}, year={2014}, pages={1:1-1:16}
}'
chicago: 'Polevoy, Gleb, Rann Smorodinsky, and Moshe Tennenholtz. “Signaling Competition
and Social Welfare.” ACM Trans. Econ. Comput. 2, no. 1 (2014): 1:1-1:16.
https://doi.org/10.1145/2560766.'
ieee: G. Polevoy, R. Smorodinsky, and M. Tennenholtz, “Signaling Competition and
Social Welfare,” ACM Trans. Econ. Comput., vol. 2, no. 1, pp. 1:1-1:16,
2014.
mla: Polevoy, Gleb, et al. “Signaling Competition and Social Welfare.” ACM Trans.
Econ. Comput., vol. 2, no. 1, ACM, 2014, pp. 1:1-1:16, doi:10.1145/2560766.
short: G. Polevoy, R. Smorodinsky, M. Tennenholtz, ACM Trans. Econ. Comput. 2 (2014)
1:1-1:16.
date_created: 2020-08-06T15:21:55Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1145/2560766
extern: '1'
intvolume: ' 2'
issue: '1'
keyword:
- Competition
- efficiency
- equilibrium
- market
- social welfare
language:
- iso: eng
page: 1:1-1:16
publication: ACM Trans. Econ. Comput.
publication_identifier:
issn:
- 2167-8375
publisher: ACM
status: public
title: Signaling Competition and Social Welfare
type: journal_article
user_id: '83983'
volume: 2
year: '2014'
...
---
_id: '19039'
author:
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
citation:
ama: 'Petring R. Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen
in Echtzeit. Universität Paderborn; 2014.'
apa: 'Petring, R. (2014). Multi-Algorithmen-Rendering: Darstellung heterogener
3-D-Szenen in Echtzeit. Universität Paderborn.'
bibtex: '@book{Petring_2014, place={Universität Paderborn}, title={Multi-Algorithmen-Rendering:
Darstellung heterogener 3-D-Szenen in Echtzeit}, author={Petring, Ralf}, year={2014}
}'
chicago: 'Petring, Ralf. Multi-Algorithmen-Rendering: Darstellung Heterogener
3-D-Szenen in Echtzeit. Universität Paderborn, 2014.'
ieee: 'R. Petring, Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen
in Echtzeit. Universität Paderborn, 2014.'
mla: 'Petring, Ralf. Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen
in Echtzeit. 2014.'
short: 'R. Petring, Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen
in Echtzeit, Universität Paderborn, 2014.'
date_created: 2020-09-04T13:20:12Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12816
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: 'Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit'
type: dissertation
user_id: '15415'
year: '2014'
...
---
_id: '451'
abstract:
- lang: eng
text: We introduce the concept of budget games. Players choose a set of tasks and
each task has a certain demand on every resource in the game. Each resource has
a budget. If the budget is not enough to satisfy the sum of all demands, it has
to be shared between the tasks. We study strategic budget games, where the budget
is shared proportionally. We also consider a variant in which the order of the
strategic decisions influences the distribution of the budgets. The complexity
of the optimal solution as well as existence, complexity and quality of equilibria
are analysed. Finally, we show that the time an ordered budget game needs to convergence
towards an equilibrium may be exponential.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered
strategic decisions. In: Lavi R, ed. Proceedings of the 7th International Symposium
on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2014:110-121.
doi:10.1007/978-3-662-44803-8_10'
apa: Drees, M., Riechers, S., & Skopalik, A. (2014). Budget-restricted utility
games with ordered strategic decisions. In R. Lavi (Ed.), Proceedings of the
7th International Symposium on Algorithmic Game Theory (SAGT) (pp. 110–121).
https://doi.org/10.1007/978-3-662-44803-8_10
bibtex: '@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer
Science}, title={Budget-restricted utility games with ordered strategic decisions},
DOI={10.1007/978-3-662-44803-8_10},
booktitle={Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Drees, Maximilian and Riechers, Sören and Skopalik, Alexander},
editor={Lavi, RonEditor}, year={2014}, pages={110–121}, collection={Lecture Notes
in Computer Science} }'
chicago: Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted
Utility Games with Ordered Strategic Decisions.” In Proceedings of the 7th
International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi,
110–21. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-662-44803-8_10.
ieee: M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with
ordered strategic decisions,” in Proceedings of the 7th International Symposium
on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.
mla: Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic
Decisions.” Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT), edited by Ron Lavi, 2014, pp. 110–21, doi:10.1007/978-3-662-44803-8_10.
short: 'M. Drees, S. Riechers, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the
7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:07Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-44803-8_10
editor:
- first_name: Ron
full_name: Lavi, Ron
last_name: Lavi
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:25:10Z
date_updated: 2018-03-16T11:25:10Z
file_id: '1344'
file_name: 451-DRS14.pdf
file_size: 283266
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:25:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 110-121
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: Budget-restricted utility games with ordered strategic decisions
type: conference
user_id: '477'
year: '2014'
...
---
_id: '452'
abstract:
- lang: eng
text: Today's networks, like the Internet, do not consist of one but a mixture of
several interconnected networks. Each has individual qualities and hence the performance
of a network node results from the networks' interplay.We introduce a new game
theoretic model capturing the interplay between a high-speed backbone network
and a low-speed general purpose network. In our model, n nodes are connected by
a static network and each node can decide individually to become a gateway node.
A gateway node pays a fixed price for its connection to the high-speed network,
but can utilize the high-speed network to gain communication distance 0 to all
other gateways. Communication distances in the low-speed network are given by
the hop distances. The effective communication distance between any two nodes
then is given by the shortest path, which is possibly improved by using gateways
as shortcuts.Every node v has the objective to minimize its communication costs,
given by the sum (SUM-game) or maximum (MAX-game) of the effective communication
distances from v to all other nodes plus a fixed price \alpha > 0, if it decides
to be a gateway. For both games and different ranges of \alpha, we study the existence
of equilibria, the price of anarchy, and convergence properties of best-response
dynamics.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model
for Multilevel Network Games. In: Lavi R, ed. Proceedings of the 7th International
Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2014:294.'
apa: 'Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Brief
Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT) (p. 294).'
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS},
title={Brief Announcement: A Model for Multilevel Network Games}, booktitle={Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Abshoff,
Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander},
editor={Lavi, RonEditor}, year={2014}, pages={294}, collection={LNCS} }'
chicago: 'Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander
Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited
by Ron Lavi, 294. LNCS, 2014.'
ieee: 'S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement:
A Model for Multilevel Network Games,” in Proceedings of the 7th International
Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.'
mla: 'Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network
Games.” Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT), edited by Ron Lavi, 2014, p. 294.'
short: 'S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p.
294.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:08Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
editor:
- first_name: Ron
full_name: Lavi, Ron
last_name: Lavi
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:24:40Z
date_updated: 2018-03-16T11:24:40Z
file_id: '1343'
file_name: 452-title_multilevel-sagt.pdf
file_size: 84783
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:24:40Z
has_accepted_license: '1'
language:
- iso: eng
page: '294'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: LNCS
status: public
title: 'Brief Announcement: A Model for Multilevel Network Games'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '453'
abstract:
- lang: eng
text: In this paper we study the potential function in congestion games. We consider
both games with non-decreasing cost functions as well as games with non-increasing
utility functions. We show that the value of the potential function $\Phi(\sf
s)$ of any outcome $\sf s$ of a congestion game approximates the optimum potential
value $\Phi(\sf s^*)$ by a factor $\Psi_{\mathcal{F}}$ which only depends on the
set of cost/utility functions $\mathcal{F}$, and an additive term which is bounded
by the sum of the total possible improvements of the players in the outcome $\sf
s$. The significance of this result is twofold. On the one hand it provides \emph{Price-of-Anarchy}-like
results with respect to the potential function. On the other hand, we show that
these approximations can be used to compute $(1+\varepsilon)\cdot\Psi_{\mathcal{F}}$-approximate
pure Nash equilibria for congestion games with non-decreasing cost functions.
For the special case of polynomial cost functions, this significantly improves
the guarantees from Caragiannis et al. [FOCS 2011]. Moreover, our machinery provides
the first guarantees for general latency functions.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Martin
full_name: Gairing, Martin
last_name: Gairing
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion
Games and Approximate Pure Nash Equilibria. In: Proceedings of the 10th International
Conference on Web and Internet Economics (WINE). LNCS. ; 2014:30-43. doi:10.1007/978-3-319-13129-0_3'
apa: Feldotto, M., Gairing, M., & Skopalik, A. (2014). Bounding the Potential
Function in Congestion Games and Approximate Pure Nash Equilibria. In Proceedings
of the 10th International Conference on Web and Internet Economics (WINE)
(pp. 30–43). https://doi.org/10.1007/978-3-319-13129-0_3
bibtex: '@inproceedings{Feldotto_Gairing_Skopalik_2014, series={LNCS}, title={Bounding
the Potential Function in Congestion Games and Approximate Pure Nash Equilibria},
DOI={10.1007/978-3-319-13129-0_3},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Skopalik,
Alexander}, year={2014}, pages={30–43}, collection={LNCS} }'
chicago: Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the
Potential Function in Congestion Games and Approximate Pure Nash Equilibria.”
In Proceedings of the 10th International Conference on Web and Internet Economics
(WINE), 30–43. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_3.
ieee: M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function
in Congestion Games and Approximate Pure Nash Equilibria,” in Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 30–43.
mla: Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games
and Approximate Pure Nash Equilibria.” Proceedings of the 10th International
Conference on Web and Internet Economics (WINE), 2014, pp. 30–43, doi:10.1007/978-3-319-13129-0_3.
short: 'M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International
Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:09Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-13129-0_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:24:11Z
date_updated: 2018-03-16T11:24:11Z
file_id: '1342'
file_name: 453-WINE14FGS.pdf
file_size: 324307
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:24:11Z
has_accepted_license: '1'
page: 30-43
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Teilprojekt A
- _id: '7'
name: SFB 901 - Subprojekt A3
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
series_title: LNCS
status: public
title: Bounding the Potential Function in Congestion Games and Approximate Pure Nash
Equilibria
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '455'
abstract:
- lang: eng
text: We study the existence of approximate pure Nash equilibria in weighted congestion
games and develop techniques to obtain approximate potential functions that prove
the existence of alpha-approximate pure Nash equilibria and the convergence of
alpha-improvement steps. Specifically, we show how to obtain upper bounds for
approximation factor alpha for a given class of cost functions. For example for
concave cost functions the factor is at most 3/2, for quadratic cost functions
it is at most 4/3, and for polynomial cost functions of maximal degree d it is
at at most d + 1. For games with two players we obtain tight bounds which are
as small as for example 1.054 in the case of quadratic cost functions.
author:
- first_name: Christoph
full_name: Hansknecht, Christoph
last_name: Hansknecht
- first_name: Max
full_name: Klimm, Max
last_name: Klimm
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted
congestion games. In: Proceedings of the 17th. International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX). LIPIcs. ; 2014:242-257.
doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242'
apa: Hansknecht, C., Klimm, M., & Skopalik, A. (2014). Approximate pure Nash
equilibria in weighted congestion games. In Proceedings of the 17th. International
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)
(pp. 242–257). https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242
bibtex: '@inproceedings{Hansknecht_Klimm_Skopalik_2014, series={LIPIcs}, title={Approximate
pure Nash equilibria in weighted congestion games}, DOI={10.4230/LIPIcs.APPROX-RANDOM.2014.242},
booktitle={Proceedings of the 17th. International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems (APPROX)}, author={Hansknecht, Christoph
and Klimm, Max and Skopalik, Alexander}, year={2014}, pages={242–257}, collection={LIPIcs}
}'
chicago: Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate
Pure Nash Equilibria in Weighted Congestion Games.” In Proceedings of the 17th.
International Workshop on Approximation Algorithms for Combinatorial Optimization
Problems (APPROX), 242–57. LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242.
ieee: C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria
in weighted congestion games,” in Proceedings of the 17th. International Workshop
on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),
2014, pp. 242–257.
mla: Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted
Congestion Games.” Proceedings of the 17th. International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–57,
doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242.
short: 'C. Hansknecht, M. Klimm, A. Skopalik, in: Proceedings of the 17th. International
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),
2014, pp. 242–257.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:09Z
ddc:
- '040'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.APPROX-RANDOM.2014.242
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:23:40Z
date_updated: 2018-03-16T11:23:40Z
file_id: '1341'
file_name: 455-HKS14.pdf
file_size: 512712
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:23:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 242 - 257
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 17th. International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems (APPROX)
series_title: LIPIcs
status: public
title: Approximate pure Nash equilibria in weighted congestion games
type: conference
user_id: '477'
year: '2014'
...
---
_id: '456'
abstract:
- lang: eng
text: We study the existence of approximate pure Nash equilibriain social context
congestion games. For any given set of allowed costfunctions F, we provide a threshold
value μ(F), and show that for theclass of social context congestion games with
cost functions from F, α-Nash dynamics are guaranteed to converge to α-approximate
pure Nashequilibrium if and only if α > μ(F).Interestingly, μ(F) is related and
always upper bounded by Roughgarden’sanarchy value [19].
author:
- first_name: Martin
full_name: Gairing, Martin
last_name: Gairing
- first_name: Grammateia
full_name: Kotsialou, Grammateia
last_name: Kotsialou
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social
Context Congestion Games. In: Proceedings of the 10th International Conference
on Web and Internet Economics (WINE). LNCS. ; 2014:480-485. doi:10.1007/978-3-319-13129-0_43'
apa: Gairing, M., Kotsialou, G., & Skopalik, A. (2014). Approximate pure Nash
equilibria in Social Context Congestion Games. In Proceedings of the 10th International
Conference on Web and Internet Economics (WINE) (pp. 480–485). https://doi.org/10.1007/978-3-319-13129-0_43
bibtex: '@inproceedings{Gairing_Kotsialou_Skopalik_2014, series={LNCS}, title={Approximate
pure Nash equilibria in Social Context Congestion Games}, DOI={10.1007/978-3-319-13129-0_43},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Gairing, Martin and Kotsialou, Grammateia and Skopalik,
Alexander}, year={2014}, pages={480–485}, collection={LNCS} }'
chicago: Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate
Pure Nash Equilibria in Social Context Congestion Games.” In Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 480–85.
LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_43.
ieee: M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria
in Social Context Congestion Games,” in Proceedings of the 10th International
Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.
mla: Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context
Congestion Games.” Proceedings of the 10th International Conference on Web
and Internet Economics (WINE), 2014, pp. 480–85, doi:10.1007/978-3-319-13129-0_43.
short: 'M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International
Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:10Z
ddc:
- '040'
department:
- _id: '541'
- _id: '63'
doi: 10.1007/978-3-319-13129-0_43
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:22:57Z
date_updated: 2018-03-16T11:22:57Z
file_id: '1340'
file_name: 456-WINE14final.pdf
file_size: 377378
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:22:57Z
has_accepted_license: '1'
language:
- iso: eng
page: 480 - 485
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
series_title: LNCS
status: public
title: Approximate pure Nash equilibria in Social Context Congestion Games
type: conference
user_id: '477'
year: '2014'
...
---
_id: '459'
abstract:
- lang: eng
text: In this survey article, we discuss two algorithmic research areas that emerge
from problems that arise when resources are offered in the cloud. The first area,
online leasing, captures problems arising from the fact that resources in the
cloud are not bought, but leased by cloud vendors. The second area, Distributed
Storage Systems, deals with problems arising from so-called cloud federations,
i.e., when several cloud providers are needed to fulfill a given task.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic
Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO).
LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1'
apa: Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler,
C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings
of the 21st International Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1
bibtex: '@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014,
series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud},
DOI={10.1007/978-3-319-09620-9_1},
booktitle={Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014},
pages={1–13}, collection={LNCS} }'
chicago: Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide,
and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.”
In Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1.
ieee: S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic
Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO),
2014, pp. 1–13.
mla: Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management
in the Cloud.” Proceedings of the 21st International Colloquium on Structural
Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
short: 'S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in:
Proceedings of the 21st International Colloquium on Structural Information and
Communication Complexity (SIROCCO), 2014, pp. 1–13.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-319-09620-9_1
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:21:54Z
date_updated: 2018-03-16T11:21:54Z
file_id: '1338'
file_name: 459-SIROCCO2014.pdf
file_size: 274496
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:21:54Z
has_accepted_license: '1'
page: 1-13
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)
series_title: LNCS
status: public
title: Algorithmic Aspects of Resource Management in the Cloud
type: conference
user_id: '477'
year: '2014'
...
---
_id: '462'
abstract:
- lang: eng
text: We discuss a technique to analyze complex infinitely repeated games using
techniques from the fields of game theory and simulations. Our research is motivated
by the analysis of electronic markets with thousands of participants and possibly
complex strategic behavior. We consider an example of a global market of composed
IT services to demonstrate the use of our simulation technique. We present our
current work in this area and we want to discuss further approaches for the future.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely
Repeated Games. In: Proceedings of the 4th International Conference on Simulation
and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014).
; 2014:625-630. doi:10.5220/0005110406250630'
apa: Feldotto, M., & Skopalik, A. (2014). A Simulation Framework for Analyzing
Complex Infinitely Repeated Games. In Proceedings of the 4th International
Conference on Simulation and Modeling Methodologies, Technologies and Applications
(SIMULTECH 2014) (pp. 625–630). https://doi.org/10.5220/0005110406250630
bibtex: '@inproceedings{Feldotto_Skopalik_2014, title={A Simulation Framework for
Analyzing Complex Infinitely Repeated Games}, DOI={10.5220/0005110406250630},
booktitle={Proceedings of the 4th International Conference on Simulation and Modeling
Methodologies, Technologies and Applications (SIMULTECH 2014)}, author={Feldotto,
Matthias and Skopalik, Alexander}, year={2014}, pages={625–630} }'
chicago: Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for
Analyzing Complex Infinitely Repeated Games.” In Proceedings of the 4th International
Conference on Simulation and Modeling Methodologies, Technologies and Applications
(SIMULTECH 2014), 625–30, 2014. https://doi.org/10.5220/0005110406250630.
ieee: M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex
Infinitely Repeated Games,” in Proceedings of the 4th International Conference
on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH
2014), 2014, pp. 625–630.
mla: Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing
Complex Infinitely Repeated Games.” Proceedings of the 4th International Conference
on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH
2014), 2014, pp. 625–30, doi:10.5220/0005110406250630.
short: 'M. Feldotto, A. Skopalik, in: Proceedings of the 4th International Conference
on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH
2014), 2014, pp. 625–630.'
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:15Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.5220/0005110406250630
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:21:24Z
date_updated: 2018-03-16T11:21:24Z
file_id: '1337'
file_name: 462-FS2014SIMULTECH.pdf
file_size: 993721
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:21:24Z
has_accepted_license: '1'
page: 625-630
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Teilprojekt A
- _id: '7'
name: SFB 901 - Subprojekt A3
publication: Proceedings of the 4th International Conference on Simulation and Modeling
Methodologies, Technologies and Applications (SIMULTECH 2014)
status: public
title: A Simulation Framework for Analyzing Complex Infinitely Repeated Games
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '395'
abstract:
- lang: eng
text: We consider a multilevel network game, where nodes can improvetheir communication
costs by connecting to a high-speed network.The n nodes are connected by a static
network and each node can decideindividually to become a gateway to the high-speed
network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game)
ormaximum (MAX-game) of communication distances from v to all othernodes plus
a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication
distance is 0, and gateways also improve othernodes’ distances by behaving as
shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is
Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1))
the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game,
weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1.
Given a graph with girth of at least 4α, equilibria always exist.Concerning the
dynamics, both games are not potential games. For theSUM-game, we even show that
it is not weakly acyclic.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games.
In: Proceedings of the 10th International Conference on Web and Internet Economics
(WINE). LNCS. ; 2014:435-440. doi:10.1007/978-3-319-13129-0_36'
apa: Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Multilevel
Network Games. In Proceedings of the 10th International Conference on Web and
Internet Economics (WINE) (pp. 435–440). https://doi.org/10.1007/978-3-319-13129-0_36
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS},
title={Multilevel Network Games}, DOI={10.1007/978-3-319-13129-0_36},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung,
Daniel and Skopalik, Alexander}, year={2014}, pages={435–440}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik.
“Multilevel Network Games.” In Proceedings of the 10th International Conference
on Web and Internet Economics (WINE), 435–40. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_36.
ieee: S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network
Games,” in Proceedings of the 10th International Conference on Web and Internet
Economics (WINE), 2014, pp. 435–440.
mla: Abshoff, Sebastian, et al. “Multilevel Network Games.” Proceedings of the
10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 435–40, doi:10.1007/978-3-319-13129-0_36.
short: 'S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the
10th International Conference on Web and Internet Economics (WINE), 2014, pp.
435–440.'
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T06:59:59Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-13129-0_36
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T06:59:20Z
date_updated: 2018-03-20T06:59:20Z
file_id: '1382'
file_name: 395-WINE2014ACJS.pdf
file_size: 161479
relation: main_file
success: 1
file_date_updated: 2018-03-20T06:59:20Z
has_accepted_license: '1'
language:
- iso: eng
page: 435-440
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
series_title: LNCS
status: public
title: Multilevel Network Games
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '412'
abstract:
- lang: eng
text: In this paper we present and analyze HSkip+, a self-stabilizing overlay network
for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology
as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization
mechanism significantly outperforms the self-stabilization mechanism proposed
for Skip+. Also, the nodes are now ordered according to their bandwidths and not
according to their identifiers. Various other solutions have already been proposed
for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing.
In addition to HSkip+ being self-stabilizing, its performance is on par with the
best previous bounds on the time and work for joining or leaving a network of
peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation
and congestion for routing messages is on par with the best previous bounds for
such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical
investigations are backed by simulations demonstrating that HSkip+ is indeed performing
much better than Skip+ and working correctly under high churn rates.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network
for Nodes with Heterogeneous Bandwidths. In: Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300'
apa: 'Feldotto, M., Scheideler, C., & Graffi, K. (2014). HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of
the 14th IEEE International Conference on Peer-to-Peer Computing (P2P) (pp.
1–10). https://doi.org/10.1109/P2P.2014.6934300'
bibtex: '@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={10.1109/P2P.2014.6934300},
booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi,
Kalman}, year={2014}, pages={1–10} }'
chicago: 'Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+:
A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In
Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing
(P2P), 1–10, 2014. https://doi.org/10.1109/P2P.2014.6934300.'
ieee: 'M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay
Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th
IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
mla: 'Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for
Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.'
short: 'M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE
International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:20Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1109/P2P.2014.6934300
external_id:
arxiv:
- '1408.0395'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:34:00Z
date_updated: 2018-03-16T11:34:00Z
file_id: '1361'
file_name: 412-FSG2014P2P.pdf
file_size: 472321
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:34:00Z
has_accepted_license: '1'
page: 1-10
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)
status: public
title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths'
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '431'
abstract:
- lang: eng
text: In meiner Dissertation besch{\"a}ftige ich mich mit dem Entwurf und der Analyse
energieeffizienter Schedulingalgorithmen, insbesondere f{\"u}r sogenannte Speed-Scaling
Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW!
und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren
zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen
solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\"u}ckzuf{\"u}hren.
Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor
der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\"o}ße fristgerecht
abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch
des Prozessors wird durch eine konvexe Funktion $\POW\colon\R_{\geq0}\to\R_{\geq0}$
modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine
Dissertation betrachtet verschiedene Varianten des urspr{\"u}nglichen Speed-Scaling
Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden
und erstrecken sich {\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel
3 und 4 betrachten verschiedene \emph{Price-Collecting} Varianten des Originalproblems.
Hier d{\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\"a}ngige
Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar
guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen
bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren
Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine
Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs
betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen
Forschungsfragen in diesem Gebiet dar. F{\"u}r eine relaxierte Form dieser Frage
entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\"a}t.-
Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht
direkt zur Speed-Scaling Literatur z{\"a}hlt. Hier geht es stattdessen um ein
allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen
eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\"a}t
des Problems und entwerfe verschiedene Approximationsalgorithmen.
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
citation:
ama: Kling P. Energy-Efficient Scheduling Algorithms. Universität Paderborn;
2014.
apa: Kling, P. (2014). Energy-efficient Scheduling Algorithms. Universität
Paderborn.
bibtex: '@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität
Paderborn}, author={Kling, Peter}, year={2014} }'
chicago: Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität
Paderborn, 2014.
ieee: P. Kling, Energy-efficient Scheduling Algorithms. Universität Paderborn,
2014.
mla: Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität Paderborn,
2014.
short: P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn,
2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:52Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:31:29Z
date_updated: 2018-03-16T11:31:29Z
file_id: '1356'
file_name: 431-Peter_Kling_PhDThesis_01.pdf
file_size: 792106
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:31:29Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Energy-efficient Scheduling Algorithms
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '435'
abstract:
- lang: eng
text: We give a polynomial time algorithm to compute an optimal energy and fractional
weighted flow trade-off schedule for a speed-scalable processor with discrete
speeds.Our algorithm uses a geometric approach that is based on structural properties
obtained from a primal-dual formulation of the problem.
author:
- first_name: Antonios
full_name: Antoniadis, Antonios
last_name: Antoniadis
- first_name: Neal
full_name: Barcelo, Neal
last_name: Barcelo
- first_name: Mario
full_name: Consuegra, Mario
last_name: Consuegra
- first_name: Peer
full_name: Kling, Peer
last_name: Kling
- first_name: Michael
full_name: Nugent, Michael
last_name: Nugent
- first_name: Kirk
full_name: Pruhs, Kirk
last_name: Pruhs
- first_name: Michele
full_name: Scquizzato, Michele
last_name: Scquizzato
citation:
ama: 'Antoniadis A, Barcelo N, Consuegra M, et al. Efficient Computation of Optimal
Energy and Fractional Weighted Flow Trade-off Schedules. In: Proceedings of
the 31st Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs.
; 2014:63--74. doi:10.4230/LIPIcs.STACS.2014.63'
apa: Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K.,
& Scquizzato, M. (2014). Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules. In Proceedings of the 31st Symposium on
Theoretical Aspects of Computer Science (STACS) (pp. 63--74). https://doi.org/10.4230/LIPIcs.STACS.2014.63
bibtex: '@inproceedings{Antoniadis_Barcelo_Consuegra_Kling_Nugent_Pruhs_Scquizzato_2014,
series={LIPIcs}, title={Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules}, DOI={10.4230/LIPIcs.STACS.2014.63},
booktitle={Proceedings of the 31st Symposium on Theoretical Aspects of Computer
Science (STACS)}, author={Antoniadis, Antonios and Barcelo, Neal and Consuegra,
Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele},
year={2014}, pages={63--74}, collection={LIPIcs} }'
chicago: Antoniadis, Antonios, Neal Barcelo, Mario Consuegra, Peer Kling, Michael
Nugent, Kirk Pruhs, and Michele Scquizzato. “Efficient Computation of Optimal
Energy and Fractional Weighted Flow Trade-off Schedules.” In Proceedings of
the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 63--74.
LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.STACS.2014.63.
ieee: A. Antoniadis et al., “Efficient Computation of Optimal Energy and
Fractional Weighted Flow Trade-off Schedules,” in Proceedings of the 31st Symposium
on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74.
mla: Antoniadis, Antonios, et al. “Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules.” Proceedings of the 31st Symposium on Theoretical
Aspects of Computer Science (STACS), 2014, pp. 63--74, doi:10.4230/LIPIcs.STACS.2014.63.
short: 'A. Antoniadis, N. Barcelo, M. Consuegra, P. Kling, M. Nugent, K. Pruhs,
M. Scquizzato, in: Proceedings of the 31st Symposium on Theoretical Aspects of
Computer Science (STACS), 2014, pp. 63--74.'
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:58Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2014.63
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:30:23Z
date_updated: 2018-03-16T11:30:23Z
file_id: '1354'
file_name: 435-Kling_C2_STACS2014.pdf
file_size: 525851
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:30:23Z
has_accepted_license: '1'
language:
- iso: eng
page: 63--74
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 31st Symposium on Theoretical Aspects of Computer
Science (STACS)
series_title: LIPIcs
status: public
title: Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off
Schedules
type: conference
user_id: '477'
year: '2014'
...
---
_id: '16870'
citation:
ama: 'Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013. Vol 8243. Berlin, Heidelberg: Springer; 2014. doi:10.1007/978-3-642-45346-5'
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2014). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013 (Vol. 8243). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-45346-5'
bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2014, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Algorithms for Sensor Systems
- 9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013}, volume={8243},
DOI={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2014}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics, {ALGOSENSORS} 2013. Vol. 8243. Lecture Notes in Computer Science.
Berlin, Heidelberg: Springer, 2014. https://doi.org/10.1007/978-3-642-45346-5.'
ieee: 'P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, vol. 8243. Berlin, Heidelberg: Springer, 2014.'
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics, {ALGOSENSORS} 2013. Vol. 8243, Springer, 2014, doi:10.1007/978-3-642-45346-5.
short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Springer, Berlin, Heidelberg, 2014.
date_created: 2020-04-27T10:31:57Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
full_name: Flocchini, Paola
last_name: Flocchini
- first_name: Jie
full_name: Gao, Jie
last_name: Gao
- first_name: Evangelos
full_name: Kranakis, Evangelos
last_name: Kranakis
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 8243'
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642453458'
- '9783642453465'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013
type: book_editor
user_id: '15415'
volume: 8243
year: '2014'
...
---
_id: '16394'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Lukovszki T, Meyer auf der Heide F. Fast Collisionless Pattern Formation by
Anonymous, Position-Aware Robots. In: Lecture Notes in Computer Science.
Cham; 2014. doi:10.1007/978-3-319-14472-6_17'
apa: Lukovszki, T., & Meyer auf der Heide, F. (2014). Fast Collisionless Pattern
Formation by Anonymous, Position-Aware Robots. In Lecture Notes in Computer
Science. Cham. https://doi.org/10.1007/978-3-319-14472-6_17
bibtex: '@inbook{Lukovszki_Meyer auf der Heide_2014, place={Cham}, title={Fast Collisionless
Pattern Formation by Anonymous, Position-Aware Robots}, DOI={10.1007/978-3-319-14472-6_17},
booktitle={Lecture Notes in Computer Science}, author={Lukovszki, Tamás and Meyer
auf der Heide, Friedhelm}, year={2014} }'
chicago: Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless
Pattern Formation by Anonymous, Position-Aware Robots.” In Lecture Notes in
Computer Science. Cham, 2014. https://doi.org/10.1007/978-3-319-14472-6_17.
ieee: T. Lukovszki and F. Meyer auf der Heide, “Fast Collisionless Pattern Formation
by Anonymous, Position-Aware Robots,” in Lecture Notes in Computer Science,
Cham, 2014.
mla: Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern
Formation by Anonymous, Position-Aware Robots.” Lecture Notes in Computer Science,
2014, doi:10.1007/978-3-319-14472-6_17.
short: 'T. Lukovszki, F. Meyer auf der Heide, in: Lecture Notes in Computer Science,
Cham, 2014.'
date_created: 2020-04-03T07:58:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-14472-6_17
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783319144719'
- '9783319144726'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
type: book_chapter
user_id: '15415'
year: '2014'
...
---
_id: '16395'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Meyer auf der Heide F. Continuous Aggregation in Dynamic Ad-Hoc
Networks. In: Structural Information and Communication Complexity. Cham;
2014. doi:10.1007/978-3-319-09620-9_16'
apa: Abshoff, S., & Meyer auf der Heide, F. (2014). Continuous Aggregation in
Dynamic Ad-Hoc Networks. In Structural Information and Communication Complexity.
Cham. https://doi.org/10.1007/978-3-319-09620-9_16
bibtex: '@inbook{Abshoff_Meyer auf der Heide_2014, place={Cham}, title={Continuous
Aggregation in Dynamic Ad-Hoc Networks}, DOI={10.1007/978-3-319-09620-9_16},
booktitle={Structural Information and Communication Complexity}, author={Abshoff,
Sebastian and Meyer auf der Heide, Friedhelm}, year={2014} }'
chicago: Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation
in Dynamic Ad-Hoc Networks.” In Structural Information and Communication Complexity.
Cham, 2014. https://doi.org/10.1007/978-3-319-09620-9_16.
ieee: S. Abshoff and F. Meyer auf der Heide, “Continuous Aggregation in Dynamic
Ad-Hoc Networks,” in Structural Information and Communication Complexity,
Cham, 2014.
mla: Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation
in Dynamic Ad-Hoc Networks.” Structural Information and Communication Complexity,
2014, doi:10.1007/978-3-319-09620-9_16.
short: 'S. Abshoff, F. Meyer auf der Heide, in: Structural Information and Communication
Complexity, Cham, 2014.'
date_created: 2020-04-03T09:00:16Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-09620-9_16
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783319096193'
- '9783319096209'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Continuous Aggregation in Dynamic Ad-Hoc Networks
type: book_chapter
user_id: '15415'
year: '2014'
...
---
_id: '19981'
author:
- first_name: Bärbel
full_name: Mertsching, Bärbel
last_name: Mertsching
- first_name: Mohammad
full_name: Divband Soorati, Mohammad
last_name: Divband Soorati
- first_name: Tobias
full_name: Kotthauser, Tobias
last_name: Kotthauser
citation:
ama: Mertsching B, Divband Soorati M, Kotthauser T. Automatic Reconstruction of
Polygonal Room Models from 3D Point Clouds. IEEE International Conference on
Robotics and Biomimetics (ROBIO). 2013:661-667.
apa: Mertsching, B., Divband Soorati, M., & Kotthauser, T. (2013). Automatic
Reconstruction of Polygonal Room Models from 3D Point Clouds. IEEE International
Conference on Robotics and Biomimetics (ROBIO), 661–667.
bibtex: '@article{Mertsching_Divband Soorati_Kotthauser_2013, title={Automatic Reconstruction
of Polygonal Room Models from 3D Point Clouds}, journal={IEEE International Conference
on Robotics and Biomimetics (ROBIO)}, author={Mertsching, Bärbel and Divband Soorati,
Mohammad and Kotthauser, Tobias}, year={2013}, pages={661–667} }'
chicago: Mertsching, Bärbel, Mohammad Divband Soorati, and Tobias Kotthauser. “Automatic
Reconstruction of Polygonal Room Models from 3D Point Clouds.” IEEE International
Conference on Robotics and Biomimetics (ROBIO), 2013, 661–67.
ieee: B. Mertsching, M. Divband Soorati, and T. Kotthauser, “Automatic Reconstruction
of Polygonal Room Models from 3D Point Clouds,” IEEE International Conference
on Robotics and Biomimetics (ROBIO), pp. 661–667, 2013.
mla: Mertsching, Bärbel, et al. “Automatic Reconstruction of Polygonal Room Models
from 3D Point Clouds.” IEEE International Conference on Robotics and Biomimetics
(ROBIO), 2013, pp. 661–67.
short: B. Mertsching, M. Divband Soorati, T. Kotthauser, IEEE International Conference
on Robotics and Biomimetics (ROBIO) (2013) 661–667.
date_created: 2020-10-12T13:21:53Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 661-667
publication: IEEE International Conference on Robotics and Biomimetics (ROBIO)
status: public
title: Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds
type: journal_article
user_id: '15415'
year: '2013'
...
---
_id: '20148'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Istvan
full_name: Karsai, Istvan
last_name: Karsai
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
citation:
ama: 'Hamann H, Karsai I, Schmickl T. Time delay implies cost on task switching:
A model to investigate the efficiency of task partitioning. Bulletin of Mathematical
Biology. 2013;75(7):1181-1206. doi:10.1007/s11538-013-9851-4 '
apa: 'Hamann, H., Karsai, I., & Schmickl, T. (2013). Time delay implies cost
on task switching: A model to investigate the efficiency of task partitioning.
Bulletin of Mathematical Biology, 75(7), 1181–1206. https://doi.org/10.1007/s11538-013-9851-4 '
bibtex: '@article{Hamann_Karsai_Schmickl_2013, title={Time delay implies cost on
task switching: A model to investigate the efficiency of task partitioning}, volume={75},
DOI={10.1007/s11538-013-9851-4
}, number={7}, journal={Bulletin of Mathematical Biology}, author={Hamann,
Heiko and Karsai, Istvan and Schmickl, Thomas}, year={2013}, pages={1181–1206}
}'
chicago: 'Hamann, Heiko, Istvan Karsai, and Thomas Schmickl. “Time Delay Implies
Cost on Task Switching: A Model to Investigate the Efficiency of Task Partitioning.”
Bulletin of Mathematical Biology 75, no. 7 (2013): 1181–1206. https://doi.org/10.1007/s11538-013-9851-4 .'
ieee: 'H. Hamann, I. Karsai, and T. Schmickl, “Time delay implies cost on task switching:
A model to investigate the efficiency of task partitioning,” Bulletin of Mathematical
Biology, vol. 75, no. 7, pp. 1181–1206, 2013.'
mla: 'Hamann, Heiko, et al. “Time Delay Implies Cost on Task Switching: A Model
to Investigate the Efficiency of Task Partitioning.” Bulletin of Mathematical
Biology, vol. 75, no. 7, 2013, pp. 1181–206, doi:10.1007/s11538-013-9851-4 .'
short: H. Hamann, I. Karsai, T. Schmickl, Bulletin of Mathematical Biology 75 (2013)
1181–1206.
date_created: 2020-10-21T08:41:17Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: '10.1007/s11538-013-9851-4 '
intvolume: ' 75'
issue: '7'
language:
- iso: eng
page: 1181-1206
publication: Bulletin of Mathematical Biology
status: public
title: 'Time delay implies cost on task switching: A model to investigate the efficiency
of task partitioning'
type: journal_article
user_id: '15415'
volume: 75
year: '2013'
...
---
_id: '20150'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
- first_name: Ronald
full_name: Thenius, Ronald
last_name: Thenius
- first_name: Payam
full_name: Zahadat, Payam
last_name: Zahadat
citation:
ama: Hamann H, Schmickl T, Stradner J, Crailsheim K, Thenius R, Zahadat P. Algorithmic
Requirements for Swarm Intelligence in Differently Coupled Collective Systems.
Chaos, Solitons & Fractals. 2013;50:100-114. doi:10.1016/j.chaos.2013.01.011
apa: Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., Thenius, R., &
Zahadat, P. (2013). Algorithmic Requirements for Swarm Intelligence in Differently
Coupled Collective Systems. Chaos, Solitons & Fractals, 50,
100–114. https://doi.org/10.1016/j.chaos.2013.01.011
bibtex: '@article{Hamann_Schmickl_Stradner_Crailsheim_Thenius_Zahadat_2013, title={Algorithmic
Requirements for Swarm Intelligence in Differently Coupled Collective Systems},
volume={50}, DOI={10.1016/j.chaos.2013.01.011},
journal={Chaos, Solitons & Fractals}, author={Hamann, Heiko and Schmickl,
Thomas and Stradner, Jürgen and Crailsheim, Karl and Thenius, Ronald and Zahadat,
Payam}, year={2013}, pages={100–114} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, Ronald
Thenius, and Payam Zahadat. “Algorithmic Requirements for Swarm Intelligence in
Differently Coupled Collective Systems.” Chaos, Solitons & Fractals
50 (2013): 100–114. https://doi.org/10.1016/j.chaos.2013.01.011.'
ieee: H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, and P. Zahadat,
“Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective
Systems,” Chaos, Solitons & Fractals, vol. 50, pp. 100–114, 2013.
mla: Hamann, Heiko, et al. “Algorithmic Requirements for Swarm Intelligence in Differently
Coupled Collective Systems.” Chaos, Solitons & Fractals, vol. 50, 2013,
pp. 100–14, doi:10.1016/j.chaos.2013.01.011.
short: H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, P. Zahadat,
Chaos, Solitons & Fractals 50 (2013) 100–114.
date_created: 2020-10-21T08:46:02Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1016/j.chaos.2013.01.011
intvolume: ' 50'
language:
- iso: eng
page: 100-114
publication: Chaos, Solitons & Fractals
status: public
title: Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective
Systems
type: journal_article
user_id: '15415'
volume: 50
year: '2013'
...
---
_id: '20151'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Christopher
full_name: Schwarzer, Christopher
last_name: Schwarzer
- first_name: Nico K.
full_name: Michiels, Nico K.
last_name: Michiels
- first_name: Anna Isabel
full_name: Esparcia-Alcazar, Anna Isabel
last_name: Esparcia-Alcazar
citation:
ama: 'Hamann H, Schmickl T, Stradner J, Schwarzer C, Michiels NK, Esparcia-Alcazar
AI. Virtual Spatiality in Agent Controllers: Encoding Compartmentalization. In:
Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013). Vol 7835. ; 2013:579-588. doi:10.1007/978-3-642-37192-9_58'
apa: 'Hamann, H., Schmickl, T., Stradner, J., Schwarzer, C., Michiels, N. K., &
Esparcia-Alcazar, A. I. (2013). Virtual Spatiality in Agent Controllers: Encoding
Compartmentalization. In Applications of Evolutionary Computation - 16th European
Conference (EvoApplications 2013) (Vol. 7835, pp. 579–588). https://doi.org/10.1007/978-3-642-37192-9_58'
bibtex: '@inproceedings{Hamann_Schmickl_Stradner_Schwarzer_Michiels_Esparcia-Alcazar_2013,
title={Virtual Spatiality in Agent Controllers: Encoding Compartmentalization},
volume={7835}, DOI={10.1007/978-3-642-37192-9_58},
booktitle={Applications of Evolutionary Computation - 16th European Conference
(EvoApplications 2013)}, author={Hamann, Heiko and Schmickl, Thomas and Stradner,
Jürgen and Schwarzer, Christopher and Michiels, Nico K. and Esparcia-Alcazar,
Anna Isabel}, year={2013}, pages={579–588} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Christopher Schwarzer,
Nico K. Michiels, and Anna Isabel Esparcia-Alcazar. “Virtual Spatiality in Agent
Controllers: Encoding Compartmentalization.” In Applications of Evolutionary
Computation - 16th European Conference (EvoApplications 2013), 7835:579–88,
2013. https://doi.org/10.1007/978-3-642-37192-9_58.'
ieee: 'H. Hamann, T. Schmickl, J. Stradner, C. Schwarzer, N. K. Michiels, and A.
I. Esparcia-Alcazar, “Virtual Spatiality in Agent Controllers: Encoding Compartmentalization,”
in Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013), 2013, vol. 7835, pp. 579–588.'
mla: 'Hamann, Heiko, et al. “Virtual Spatiality in Agent Controllers: Encoding Compartmentalization.”
Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013), vol. 7835, 2013, pp. 579–88, doi:10.1007/978-3-642-37192-9_58.'
short: 'H. Hamann, T. Schmickl, J. Stradner, C. Schwarzer, N.K. Michiels, A.I. Esparcia-Alcazar,
in: Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013), 2013, pp. 579–588.'
date_created: 2020-10-21T08:53:30Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-37192-9_58
intvolume: ' 7835'
language:
- iso: eng
page: 579-588
publication: Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013)
status: public
title: 'Virtual Spatiality in Agent Controllers: Encoding Compartmentalization'
type: conference
user_id: '15415'
volume: 7835
year: '2013'
...
---
_id: '20160'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Hamann H. A Reductionist Approach to Hypothesis-Catching for the Analysis
of Self-Organizing Decision-Making Systems. In: 7th IEEE Int. Conf. on Self-Adaptive
and Self-Organizing Systems (SASO 2013). IEEE Press; 2013:227-236. doi:10.1109/SASO.2013.10'
apa: Hamann, H. (2013). A Reductionist Approach to Hypothesis-Catching for the Analysis
of Self-Organizing Decision-Making Systems. In 7th IEEE Int. Conf. on Self-Adaptive
and Self-Organizing Systems (SASO 2013) (pp. 227–236). IEEE Press. https://doi.org/10.1109/SASO.2013.10
bibtex: '@inproceedings{Hamann_2013, title={A Reductionist Approach to Hypothesis-Catching
for the Analysis of Self-Organizing Decision-Making Systems}, DOI={10.1109/SASO.2013.10},
booktitle={7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO
2013)}, publisher={IEEE Press}, author={Hamann, Heiko}, year={2013}, pages={227–236}
}'
chicago: Hamann, Heiko. “A Reductionist Approach to Hypothesis-Catching for the
Analysis of Self-Organizing Decision-Making Systems.” In 7th IEEE Int. Conf.
on Self-Adaptive and Self-Organizing Systems (SASO 2013), 227–36. IEEE Press,
2013. https://doi.org/10.1109/SASO.2013.10.
ieee: H. Hamann, “A Reductionist Approach to Hypothesis-Catching for the Analysis
of Self-Organizing Decision-Making Systems,” in 7th IEEE Int. Conf. on Self-Adaptive
and Self-Organizing Systems (SASO 2013), 2013, pp. 227–236.
mla: Hamann, Heiko. “A Reductionist Approach to Hypothesis-Catching for the Analysis
of Self-Organizing Decision-Making Systems.” 7th IEEE Int. Conf. on Self-Adaptive
and Self-Organizing Systems (SASO 2013), IEEE Press, 2013, pp. 227–36, doi:10.1109/SASO.2013.10.
short: 'H. Hamann, in: 7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing
Systems (SASO 2013), IEEE Press, 2013, pp. 227–236.'
date_created: 2020-10-21T13:48:26Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/SASO.2013.10
language:
- iso: eng
page: 227-236
publication: 7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO
2013)
publisher: IEEE Press
status: public
title: A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing
Decision-Making Systems
type: conference
user_id: '15415'
year: '2013'
...
---
_id: '20161'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Pietro
full_name: Lio, Pietro
last_name: Lio
- first_name: Orazio
full_name: Miglino, Orazio
last_name: Miglino
- first_name: Giuseppe
full_name: Nicosia, Giuseppe
last_name: Nicosia
- first_name: Stefano
full_name: Nolfi, Stefano
last_name: Nolfi
- first_name: Mario
full_name: Pavone, Mario
last_name: Pavone
citation:
ama: 'Hamann H, Lio P, Miglino O, Nicosia G, Nolfi S, Pavone M. Speciation Dynamics:
Generating Selective Pressure Towards Diversity. In: 12th European Conference
on Artificial Life (ECAL 2013). MIT Press; 2013.'
apa: 'Hamann, H., Lio, P., Miglino, O., Nicosia, G., Nolfi, S., & Pavone, M.
(2013). Speciation Dynamics: Generating Selective Pressure Towards Diversity.
In 12th European Conference on Artificial Life (ECAL 2013). MIT Press.'
bibtex: '@inproceedings{Hamann_Lio_Miglino_Nicosia_Nolfi_Pavone_2013, title={Speciation
Dynamics: Generating Selective Pressure Towards Diversity}, booktitle={12th European
Conference on Artificial Life (ECAL 2013)}, publisher={MIT Press}, author={Hamann,
Heiko and Lio, Pietro and Miglino, Orazio and Nicosia, Giuseppe and Nolfi, Stefano
and Pavone, Mario}, year={2013} }'
chicago: 'Hamann, Heiko, Pietro Lio, Orazio Miglino, Giuseppe Nicosia, Stefano Nolfi,
and Mario Pavone. “Speciation Dynamics: Generating Selective Pressure Towards
Diversity.” In 12th European Conference on Artificial Life (ECAL 2013).
MIT Press, 2013.'
ieee: 'H. Hamann, P. Lio, O. Miglino, G. Nicosia, S. Nolfi, and M. Pavone, “Speciation
Dynamics: Generating Selective Pressure Towards Diversity,” in 12th European
Conference on Artificial Life (ECAL 2013), 2013.'
mla: 'Hamann, Heiko, et al. “Speciation Dynamics: Generating Selective Pressure
Towards Diversity.” 12th European Conference on Artificial Life (ECAL 2013),
MIT Press, 2013.'
short: 'H. Hamann, P. Lio, O. Miglino, G. Nicosia, S. Nolfi, M. Pavone, in: 12th
European Conference on Artificial Life (ECAL 2013), MIT Press, 2013.'
date_created: 2020-10-21T13:53:59Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: 12th European Conference on Artificial Life (ECAL 2013)
publisher: MIT Press
status: public
title: 'Speciation Dynamics: Generating Selective Pressure Towards Diversity'
type: conference
user_id: '15415'
year: '2013'
...
---
_id: '20162'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Hamann H. Towards Swarm Calculus: Urn Models of Collective Decisions and Universal
Properties of Swarm Performance. Swarm Intelligence. 2013;7(3):145-172.
doi:10.1007/s11721-013-0080-0'
apa: 'Hamann, H. (2013). Towards Swarm Calculus: Urn Models of Collective Decisions
and Universal Properties of Swarm Performance. Swarm Intelligence, 7(3),
145–172. https://doi.org/10.1007/s11721-013-0080-0'
bibtex: '@article{Hamann_2013, title={Towards Swarm Calculus: Urn Models of Collective
Decisions and Universal Properties of Swarm Performance}, volume={7}, DOI={10.1007/s11721-013-0080-0},
number={3}, journal={Swarm Intelligence}, author={Hamann, Heiko}, year={2013},
pages={145–172} }'
chicago: 'Hamann, Heiko. “Towards Swarm Calculus: Urn Models of Collective Decisions
and Universal Properties of Swarm Performance.” Swarm Intelligence 7, no.
3 (2013): 145–72. https://doi.org/10.1007/s11721-013-0080-0.'
ieee: 'H. Hamann, “Towards Swarm Calculus: Urn Models of Collective Decisions and
Universal Properties of Swarm Performance,” Swarm Intelligence, vol. 7,
no. 3, pp. 145–172, 2013.'
mla: 'Hamann, Heiko. “Towards Swarm Calculus: Urn Models of Collective Decisions
and Universal Properties of Swarm Performance.” Swarm Intelligence, vol.
7, no. 3, 2013, pp. 145–72, doi:10.1007/s11721-013-0080-0.'
short: H. Hamann, Swarm Intelligence 7 (2013) 145–172.
date_created: 2020-10-21T13:57:36Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/s11721-013-0080-0
intvolume: ' 7'
issue: '3'
language:
- iso: eng
page: 145-172
publication: Swarm Intelligence
status: public
title: 'Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties
of Swarm Performance'
type: journal_article
user_id: '15415'
volume: 7
year: '2013'
...
---
_id: '17439'
abstract:
- lang: eng
text: Viele virtuelle 3-D-Szenen im industriellen Bereich sind nicht gleichmäßig
strukturiert, z.B. weil sie eine stark unterschiedliche Dichteverteilung der Polygone
aufweisen. Für solch heterogene Daten existiert kein Algorithmus, der die Gesamtheit
der Daten sowohl schnell als auch mit guter Qualität darstellen kann. Die Auswahl
der richtigen Algorithmen für einzelne Szenenteile durch einen Experten ist zeitintensiv
und in vielen Visualisierungssystemen nicht umzusetzen. Um dieses Problem zu lösen,
setzt das hier vorgestellte Multi-Algorithmen-Rendering verschiedene Renderingalgorithmen
gleichzeitig ein, um eine virtuelle 3-D-Szene darzustellen. Das Verfahren unterteilt
die Szene dafür in einem Vorverarbeitungsschritt automatisch in geeignete Teilregionen
und bestimmt deren Eigenschaften. Diese Daten werden zur Laufzeit dazu genutzt,
um ständig für den aktuellen Standpunkt des Betrachters eine Abschätzung der Qualität
und Laufzeit der zur Auswahl stehenden Renderingalgorithmen zu berechnen. Durch
die Lösung eines Optimierungsproblems kann so bei vorgegebener Bildrate durch
die passende Zuordnung der Algorithmen zu den Regionen die Bildqualität optimiert
werden – bei automatischer Anpassung an die Leistungsfähigkeit der eingesetzten
Hardware. In einer experimentellen Evaluierung vergleichen wir die Laufzeit und
Bildqualität des Verfahrens mit denen verbreiteter Standardrenderingverfahren.
author:
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Darstellung
heterogener 3-D-Szenen in Echtzeit. In: 11. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe
des Heinz Nixdorf Instituts. Paderborn; 2013:49--60.'
apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F.
(2013). Darstellung heterogener 3-D-Szenen in Echtzeit. In 11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung (Vol. 311,
pp. 49--60). Paderborn.
bibtex: '@inproceedings{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Paderborn},
series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Darstellung
heterogener 3-D-Szenen in Echtzeit}, volume={311}, booktitle={11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung}, author={Petring,
Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf
der Heide, Friedhelm}, year={2013}, pages={49--60}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts} }'
chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm
Meyer auf der Heide. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” In 11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
311:49--60. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn, 2013.
ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Darstellung
heterogener 3-D-Szenen in Echtzeit,” in 11. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung, 2013, vol. 311, pp. 49--60.
mla: Petring, Ralf, et al. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” 11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
vol. 311, 2013, pp. 49--60.
short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: 11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
Paderborn, 2013, pp. 49--60.'
date_created: 2020-07-29T08:55:43Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
intvolume: ' 311'
language:
- iso: eng
page: 49--60
place: Paderborn
publication: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Darstellung heterogener 3-D-Szenen in Echtzeit
type: conference
user_id: '15415'
volume: 311
year: '2013'
...
---
_id: '17440'
author:
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
citation:
ama: 'Eikel B. Spherical Visibility Sampling : Preprocessed Visibility for Occlusion
Culling in Complex 3D Scenes. Universität Paderborn; 2013.'
apa: 'Eikel, B. (2013). Spherical visibility sampling : preprocessed visibility
for occlusion culling in complex 3D scenes. Universität Paderborn.'
bibtex: '@book{Eikel_2013, place={Universität Paderborn}, title={Spherical visibility
sampling : preprocessed visibility for occlusion culling in complex 3D scenes},
author={Eikel, Benjamin}, year={2013} }'
chicago: 'Eikel, Benjamin. Spherical Visibility Sampling : Preprocessed Visibility
for Occlusion Culling in Complex 3D Scenes. Universität Paderborn, 2013.'
ieee: 'B. Eikel, Spherical visibility sampling : preprocessed visibility for
occlusion culling in complex 3D scenes. Universität Paderborn, 2013.'
mla: 'Eikel, Benjamin. Spherical Visibility Sampling : Preprocessed Visibility
for Occlusion Culling in Complex 3D Scenes. 2013.'
short: 'B. Eikel, Spherical Visibility Sampling : Preprocessed Visibility for Occlusion
Culling in Complex 3D Scenes, Universität Paderborn, 2013.'
date_created: 2020-07-29T09:11:23Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12683
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: 'Spherical visibility sampling : preprocessed visibility for occlusion culling
in complex 3D scenes'
type: dissertation
user_id: '15415'
year: '2013'
...
---
_id: '17442'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Meyer auf der Heide F. Algorithmische Grundlagen für die Selbstorganisation
von Roboterschwärmen. In: 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2013:7-16.'
apa: Meyer auf der Heide, F. (2013). Algorithmische Grundlagen für die Selbstorganisation
von Roboterschwärmen. 11. Paderborner Workshop Augmented & Virtual Reality
in Der Produktentstehung, 311, 7–16.
bibtex: '@inproceedings{Meyer auf der Heide_2013, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Algorithmische Grundlagen für
die Selbstorganisation von Roboterschwärmen}, volume={311}, booktitle={11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Meyer auf der Heide, Friedhelm},
year={2013}, pages={7–16}, collection={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn} }'
chicago: Meyer auf der Heide, Friedhelm. “Algorithmische Grundlagen Für Die Selbstorganisation
von Roboterschwärmen.” In 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung, 311:7–16. Verlagsschriftenreihe Des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2013.
ieee: F. Meyer auf der Heide, “Algorithmische Grundlagen für die Selbstorganisation
von Roboterschwärmen,” in 11. Paderborner Workshop Augmented & Virtual
Reality in der Produktentstehung, 2013, vol. 311, pp. 7–16.
mla: Meyer auf der Heide, Friedhelm. “Algorithmische Grundlagen Für Die Selbstorganisation
von Roboterschwärmen.” 11. Paderborner Workshop Augmented & Virtual Reality
in Der Produktentstehung, vol. 311, Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2013, pp. 7–16.
short: 'F. Meyer auf der Heide, in: 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2013, pp. 7–16.'
date_created: 2020-07-29T09:44:04Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 311'
language:
- iso: eng
page: 7-16
publication: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen
type: conference
user_id: '5786'
volume: 311
year: '2013'
...
---
_id: '17443'
citation:
ama: Gausemeier J, Grafe M, Meyer auf der Heide F, eds. 11. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2013.
apa: Gausemeier, J., Grafe, M., & Meyer auf der Heide, F. (Eds.). (2013). 11.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
(Vol. 311). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Gausemeier_Grafe_Meyer auf der Heide_2013, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={11. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung}, volume={311}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, year={2013}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide, eds.
11. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung.
Vol. 311. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2013.
ieee: J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., 11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung, vol. 311.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013.
mla: Gausemeier, Jürgen, et al., editors. 11. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung. Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn, 2013.
short: J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., 11. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2013.
date_created: 2020-07-29T09:52:31Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
editor:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Michael
full_name: Grafe, Michael
last_name: Grafe
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 311'
language:
- iso: eng
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
type: conference_editor
user_id: '5786'
volume: 311
year: '2013'
...
---
_id: '17663'
abstract:
- lang: eng
text: 'In this paper, we define and study a new problem, referred to as the Dependent
Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the
context of large-scale powerful (radar/camera) sensor networks, but we believe
it has important applications on the admission of large flows in other networks
as well. In order to optimize the selection of flows transmitted to the gateway,
D-UFP takes into account possible dependencies between flows. We show that D-UFP
is more difficult than NP-hard problems for which no good approximation is known.
Then, we address two special cases of this problem: the case where all the sensors
have a shared channel and the case where the sensors form a mesh and route to
the gateway over a spanning tree.'
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: I.
full_name: Nudelman, I.
last_name: Nudelman
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful
Sensor Networks. Networking, IEEE/ACM Transactions on. 2013;21(5):1461-1471.
doi:10.1109/TNET.2012.2227792
apa: Cohen, R., Nudelman, I., & Polevoy, G. (2013). On the Admission of Dependent
Flows in Powerful Sensor Networks. Networking, IEEE/ACM Transactions On,
21(5), 1461–1471. https://doi.org/10.1109/TNET.2012.2227792
bibtex: '@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent
Flows in Powerful Sensor Networks}, volume={21}, DOI={10.1109/TNET.2012.2227792},
number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R.
and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }'
chicago: 'Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent
Flows in Powerful Sensor Networks.” Networking, IEEE/ACM Transactions On
21, no. 5 (2013): 1461–71. https://doi.org/10.1109/TNET.2012.2227792.'
ieee: R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows
in Powerful Sensor Networks,” Networking, IEEE/ACM Transactions on, vol.
21, no. 5, pp. 1461–1471, 2013.
mla: Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.”
Networking, IEEE/ACM Transactions On, vol. 21, no. 5, 2013, pp. 1461–71,
doi:10.1109/TNET.2012.2227792.
short: R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21
(2013) 1461–1471.
date_created: 2020-08-06T15:22:05Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2012.2227792
extern: '1'
intvolume: ' 21'
issue: '5'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Logic gates
- Radar
- Vectors
- Wireless sensor networks
- Dependent flow scheduling
- sensor networks
language:
- iso: eng
page: 1461-1471
publication: Networking, IEEE/ACM Transactions on
publication_identifier:
issn:
- 1063-6692
status: public
title: On the Admission of Dependent Flows in Powerful Sensor Networks
type: journal_article
user_id: '83983'
volume: 21
year: '2013'
...
---
_id: '477'
abstract:
- lang: eng
text: We consider the k-token dissemination problem, where k initially arbitrarily
distributed tokens have to be disseminated to all nodes in a dynamic network (as
introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks,
our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean
plane and two nodes are connected if and only if their distance is at most R.
Our worst-case adversary is allowed to move the nodes on the plane, but the maximum
velocity v_max of each node is limited and the graph must be connected in each
round. For this model, we provide almost tight lower and upper bounds for k-token
dissemination if nodes are restricted to send only one token per round. It turns
out that the maximum velocity v_max is a meaningful parameter to characterize
dynamics in our model.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F.
Token Dissemination in Geometric Dynamic Networks. In: Algorithms for Sensor
Systems - 9th International Symposium on Algorithms and Experiments for Sensor
Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia
Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes
in Computer Science. ; 2013:22-34. doi:10.1007/978-3-642-45346-5_3'
apa: Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., & Meyer auf
der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
(pp. 22–34). https://doi.org/10.1007/978-3-642-45346-5_3
bibtex: '@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013,
series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric
Dynamic Networks}, DOI={10.1007/978-3-642-45346-5_3},
booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34},
collection={Lecture Notes in Computer Science} }'
chicago: Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali,
and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.”
In Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 22–34. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-45346-5_3.
ieee: S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der
Heide, “Token Dissemination in Geometric Dynamic Networks,” in Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013,
Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013,
pp. 22–34.
mla: Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.”
Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers,
2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
short: 'S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der
Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 2013, pp. 22–34.'
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:38Z
date_updated: 2018-03-15T14:06:38Z
file_id: '1325'
file_name: 477-geometric-dynamic-networks_01.pdf
file_size: 193169
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:38Z
has_accepted_license: '1'
page: 22-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers
series_title: Lecture Notes in Computer Science
status: public
title: Token Dissemination in Geometric Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '499'
abstract:
- lang: eng
text: We present a new online algorithm for profit-oriented scheduling on multiple
speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's
competitiveness.Our results generalize and improve upon work by \citet{Chan:2010},
which considers a single speed-scalable processor.Using significantly different
techniques, we can not only extend their model to multiprocessors but also prove
an enhanced and tight competitive ratio for our algorithm.In our scheduling problem,
jobs arrive over time and are preemptable.They have different workloads, values,
and deadlines.The scheduler may decide not to finish a job but instead to suffer
a loss equaling the job's value.However, to process a job's workload until its
deadline the scheduler must invest a certain amount of energy.The cost of a schedule
is the sum of lost values and invested energy.In order to finish a job the scheduler
has to determine which processors to use and set their speeds accordingly.A processor's
energy consumption is power $\Power{s}$ integrated over time, where $\Power{s}=s^{\alpha}$
is the power consumption when running at speed $s$.Since we consider the online
variant of the problem, the scheduler has no knowledge about future jobs.This
problem was introduced by~\citet{Chan:2010} for the case of a single processor.They
presented an online algorithm which is $\alpha^{\alpha}+2e\alpha$-competitive.We
provide an online algorithm for the case of multiple processors with an improved
competitive ratio of $\alpha^{\alpha}$.
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: 'Kling P, Pietrzyk P. Profitable Scheduling on Multiple Speed-Scalable Processors.
In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ; 2013:251-260. doi:10.1145/2486159.2486183'
apa: Kling, P., & Pietrzyk, P. (2013). Profitable Scheduling on Multiple Speed-Scalable
Processors. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA) (pp. 251–260). https://doi.org/10.1145/2486159.2486183
bibtex: '@inproceedings{Kling_Pietrzyk_2013, title={Profitable Scheduling on Multiple
Speed-Scalable Processors}, DOI={10.1145/2486159.2486183},
booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Kling, Peter and Pietrzyk, Peter}, year={2013},
pages={251–260} }'
chicago: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
Processors.” In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 251–60, 2013. https://doi.org/10.1145/2486159.2486183.
ieee: P. Kling and P. Pietrzyk, “Profitable Scheduling on Multiple Speed-Scalable
Processors,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 251–260.
mla: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
Processors.” Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 251–60, doi:10.1145/2486159.2486183.
short: 'P. Kling, P. Pietrzyk, in: Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 251–260.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:34Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2486159.2486183
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:40:02Z
date_updated: 2018-03-15T13:40:02Z
file_id: '1310'
file_name: 499-P._Kling__P._Pietryzk_-_Profitable_Scheduling_on_Multiple_Speed-scalable_Processors__2013_.pdf
file_size: 558661
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:40:02Z
has_accepted_license: '1'
language:
- iso: eng
page: '251-260 '
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Profitable Scheduling on Multiple Speed-Scalable Processors
type: conference
user_id: '477'
year: '2013'
...
---
_id: '507'
abstract:
- lang: eng
text: We study two-party communication in the context of directed dynamic networks
that are controlled by an adaptive adversary. This adversary is able to change
all edges as long as the networks stay strongly-connected in each round. In this
work, we establish a relation between counting the total number of nodes in the
network and the problem of exchanging tokens between two communication partners
which communicate through a dynamic network. We show that the communication problem
for a constant fraction of n tokens in a dynamic network with n nodes is at most
as hard as counting the number of nodes in a dynamic network with at most 4n+3
nodes. For the proof, we construct a family of directed dynamic networks and apply
a lower bound from two-party communication complexity.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication
Through Dynamic Networks. In: Proceedings of the 17th International Conference
on Principles of Distributed Systems (OPODIS). LNCS. ; 2013:11-22. doi:10.1007/978-3-319-03850-6_2'
apa: Abshoff, S., Benter, M., Malatyali, M., & Meyer auf der Heide, F. (2013).
On Two-Party Communication Through Dynamic Networks. In Proceedings of the
17th International Conference on Principles of Distributed Systems (OPODIS)
(pp. 11–22). https://doi.org/10.1007/978-3-319-03850-6_2
bibtex: '@inproceedings{Abshoff_Benter_Malatyali_Meyer auf der Heide_2013, series={LNCS},
title={On Two-Party Communication Through Dynamic Networks}, DOI={10.1007/978-3-319-03850-6_2},
booktitle={Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Abshoff, Sebastian and Benter, Markus and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={11–22}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Markus Benter, Manuel Malatyali, and Friedhelm Meyer
auf der Heide. “On Two-Party Communication Through Dynamic Networks.” In Proceedings
of the 17th International Conference on Principles of Distributed Systems (OPODIS),
11–22. LNCS, 2013. https://doi.org/10.1007/978-3-319-03850-6_2.
ieee: S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party
Communication Through Dynamic Networks,” in Proceedings of the 17th International
Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22.
mla: Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.”
Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS), 2013, pp. 11–22, doi:10.1007/978-3-319-03850-6_2.
short: 'S. Abshoff, M. Benter, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
of the 17th International Conference on Principles of Distributed Systems (OPODIS),
2013, pp. 11–22.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-03850-6_2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:47:31Z
date_updated: 2018-03-15T10:47:31Z
file_id: '1305'
file_name: 507-on-two-party-communication-through-dynamic-networks_01.pdf
file_size: 181398
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:47:31Z
has_accepted_license: '1'
page: 11-22
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: LNCS
status: public
title: On Two-Party Communication Through Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '514'
abstract:
- lang: eng
text: Diese Arbeit besch{\"a}ftigt sich mit dem Facility Location Problem. Dies
ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen
Ressourcen zur Verf{\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht
werden k{\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch
Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen
Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin,
dass man einerseits m{\"o}glichst wenige Ressourcen zur Verf{\"u}gung stellen
m{\"o}chte, andererseits daf{\"u}r sorgen muss, dass sich Nutzer nicht all zu
weit weg von Ressourcen befinden. Dies w{\"u}rde n{\"a}mlich hohe Verbindungskosten
nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in
vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten
des Problems modelliert und neue Algorithmen f{\"u}r sie entwickelt und bez{\"u}glich
ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten
Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es
sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist,
sondern Schritt f{\"u}r Schritt enth{\"u}llt wird. Die Schwierigkeit hierbei besteht
darin unwiderrufliche Entscheidungen treffen zu m{\"u}ssen ohne dabei die Zukunft
zu kennen und trotzdem eine zu jeder Zeit gute L{\"o}sung angeben zu k{\"o}nnen.
Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\"a}t, die z.B. in Sensornetzwerken
von großer Bedeutung ist. Hier soll eine L{\"o}sung verteilt und nur mit Hilfe
von lokalen Information berechnet werden. Schließlich besch{\"a}ftigt sich die
dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\"a}nkte
Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor
erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der
Kompetitivit{\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\"a}tzung
der primalen L{\"o}sung mit Hilfe einer L{\"o}sung des zugeh{\"o}rigen dualen
Problems. F{\"u}r die Modellierung von Lokalit{\"a}t wird das weitverbreitete
LOCAL Modell verwendet. In diesem Modell werden f{\"u}r die Algorithmen subpolynomielle
obere Laufzeitschranken gezeigt.
author:
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: Pietrzyk P. Local and Online Algorithms for Facility Location. Universität
Paderborn; 2013.
apa: Pietrzyk, P. (2013). Local and Online Algorithms for Facility Location.
Universität Paderborn.
bibtex: '@book{Pietrzyk_2013, title={Local and Online Algorithms for Facility Location},
publisher={Universität Paderborn}, author={Pietrzyk, Peter}, year={2013} }'
chicago: Pietrzyk, Peter. Local and Online Algorithms for Facility Location.
Universität Paderborn, 2013.
ieee: P. Pietrzyk, Local and Online Algorithms for Facility Location. Universität
Paderborn, 2013.
mla: Pietrzyk, Peter. Local and Online Algorithms for Facility Location.
Universität Paderborn, 2013.
short: P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:44:13Z
date_updated: 2018-03-15T10:44:13Z
file_id: '1302'
file_name: 514-DissertationPietrzyk.pdf
file_size: 790821
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:44:13Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local and Online Algorithms for Facility Location
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '524'
abstract:
- lang: eng
text: 'We study the complexity theory for the local distributed setting introduced
by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD
(Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class
LD consists of all languages which can be decided with a constant number of communication
rounds. The class NLD consists of all languages which can be verified by a nondeterministic
algorithm with a constant number of communication rounds. In order to define the
nondeterministic classes, they have transferred the notation of nondeterminism
into the distributed setting by the use of certificates and verifiers. The class
NLD^#n consists of all languages which can be verified by a nondeterministic algorithm
where each node has access to an oracle for the number of nodes. They have shown
the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies
within the classes defined by Korman, Peleg and Fraigniaud. We define additional
complexity classes: the class LD(t) consists of all languages which can be decided
with at most t communication rounds. The class NLD-O(f) consists of all languages
which can be verified by a local verifier such that the size of the certificates
that are needed to verify the language are bounded by a function from O(f). Our
main results are refined strict hierarchies within these nondeterministic classes.'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Kamil
full_name: Swirkot, Kamil
last_name: Swirkot
citation:
ama: Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision.
2013.
apa: Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed
Decision. arXiv.
bibtex: '@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local
Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm
and Swirkot, Kamil}, year={2013} }'
chicago: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local
Distributed Decision.” arXiv, 2013.
ieee: F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.”
arXiv, 2013.
mla: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local
Distributed Decision. arXiv, 2013.
short: F. Meyer auf der Heide, K. Swirkot, (2013).
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:48Z
ddc:
- '040'
department:
- _id: '63'
external_id:
arxiv:
- '1311.7229'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:37:07Z
date_updated: 2018-03-15T10:37:07Z
file_id: '1296'
file_name: 524-paper_01.pdf
file_size: 534906
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:37:07Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: arXiv
status: public
title: Hierarchies in Local Distributed Decision
type: preprint
user_id: '15415'
year: '2013'
...
---
_id: '558'
citation:
ama: Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics. Vol 8243. Springer;
2013. doi:10.1007/978-3-642-45346-5
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2013). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer.
https://doi.org/10.1007/978-3-642-45346-5'
bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243},
DOI={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2013}, collection={LNCS} }'
chicago: Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics. Vol. 8243. LNCS. Springer, 2013. https://doi.org/10.1007/978-3-642-45346-5.
ieee: P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, vol. 8243.
Springer, 2013.
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.
short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013.
conference:
end_date: 2013-09-06
location: Sophia Antipolis, France
name: ALGOSENSORS 2013
start_date: 2013-09-05
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:02Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
full_name: Flocchini, Paola
last_name: Flocchini
- first_name: Jie
full_name: Gao, Jie
last_name: Gao
- first_name: Evangelos
full_name: Kranakis, Evangelos
last_name: Kranakis
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:29:07Z
date_updated: 2018-11-02T16:29:07Z
file_id: '5327'
file_name: 2014_Book_AlgorithmsForSensorSystems-1.pdf
file_size: 9186107
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:29:07Z
has_accepted_license: '1'
intvolume: ' 8243'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Springer
series_title: LNCS
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
type: conference_editor
user_id: '477'
volume: 8243
year: '2013'
...
---
_id: '562'
abstract:
- lang: eng
text: In Distributed Cloud Computing, applications are deployed across many data
centres at topologically diverse locations to improved network-related quality
of service (QoS). As we focus on interactive applications, we minimize the latency
between users and an application by allocating Cloud resources nearby the customers.
Allocating resources at all locations will result in the best latency but also
in the highest expenses. So we need to find an optimal subset of locations which
reduces the latency but also the expenses – the facility location problem (FLP).
In addition, we consider resource capacity restrictions, as a resource can only
serve a limited amount of users. An FLP can be globally solved. Additionally,
we propose a local, distributed heuristic. This heuristic is running within the
network and does not depend on a global component. No distributed, local approximations
for the capacitated FLP have been proposed so far due to the complexity of the
problem. We compared the heuristic with an optimal solution obtained from a mixed
integer program for different network topologies. We investigated the influence
of different parameters like overall resource utilization or different latency
weights.
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
- first_name: Stefan
full_name: Pawlik, Stefan
last_name: Pawlik
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized
Distributed Cloud Deployment. In: Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing.
; 2013:429-434. doi:10.1109/UCC.2013.85'
apa: Keller, M., Pawlik, S., Pietrzyk, P., & Karl, H. (2013). A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment. In Proceedings of the 6th
International Conference on Utility and Cloud Computing (UCC) workshop on Distributed
cloud computing (pp. 429–434). https://doi.org/10.1109/UCC.2013.85
bibtex: '@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment}, DOI={10.1109/UCC.2013.85},
booktitle={Proceedings of the 6th International Conference on Utility and Cloud
Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias
and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434}
}'
chicago: Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local
Heuristic for Latency-Optimized Distributed Cloud Deployment.” In Proceedings
of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop
on Distributed Cloud Computing, 429–34, 2013. https://doi.org/10.1109/UCC.2013.85.
ieee: M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized
Distributed Cloud Deployment,” in Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing,
2013, pp. 429–434.
mla: Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed
Cloud Deployment.” Proceedings of the 6th International Conference on Utility
and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp.
429–34, doi:10.1109/UCC.2013.85.
short: 'M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International
Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud
Computing, 2013, pp. 429–434.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:11Z
ddc:
- '040'
department:
- _id: '75'
- _id: '63'
doi: 10.1109/UCC.2013.85
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:25:45Z
date_updated: 2018-03-15T10:25:45Z
file_id: '1279'
file_name: 562-dcc13_paper.pdf
file_size: 347873
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:25:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 429-434
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 6th International Conference on Utility and Cloud
Computing (UCC) workshop on Distributed cloud computing
status: public
title: A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
type: conference
user_id: '477'
year: '2013'
...
---
_id: '563'
abstract:
- lang: eng
text: Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc
networks. Such backbones receive and transmit messages from/to every node in the
network. Existing distributed algorithms only consider undirected graphs, which
model symmetric networks with uniform transmission ranges. We are particularly
interested in the well-established disk graphs, which model asymmetric networks
with non-uniform transmission ranges. The corresponding graph theoretic problem
seeks a strongly connected dominating-absorbent set of minimum cardinality in
a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent
set if the subgraph induced by these nodes is strongly connected and each node
in the graph is either in the set or has both an in-neighbor and an out-neighbor
in it. We introduce the first distributed algorithm for this problem in disk graphs.
The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of
O(Diam) where Diam is the diameter of the graph and k denotes the transmission
ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission
range, respectively. Moreover, we apply our algorithm on the subgraph of disk
graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k)
-approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k ,
is an optimal approximation for the problem, following Lenzen and Wattenhofer’s
Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk
graphs.
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: 'Markarian C, Meyer auf der Heide F, Schubert M. A Distributed Approximation
Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
Ad-Hoc Networks. In: Proceedings of the 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(ALGOSENSORS). LNCS. ; 2013:217-227. doi:10.1007/978-3-642-45346-5_16'
apa: Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2013). A Distributed
Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric
Wireless Ad-Hoc Networks. In Proceedings of the 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics (ALGOSENSORS) (pp. 217–227). https://doi.org/10.1007/978-3-642-45346-5_16
bibtex: '@inproceedings{Markarian_Meyer auf der Heide_Schubert_2013, series={LNCS},
title={A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
Sets in Asymmetric Wireless Ad-Hoc Networks}, DOI={10.1007/978-3-642-45346-5_16},
booktitle={Proceedings of the 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)},
author={Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
Michael}, year={2013}, pages={217–227}, collection={LNCS} }'
chicago: Markarian, Christine, Friedhelm Meyer auf der Heide, and Michael Schubert.
“A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
Sets in Asymmetric Wireless Ad-Hoc Networks.” In Proceedings of the 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics (ALGOSENSORS), 217–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-45346-5_16.
ieee: C. Markarian, F. Meyer auf der Heide, and M. Schubert, “A Distributed Approximation
Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
Ad-Hoc Networks,” in Proceedings of the 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(ALGOSENSORS), 2013, pp. 217–227.
mla: Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly
Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” Proceedings
of the 9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–27,
doi:10.1007/978-3-642-45346-5_16.
short: 'C. Markarian, F. Meyer auf der Heide, M. Schubert, in: Proceedings of the
9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:13Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:25:15Z
date_updated: 2018-03-15T10:25:15Z
file_id: '1278'
file_name: 563-978-3-642-45346-5_16.pdf
file_size: 348191
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:25:15Z
has_accepted_license: '1'
page: 217-227
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)
series_title: LNCS
status: public
title: A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
Sets in Asymmetric Wireless Ad-Hoc Networks
type: conference
user_id: '477'
year: '2013'
...
---
_id: '16393'
abstract:
- lang: eng
text: Many 3D scenes (e.g. generated from CAD data) are composed of a multitude
of objects that are nested in each other. A showroom, for instance, may contain
multiple cars and every car has a gearbox with many gearwheels located inside.
Because the objects occlude each other, only few are visible from outside. We
present a new technique, Spherical Visibility Sampling (SVS), for real-time 3D
rendering of such -- possibly highly complex -- scenes. SVS exploits the occlusion
and annotates hierarchically structured objects with directional visibility information
in a preprocessing step. For different directions, the directional visibility
encodes which objects of a scene's region are visible from the outside of the
regions' enclosing bounding sphere. Since there is no need to store a separate
view space subdivision as in most techniques based on preprocessed visibility,
a small memory footprint is achieved. Using the directional visibility information
for an interactive walkthrough, the potentially visible objects can be retrieved
very efficiently without the need for further visibility tests. Our evaluation
shows that using SVS allows to preprocess complex 3D scenes fast and to visualize
them in real time (e.g. a Power Plant model and five animated Boeing 777 models
with billions of triangles). Because SVS does not require hardware support for
occlusion culling during rendering, it is even applicable for rendering large
scenes on mobile devices.
author:
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Spherical Visibility Sampling.
In: Computer Graphics Forum. Vol 32. Proceedings of the 24th Eurographics
Symposium on Rendering. ; 2013:49-58. doi:10.1111/cgf.12150'
apa: Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2013). Spherical
Visibility Sampling. In Computer Graphics Forum (Vol. 32, pp. 49–58). https://doi.org/10.1111/cgf.12150
bibtex: '@inproceedings{Eikel_Jähn_Fischer_Meyer auf der Heide_2013, series={Proceedings
of the 24th Eurographics Symposium on Rendering}, title={Spherical Visibility
Sampling}, volume={32}, DOI={10.1111/cgf.12150},
number={4}, booktitle={Computer Graphics Forum}, author={Eikel, Benjamin and Jähn,
Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013},
pages={49–58}, collection={Proceedings of the 24th Eurographics Symposium on Rendering}
}'
chicago: Eikel, Benjamin, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf
der Heide. “Spherical Visibility Sampling.” In Computer Graphics Forum,
32:49–58. Proceedings of the 24th Eurographics Symposium on Rendering, 2013. https://doi.org/10.1111/cgf.12150.
ieee: B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Spherical Visibility
Sampling,” in Computer Graphics Forum, 2013, vol. 32, no. 4, pp. 49–58.
mla: Eikel, Benjamin, et al. “Spherical Visibility Sampling.” Computer Graphics
Forum, vol. 32, no. 4, 2013, pp. 49–58, doi:10.1111/cgf.12150.
short: 'B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Computer Graphics
Forum, 2013, pp. 49–58.'
date_created: 2020-04-03T07:48:48Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1111/cgf.12150
intvolume: ' 32'
issue: '4'
language:
- iso: eng
page: 49-58
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
publication_status: published
series_title: Proceedings of the 24th Eurographics Symposium on Rendering
status: public
title: Spherical Visibility Sampling
type: conference
user_id: '15415'
volume: 32
year: '2013'
...
---
_id: '16406'
abstract:
- lang: eng
text: "In order to evaluate the efficiency of algorithms for real-time 3D rendering,
different properties like rendering time, occluded triangles, or image quality,
need to be investigated. Since these properties depend on the position of the
camera, usually some camera path is chosen, along which the measurements are performed.
As those measurements cover only a small part of the scene, this approach hardly
allows drawing conclusions regarding the algorithm's properties at arbitrary positions
in the scene. The presented method allows the systematic and position-independent
evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate
the distribution of a property (like rendering time) for all positions in the
scene. This approximation can be visualized to produce an intuitive impression
of the algorithm's behavior or be statistically analyzed for objectively rating
and comparing algorithms. We demonstrate our method by evaluating performance
aspects of a known occlusion culling algorithm.\r\n"
author:
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Jähn C, Eikel B, Fischer M, Petring R, Meyer auf der Heide F. Evaluation of
Rendering Algorithms Using Position-Dependent Scene Properties. In: Advances
in Visual Computing. Berlin, Heidelberg; 2013. doi:10.1007/978-3-642-41914-0_12'
apa: Jähn, C., Eikel, B., Fischer, M., Petring, R., & Meyer auf der Heide, F.
(2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.
In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_12
bibtex: '@inbook{Jähn_Eikel_Fischer_Petring_Meyer auf der Heide_2013, place={Berlin,
Heidelberg}, title={Evaluation of Rendering Algorithms Using Position-Dependent
Scene Properties}, DOI={10.1007/978-3-642-41914-0_12},
booktitle={Advances in Visual Computing}, author={Jähn, Claudius and Eikel, Benjamin
and Fischer, Matthias and Petring, Ralf and Meyer auf der Heide, Friedhelm}, year={2013}
}'
chicago: Jähn, Claudius, Benjamin Eikel, Matthias Fischer, Ralf Petring, and Friedhelm
Meyer auf der Heide. “Evaluation of Rendering Algorithms Using Position-Dependent
Scene Properties.” In Advances in Visual Computing. Berlin, Heidelberg,
2013. https://doi.org/10.1007/978-3-642-41914-0_12.
ieee: C. Jähn, B. Eikel, M. Fischer, R. Petring, and F. Meyer auf der Heide, “Evaluation
of Rendering Algorithms Using Position-Dependent Scene Properties,” in Advances
in Visual Computing, Berlin, Heidelberg, 2013.
mla: Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent
Scene Properties.” Advances in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_12.
short: 'C. Jähn, B. Eikel, M. Fischer, R. Petring, F. Meyer auf der Heide, in: Advances
in Visual Computing, Berlin, Heidelberg, 2013.'
date_created: 2020-04-06T07:21:55Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-41914-0_12
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
isbn:
- '9783642419133'
- '9783642419140'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties
type: book_chapter
user_id: '15415'
year: '2013'
...
---
_id: '16407'
abstract:
- lang: eng
text: "Many virtual 3D scenes, especially those that are large, are not structured
evenly. For such heterogeneous data, there is no single algorithm that is able
to render every scene type at each position fast and with the same high image
quality. For a small set of scenes, this situation can be improved if different
rendering algorithms are manually assigned to particular parts of the scene by
an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically
deploys different rendering algorithms simultaneously for a broad range of scene
types. The method divides the scene into subregions and measures the behavior
of different algorithms for each region in a preprocessing step. During runtime,
this data is utilized to compute an estimate for the quality and running time
of the available rendering algorithms from the observer's point of view. By solving
an optimizing problem, the image quality can be optimized by an assignment of
algorithms to regions while keeping the frame rate almost constant.\r\n"
author:
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Real-Time 3D
Rendering of Heterogeneous Scenes. In: Advances in Visual Computing. Berlin,
Heidelberg; 2013. doi:10.1007/978-3-642-41914-0_44'
apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F.
(2013). Real-Time 3D Rendering of Heterogeneous Scenes. In Advances in Visual
Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_44
bibtex: '@inbook{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Berlin,
Heidelberg}, title={Real-Time 3D Rendering of Heterogeneous Scenes}, DOI={10.1007/978-3-642-41914-0_44},
booktitle={Advances in Visual Computing}, author={Petring, Ralf and Eikel, Benjamin
and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
year={2013} }'
chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm
Meyer auf der Heide. “Real-Time 3D Rendering of Heterogeneous Scenes.” In Advances
in Visual Computing. Berlin, Heidelberg, 2013. https://doi.org/10.1007/978-3-642-41914-0_44.
ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Real-Time
3D Rendering of Heterogeneous Scenes,” in Advances in Visual Computing,
Berlin, Heidelberg, 2013.
mla: Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” Advances
in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_44.
short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances
in Visual Computing, Berlin, Heidelberg, 2013.'
date_created: 2020-04-06T07:38:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-41914-0_44
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
isbn:
- '9783642419133'
- '9783642419140'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Real-Time 3D Rendering of Heterogeneous Scenes
type: book_chapter
user_id: '15415'
year: '2013'
...
---
_id: '505'
abstract:
- lang: eng
text: In this paper we introduce “On-The-Fly Computing”, our vision of future IT
services that will be provided by assembling modular software components available
on world-wide markets. After suitable components have been found, they are automatically
integrated, configured and brought to execution in an On-The-Fly Compute Center.
We envision that these future compute centers will continue to leverage three
current trends in large scale computing which are an increasing amount of parallel
processing, a trend to use heterogeneous computing resources, and—in the light
of rising energy cost—energy-efficiency as a primary goal in the design and operation
of computing systems. In this paper, we point out three research challenges and
our current work in these areas.
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Happe M, Kling P, Plessl C, Platzner M, Meyer auf der Heide F. On-The-Fly
Computing: A Novel Paradigm for Individualized IT Services. In: Proceedings
of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous
Systems (SEUS). IEEE; 2013. doi:10.1109/ISORC.2013.6913232'
apa: 'Happe, M., Kling, P., Plessl, C., Platzner, M., & Meyer auf der Heide,
F. (2013). On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.
Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded
and Ubiquitous Systems (SEUS). https://doi.org/10.1109/ISORC.2013.6913232'
bibtex: '@inproceedings{Happe_Kling_Plessl_Platzner_Meyer auf der Heide_2013, title={On-The-Fly
Computing: A Novel Paradigm for Individualized IT Services}, DOI={10.1109/ISORC.2013.6913232},
booktitle={Proceedings of the 9th IEEE Workshop on Software Technology for Future
embedded and Ubiquitous Systems (SEUS)}, publisher={IEEE}, author={Happe, Markus
and Kling, Peter and Plessl, Christian and Platzner, Marco and Meyer auf der Heide,
Friedhelm}, year={2013} }'
chicago: 'Happe, Markus, Peter Kling, Christian Plessl, Marco Platzner, and Friedhelm
Meyer auf der Heide. “On-The-Fly Computing: A Novel Paradigm for Individualized
IT Services.” In Proceedings of the 9th IEEE Workshop on Software Technology
for Future Embedded and Ubiquitous Systems (SEUS). IEEE, 2013. https://doi.org/10.1109/ISORC.2013.6913232.'
ieee: 'M. Happe, P. Kling, C. Plessl, M. Platzner, and F. Meyer auf der Heide, “On-The-Fly
Computing: A Novel Paradigm for Individualized IT Services,” 2013, doi: 10.1109/ISORC.2013.6913232.'
mla: 'Happe, Markus, et al. “On-The-Fly Computing: A Novel Paradigm for Individualized
IT Services.” Proceedings of the 9th IEEE Workshop on Software Technology for
Future Embedded and Ubiquitous Systems (SEUS), IEEE, 2013, doi:10.1109/ISORC.2013.6913232.'
short: 'M. Happe, P. Kling, C. Plessl, M. Platzner, F. Meyer auf der Heide, in:
Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded
and Ubiquitous Systems (SEUS), IEEE, 2013.'
date_created: 2017-10-17T12:42:30Z
date_updated: 2023-09-26T13:38:20Z
ddc:
- '040'
department:
- _id: '63'
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ISORC.2013.6913232
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:38:56Z
date_updated: 2018-03-15T13:38:56Z
file_id: '1308'
file_name: 505-Plessl13_seus.pdf
file_size: 1040834
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:38:56Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 9th IEEE Workshop on Software Technology for Future
embedded and Ubiquitous Systems (SEUS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'On-The-Fly Computing: A Novel Paradigm for Individualized IT Services'
type: conference
user_id: '15278'
year: '2013'
...