---
_id: '16464'
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Gehweiler J, Meyer auf der Heide F. Bin Packing oder „Wie bekomme ich die
Klamotten in die Kisten?“. In: Taschenbuch Der Algorithmen. Berlin, Heidelberg;
2008. doi:10.1007/978-3-540-76394-9_40'
apa: Gehweiler, J., & Meyer auf der Heide, F. (2008). Bin Packing oder „Wie
bekomme ich die Klamotten in die Kisten?“. In Taschenbuch der Algorithmen.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76394-9_40
bibtex: '@inbook{Gehweiler_Meyer auf der Heide_2008, place={Berlin, Heidelberg},
title={Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“}, DOI={10.1007/978-3-540-76394-9_40},
booktitle={Taschenbuch der Algorithmen}, author={Gehweiler, Joachim and Meyer
auf der Heide, Friedhelm}, year={2008} }'
chicago: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder
„Wie Bekomme Ich Die Klamotten in Die Kisten?“.” In Taschenbuch Der Algorithmen.
Berlin, Heidelberg, 2008. https://doi.org/10.1007/978-3-540-76394-9_40.
ieee: J. Gehweiler and F. Meyer auf der Heide, “Bin Packing oder „Wie bekomme ich
die Klamotten in die Kisten?“,” in Taschenbuch der Algorithmen, Berlin,
Heidelberg, 2008.
mla: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder „Wie
Bekomme Ich Die Klamotten in Die Kisten?“.” Taschenbuch Der Algorithmen,
2008, doi:10.1007/978-3-540-76394-9_40.
short: 'J. Gehweiler, F. Meyer auf der Heide, in: Taschenbuch Der Algorithmen, Berlin,
Heidelberg, 2008.'
date_created: 2020-04-08T08:39:36Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-540-76394-9_40
language:
- iso: eng
place: Berlin, Heidelberg
publication: Taschenbuch der Algorithmen
publication_identifier:
isbn:
- '9783540763932'
- '9783540763949'
publication_status: published
status: public
title: Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '16465'
abstract:
- lang: eng
text: "For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition
p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others)
from p? The present work explores the trade-off between query time\r\nand preprocessing
space for these quantities in 2D: exactly, in the approximate\r\ndeterministic,
and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space
data structure for S that, given p and time O(log n), allows\r\nto approximate
the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here
m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically
is just linear in the size n of the scene S. On the other hand,\r\nwe present
a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing
time and space with similar approximation properties and query\r\ntime O(k*polylog
n), where karXiv:08100052. 2008.
apa: Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler,
M. (2008). Planar Visibility Counting. ArXiv:0810.0052.
bibtex: '@article{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2008, title={Planar
Visibility Counting}, journal={arXiv:0810.0052}, author={Fischer, Matthias and
Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler,
Martin}, year={2008} }'
chicago: Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf
der Heide, and Martin Ziegler. “Planar Visibility Counting.” ArXiv:0810.0052,
2008.
ieee: M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar
Visibility Counting,” arXiv:0810.0052. 2008.
mla: Fischer, Matthias, et al. “Planar Visibility Counting.” ArXiv:0810.0052,
2008.
short: M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, ArXiv:0810.0052
(2008).
date_created: 2020-04-08T08:41:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '0810.0052'
language:
- iso: eng
publication: arXiv:0810.0052
status: public
title: Planar Visibility Counting
type: preprint
user_id: '15415'
year: '2008'
...
---
_id: '16466'
citation:
ama: Meyer auf der Heide F, Shavit N, eds. Proceedings of the Twentieth Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’08. ACM;
2008. doi:10.1145/1378533
apa: Meyer auf der Heide, F., & Shavit, N. (Eds.). (2008). Proceedings of
the twentieth annual symposium on Parallelism in algorithms and architectures
- SPAA ’08. ACM. https://doi.org/10.1145/1378533
bibtex: '@book{Meyer auf der Heide_Shavit_2008, title={Proceedings of the twentieth
annual symposium on Parallelism in algorithms and architectures - SPAA ’08}, DOI={10.1145/1378533}, publisher={ACM},
year={2008} }'
chicago: Meyer auf der Heide, Friedhelm, and Nir Shavit, eds. Proceedings of
the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’08. ACM, 2008. https://doi.org/10.1145/1378533.
ieee: F. Meyer auf der Heide and N. Shavit, Eds., Proceedings of the twentieth
annual symposium on Parallelism in algorithms and architectures - SPAA ’08.
ACM, 2008.
mla: Meyer auf der Heide, Friedhelm, and Nir Shavit, editors. Proceedings of
the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’08. ACM, 2008, doi:10.1145/1378533.
short: F. Meyer auf der Heide, N. Shavit, eds., Proceedings of the Twentieth Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’08, ACM, 2008.
date_created: 2020-04-08T08:46:08Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1378533
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
language:
- iso: eng
publication_identifier:
isbn:
- 978-1-59593-973-9
publication_status: published
publisher: ACM
status: public
title: Proceedings of the twentieth annual symposium on Parallelism in algorithms
and architectures - SPAA '08
type: conference_editor
user_id: '15415'
year: '2008'
...
---
_id: '17566'
alternative_title:
- ' Proceedings of the Final Workshop, Barcelona, February 27-28, 2008'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Meyer auf der Heide F. The European Integrated Project “Dynamically Evolving,
Large Scale Information Systems (DELIS).” Vol 222. Fakultät für Elektrotechnik,
Informatik und Mathematik, Universität Paderborn; 2008.
apa: Meyer auf der Heide, F. (2008). The European Integrated Project “Dynamically
Evolving, Large Scale Information Systems (DELIS)” (Vol. 222). Fakultät für
Elektrotechnik, Informatik und Mathematik, Universität Paderborn.
bibtex: '@book{Meyer auf der Heide_2008, place={Paderborn}, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, title={The European Integrated Project “Dynamically
Evolving, Large Scale Information Systems (DELIS)”}, volume={222}, publisher={Fakultät
für Elektrotechnik, Informatik und Mathematik, Universität Paderborn}, author={Meyer
auf der Heide, Friedhelm}, year={2008}, collection={Verlagsschriftenreihe des
Heinz Nixdorf Instituts} }'
chicago: 'Meyer auf der Heide, Friedhelm. The European Integrated Project “Dynamically
Evolving, Large Scale Information Systems (DELIS).” Vol. 222. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts. Paderborn: Fakultät für Elektrotechnik, Informatik
und Mathematik, Universität Paderborn, 2008.'
ieee: 'F. Meyer auf der Heide, The European Integrated Project “Dynamically Evolving,
Large Scale Information Systems (DELIS),” vol. 222. Paderborn: Fakultät für
Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.'
mla: Meyer auf der Heide, Friedhelm. The European Integrated Project “Dynamically
Evolving, Large Scale Information Systems (DELIS).” Fakultät für Elektrotechnik,
Informatik und Mathematik, Universität Paderborn, 2008.
short: F. Meyer auf der Heide, The European Integrated Project “Dynamically Evolving,
Large Scale Information Systems (DELIS),” Fakultät für Elektrotechnik, Informatik
und Mathematik, Universität Paderborn, Paderborn, 2008.
date_created: 2020-08-03T14:19:28Z
date_updated: 2026-03-10T11:00:35Z
department:
- _id: '63'
intvolume: ' 222'
language:
- iso: eng
place: Paderborn
publication_identifier:
isbn:
- ISBN 978-3-939350-41-5
publisher: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS)"
type: book
user_id: '14972'
volume: 222
year: '2008'
...
---
_id: '19689'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
citation:
ama: 'Briest P, Krysta P. Buying Cheap is Expensive: Hardness of Non-Parametric
Multi-Product Pricing. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete
Algorithms (SODA). ; 2007.'
apa: 'Briest, P., & Krysta, P. (2007). Buying Cheap is Expensive: Hardness of
Non-Parametric Multi-Product Pricing. In Proceedings of the 18th ACM-SIAM Symposium
on Discrete Algorithms (SODA).'
bibtex: '@inproceedings{Briest_Krysta_2007, title={Buying Cheap is Expensive: Hardness
of Non-Parametric Multi-Product Pricing}, booktitle={Proceedings of the 18th ACM-SIAM
Symposium on Discrete Algorithms (SODA)}, author={Briest, Patrick and Krysta,
Piotr}, year={2007} }'
chicago: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Hardness
of Non-Parametric Multi-Product Pricing.” In Proceedings of the 18th ACM-SIAM
Symposium on Discrete Algorithms (SODA), 2007.'
ieee: 'P. Briest and P. Krysta, “Buying Cheap is Expensive: Hardness of Non-Parametric
Multi-Product Pricing,” in Proceedings of the 18th ACM-SIAM Symposium on Discrete
Algorithms (SODA), 2007.'
mla: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Hardness of
Non-Parametric Multi-Product Pricing.” Proceedings of the 18th ACM-SIAM Symposium
on Discrete Algorithms (SODA), 2007.'
short: 'P. Briest, P. Krysta, in: Proceedings of the 18th ACM-SIAM Symposium on
Discrete Algorithms (SODA), 2007.'
date_created: 2020-09-25T10:19:13Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)
status: public
title: 'Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing'
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19725'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
citation:
ama: 'Bonorden O. Load Balancing in the Bulk-Synchronous-Parallel Setting using
Process Migrations. In: 2007 IEEE International Parallel and Distributed Processing
Symposium. ; 2007. doi:10.1109/ipdps.2007.370330'
apa: Bonorden, O. (2007). Load Balancing in the Bulk-Synchronous-Parallel Setting
using Process Migrations. In 2007 IEEE International Parallel and Distributed
Processing Symposium. https://doi.org/10.1109/ipdps.2007.370330
bibtex: '@inproceedings{Bonorden_2007, title={Load Balancing in the Bulk-Synchronous-Parallel
Setting using Process Migrations}, DOI={10.1109/ipdps.2007.370330},
booktitle={2007 IEEE International Parallel and Distributed Processing Symposium},
author={Bonorden, Olaf}, year={2007} }'
chicago: Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting
Using Process Migrations.” In 2007 IEEE International Parallel and Distributed
Processing Symposium, 2007. https://doi.org/10.1109/ipdps.2007.370330.
ieee: O. Bonorden, “Load Balancing in the Bulk-Synchronous-Parallel Setting using
Process Migrations,” in 2007 IEEE International Parallel and Distributed Processing
Symposium, 2007.
mla: Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting Using
Process Migrations.” 2007 IEEE International Parallel and Distributed Processing
Symposium, 2007, doi:10.1109/ipdps.2007.370330.
short: 'O. Bonorden, in: 2007 IEEE International Parallel and Distributed Processing
Symposium, 2007.'
date_created: 2020-09-28T10:34:50Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1109/ipdps.2007.370330
language:
- iso: eng
publication: 2007 IEEE International Parallel and Distributed Processing Symposium
publication_identifier:
isbn:
- '1424409098'
publication_status: published
status: public
title: Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19809'
abstract:
- lang: eng
text: "For the first time, the problem of optimizing energy for communication and
motion is investigated. We consider a single mobile robot with continuous high
bandwidth wireless communication, e.g. caused by a multimedia application like
video surveillance. This robot is connected to a radio base station and moves
with constant speed from a given starting point on the plane to a target point.
The task is to find the best path such that the energy consumption for mobility
and the communication is optimized. This is motivated by the fact that the energy\r\nconsumption
of radio devices increases polynomially (at least to\r\nthe power of two) with
the transmission distance. We introduce efficient approximation algorithms finding
the optimal path given the starting point, the target point and the position of
the radio stations. We exemplify the influence of the communication cost by a
starting scenario with one radio station. We study the performance of the proposed
algorithm in simulation, compare it with the scenario without applying our approach,
and present the results."
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots.
In: ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication
and Coordination. ; 2007:309-321. doi:10.1007/s11036-008-0150-5'
apa: 'Ooi, C. C., & Schindelhauer, C. (2007). Minimal Energy Path Planning for
Wireless Robots. In ROBOCOMM’07: Proc. of the 1st International Conference
on Robot Communication and Coordination (pp. 309–321). https://doi.org/10.1007/s11036-008-0150-5'
bibtex: '@inproceedings{Ooi_Schindelhauer_2007, title={Minimal Energy Path Planning
for Wireless Robots}, DOI={10.1007/s11036-008-0150-5},
booktitle={ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication
and Coordination}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2007},
pages={309–321} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
for Wireless Robots.” In ROBOCOMM’07: Proc. of the 1st International Conference
on Robot Communication and Coordination, 309–21, 2007. https://doi.org/10.1007/s11036-008-0150-5.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless
Robots,” in ROBOCOMM’07: Proc. of the 1st International Conference on Robot
Communication and Coordination, 2007, pp. 309–321.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
for Wireless Robots.” ROBOCOMM’07: Proc. of the 1st International Conference
on Robot Communication and Coordination, 2007, pp. 309–21, doi:10.1007/s11036-008-0150-5.'
short: 'C.C. Ooi, C. Schindelhauer, in: ROBOCOMM’07: Proc. of the 1st International
Conference on Robot Communication and Coordination, 2007, pp. 309–321.'
date_created: 2020-09-30T13:15:46Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/s11036-008-0150-5
language:
- iso: eng
page: 309-321
publication: 'ROBOCOMM''07: Proc. of the 1st International Conference on Robot Communication
and Coordination'
publication_identifier:
issn:
- 1383-469X
- 1572-8153
publication_status: published
status: public
title: Minimal Energy Path Planning for Wireless Robots
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19853'
author:
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: 'Schomaker G. DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments. In: Advanced Information Networking and Applications
(AINA-07). Vol 21. ; 2007:331-339. doi:10.1109/aina.2007.59'
apa: 'Schomaker, G. (2007). DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments. In Advanced Information Networking and Applications
(AINA-07) (Vol. 21, pp. 331–339). https://doi.org/10.1109/aina.2007.59'
bibtex: '@inproceedings{Schomaker_2007, title={DHHT-RAID: A Distributed Heterogeneous
Scalable Architecture for Dynamic Storage Environments}, volume={21}, DOI={10.1109/aina.2007.59}, booktitle={Advanced
Information Networking and Applications (AINA-07)}, author={Schomaker, Gunnar},
year={2007}, pages={331–339} }'
chicago: 'Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments.” In Advanced Information Networking and Applications
(AINA-07), 21:331–39, 2007. https://doi.org/10.1109/aina.2007.59.'
ieee: 'G. Schomaker, “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments,” in Advanced Information Networking and Applications
(AINA-07), 2007, vol. 21, pp. 331–339.'
mla: 'Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments.” Advanced Information Networking and Applications
(AINA-07), vol. 21, 2007, pp. 331–39, doi:10.1109/aina.2007.59.'
short: 'G. Schomaker, in: Advanced Information Networking and Applications (AINA-07),
2007, pp. 331–339.'
date_created: 2020-10-02T11:49:58Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1109/aina.2007.59
intvolume: ' 21'
language:
- iso: eng
page: 331-339
publication: Advanced Information Networking and Applications (AINA-07)
publication_identifier:
isbn:
- '0769528465'
issn:
- 1550-445X
publication_status: published
status: public
title: 'DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage
Environments'
type: conference
user_id: '15415'
volume: 21
year: '2007'
...
---
_id: '24276'
abstract:
- lang: eng
text: "We define a natural generalization of the prominent k-server problem, the
k-resource problem. It occurs in metric spaces with some demands and resources
given at its points. The demands may vary with time, but the total demand may
never exceed k. The goal of an online algorithm is to satisfy demands by moving
resources, while minimizing the cost for transporting resources. We give an asymptotically
optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive
deterministic one for the k-resource problem on uniform metric spaces consisting
of n points. This extends known results for paging to the more general setting
of k-resource.\r\nBasing on the results for uniform metric spaces, we develop
a randomized algorithm solving the k-resource and the k-server problem on metric
spaces which can be decomposed into components far away from each other. The algorithm
achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra
resources more than the optimal algorithm.\r\n"
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
citation:
ama: 'Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly
Decomposable Metric Spaces. In: Lecture Notes in Computer Science. ; 2007.
doi:10.1007/978-3-540-73951-7_30'
apa: Bienkowski, M., & Kutyłowski, J. (2007). The k-Resource Problem on Uniform
and on Uniformly Decomposable Metric Spaces. Lecture Notes in Computer Science.
https://doi.org/10.1007/978-3-540-73951-7_30
bibtex: '@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg},
title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric
Spaces}, DOI={10.1007/978-3-540-73951-7_30},
booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and
Kutyłowski, Jarosław}, year={2007} }'
chicago: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on
Uniform and on Uniformly Decomposable Metric Spaces.” In Lecture Notes in Computer
Science. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-73951-7_30.
ieee: 'M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on
Uniformly Decomposable Metric Spaces,” 2007, doi: 10.1007/978-3-540-73951-7_30.'
mla: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform
and on Uniformly Decomposable Metric Spaces.” Lecture Notes in Computer Science,
2007, doi:10.1007/978-3-540-73951-7_30.
short: 'M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin,
Heidelberg, 2007.'
date_created: 2021-09-13T13:07:57Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73951-7_30
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '24366'
abstract:
- lang: eng
text: "Dieses Buch beschäftigt sich mit Algorithmen und Methoden der Peer-to-Peer-Netzwerke
und gibt einen Einblick in die aktuelle Forschung.\r\n\r\nUrsprünglich waren Peer-to-Peer-Netzwerke
nur für File-Sharing konzipiert. Mittlerweile hat sich Peer-to-Peer zum Paradigma
für Rechnernetzwerke entwickelt. Ziel dieses Buches ist es, dem Leser ein grundlegendes
Verständnis der Techniken hinter den aktuellen Peer-to-Peer-Netzwerken aufzuzeigen
und im nächsten Schritt Algorithmen vorzustellen, die vielleicht erst in einigen
Jahren umgesetzt werden.\r\n\r\nDas Buch richtet sich in erster Linie an Informatiker
(Studenten ab dem 5. Semester). Aber auch interessierte Nichtinformatiker können
von diesem Buch profitieren, wobei grundlegende Kenntnisse aus den Bereichen der
Mathematik und Informatik vorausgesetzt werden. Die Ziele, Kernaussagen und Ergebnisse
sollten jedoch auch ohne akademischen Hintergrund klar werden."
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Mahlmann P, Schindelhauer C. Peer-to-Peer-Netzwerke. Springer; 2007.
doi:10.1007/978-3-540-33992-2
apa: Mahlmann, P., & Schindelhauer, C. (2007). Peer-to-Peer-Netzwerke.
Springer. https://doi.org/10.1007/978-3-540-33992-2
bibtex: '@book{Mahlmann_Schindelhauer_2007, place={Berlin}, title={Peer-to-Peer-Netzwerke},
DOI={10.1007/978-3-540-33992-2},
publisher={Springer}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2007}
}'
chicago: 'Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke.
Berlin: Springer, 2007. https://doi.org/10.1007/978-3-540-33992-2.'
ieee: 'P. Mahlmann and C. Schindelhauer, Peer-to-Peer-Netzwerke. Berlin:
Springer, 2007.'
mla: Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke.
Springer, 2007, doi:10.1007/978-3-540-33992-2.
short: P. Mahlmann, C. Schindelhauer, Peer-to-Peer-Netzwerke, Springer, Berlin,
2007.
date_created: 2021-09-14T10:29:29Z
date_updated: 2022-01-06T06:56:18Z
department:
- _id: '63'
doi: 10.1007/978-3-540-33992-2
language:
- iso: eng
place: Berlin
publication_identifier:
isbn:
- '9783540339915'
publication_status: published
publisher: Springer
status: public
title: Peer-to-Peer-Netzwerke
type: book
user_id: '15415'
year: '2007'
...
---
_id: '17567'
author:
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
- first_name: Gerhard
full_name: Weikum, Gerhard
last_name: Weikum
citation:
ama: Leonardi S, Mahlmann P, Meyer auf der Heide F, Spirakis PG, Weikum G. Guarding
our digital society’s well-being. e-Strategies, www.britishpublishers.com.
2007;3-10-2007.
apa: Leonardi, S., Mahlmann, P., Meyer auf der Heide, F., Spirakis, P. G., &
Weikum, G. (2007). Guarding our digital society’s well-being. E-Strategies,
Www.Britishpublishers.Com, 3-10–2007.
bibtex: '@article{Leonardi_Mahlmann_Meyer auf der Heide_Spirakis_Weikum_2007, title={Guarding
our digital society’s well-being}, volume={3-10–2007}, journal={e-Strategies,
www.britishpublishers.com}, author={Leonardi, Stefano and Mahlmann, Peter and
Meyer auf der Heide, Friedhelm and Spirakis, Paul G. and Weikum, Gerhard}, year={2007}
}'
chicago: Leonardi, Stefano, Peter Mahlmann, Friedhelm Meyer auf der Heide, Paul
G. Spirakis, and Gerhard Weikum. “Guarding Our Digital Society’s Well-Being.”
E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).
ieee: S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P. G. Spirakis, and G. Weikum,
“Guarding our digital society’s well-being,” e-Strategies, www.britishpublishers.com,
vol. 3-10–2007, 2007.
mla: Leonardi, Stefano, et al. “Guarding Our Digital Society’s Well-Being.” E-Strategies,
Www.Britishpublishers.Com, vol. 3-10–2007, 2007.
short: S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P.G. Spirakis, G. Weikum,
E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).
date_created: 2020-08-03T14:26:31Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
language:
- iso: eng
publication: e-Strategies, www.britishpublishers.com
status: public
title: Guarding our digital society's well-being
type: journal_article
user_id: '15415'
volume: 3-10-2007
year: '2007'
...
---
_id: '18928'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Jakub
full_name: Łopuszański, Jakub
last_name: Łopuszański
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Dynia M, Łopuszański J, Schindelhauer C. Why Robots Need Maps. In: Proc.
of the 14th Colloquium on Structural Information and Communication Complexity
(SIROCCO). ; 2007:37-- 46. doi:10.1007/978-3-540-72951-8_5'
apa: Dynia, M., Łopuszański, J., & Schindelhauer, C. (2007). Why Robots Need
Maps. In Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 37-- 46). https://doi.org/10.1007/978-3-540-72951-8_5
bibtex: '@inproceedings{Dynia_Łopuszański_Schindelhauer_2007, title={Why Robots
Need Maps}, DOI={10.1007/978-3-540-72951-8_5},
booktitle={Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO)}, author={Dynia, Miroslaw and Łopuszański, Jakub and Schindelhauer,
Christian}, year={2007}, pages={37-- 46} }'
chicago: Dynia, Miroslaw, Jakub Łopuszański, and Christian Schindelhauer. “Why Robots
Need Maps.” In Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO), 37-- 46, 2007. https://doi.org/10.1007/978-3-540-72951-8_5.
ieee: M. Dynia, J. Łopuszański, and C. Schindelhauer, “Why Robots Need Maps,” in
Proc. of the 14th Colloquium on Structural Information and Communication Complexity
(SIROCCO), 2007, pp. 37-- 46.
mla: Dynia, Miroslaw, et al. “Why Robots Need Maps.” Proc. of the 14th Colloquium
on Structural Information and Communication Complexity (SIROCCO), 2007, pp.
37-- 46, doi:10.1007/978-3-540-72951-8_5.
short: 'M. Dynia, J. Łopuszański, C. Schindelhauer, in: Proc. of the 14th Colloquium
on Structural Information and Communication Complexity (SIROCCO), 2007, pp. 37--
46.'
date_created: 2020-09-03T10:24:29Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/978-3-540-72951-8_5
language:
- iso: eng
page: 37-- 46
publication: Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO)
publication_identifier:
isbn:
- '9783540729181'
- '9783540729518'
publication_status: published
status: public
title: Why Robots Need Maps
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18929'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
citation:
ama: 'Dynia M, Korzeniowski M, Kutyłowski J. Competitive Maintenance of Minimum
Spanning Trees in Dynamic Graphs. In: Proc. of the 33rd International Conference
on Current Trends in Theory and Practice of Computer Science (SOFSEM’07).
Vol 4362. ; 2007:260--271. doi:10.1007/978-3-540-69507-3_21'
apa: Dynia, M., Korzeniowski, M., & Kutyłowski, J. (2007). Competitive Maintenance
of Minimum Spanning Trees in Dynamic Graphs. In Proc. of the 33rd International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)
(Vol. 4362, pp. 260--271). https://doi.org/10.1007/978-3-540-69507-3_21
bibtex: '@inproceedings{Dynia_Korzeniowski_Kutyłowski_2007, title={Competitive Maintenance
of Minimum Spanning Trees in Dynamic Graphs}, volume={4362}, DOI={10.1007/978-3-540-69507-3_21},
booktitle={Proc. of the 33rd International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM’07)}, author={Dynia, Miroslaw and Korzeniowski,
Miroslaw and Kutyłowski, Jarosław}, year={2007}, pages={260--271} }'
chicago: Dynia, Miroslaw, Miroslaw Korzeniowski, and Jarosław Kutyłowski. “Competitive
Maintenance of Minimum Spanning Trees in Dynamic Graphs.” In Proc. of the 33rd
International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM’07), 4362:260--271, 2007. https://doi.org/10.1007/978-3-540-69507-3_21.
ieee: M. Dynia, M. Korzeniowski, and J. Kutyłowski, “Competitive Maintenance of
Minimum Spanning Trees in Dynamic Graphs,” in Proc. of the 33rd International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07),
2007, vol. 4362, pp. 260--271.
mla: Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees
in Dynamic Graphs.” Proc. of the 33rd International Conference on Current Trends
in Theory and Practice of Computer Science (SOFSEM’07), vol. 4362, 2007, pp.
260--271, doi:10.1007/978-3-540-69507-3_21.
short: 'M. Dynia, M. Korzeniowski, J. Kutyłowski, in: Proc. of the 33rd International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07),
2007, pp. 260--271.'
date_created: 2020-09-03T10:29:52Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69507-3_21
intvolume: ' 4362'
language:
- iso: eng
page: 260--271
publication: Proc. of the 33rd International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM'07)
publication_identifier:
isbn:
- '9783540695066'
- '9783540695073'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
type: conference
user_id: '15415'
volume: 4362
year: '2007'
...
---
_id: '18931'
author:
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
citation:
ama: Kutylowski J. Using Mobile Relays for Ensuring Connectivity in Sparse Networks.;
2007.
apa: Kutylowski, J. (2007). Using Mobile Relays for Ensuring Connectivity in
Sparse Networks.
bibtex: '@book{Kutylowski_2007, place={Universität Paderborn}, title={Using Mobile
Relays for Ensuring Connectivity in Sparse Networks}, author={Kutylowski, Jaroslaw},
year={2007} }'
chicago: Kutylowski, Jaroslaw. Using Mobile Relays for Ensuring Connectivity
in Sparse Networks. Universität Paderborn, 2007.
ieee: J. Kutylowski, Using Mobile Relays for Ensuring Connectivity in Sparse
Networks. Universität Paderborn, 2007.
mla: Kutylowski, Jaroslaw. Using Mobile Relays for Ensuring Connectivity in Sparse
Networks. 2007.
short: J. Kutylowski, Using Mobile Relays for Ensuring Connectivity in Sparse Networks,
Universität Paderborn, 2007.
date_created: 2020-09-03T10:51:14Z
date_updated: 2022-01-06T06:53:54Z
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-20080225023
status: public
title: Using Mobile Relays for Ensuring Connectivity in Sparse Networks
type: dissertation
user_id: '15415'
year: '2007'
...
---
_id: '18933'
author:
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
citation:
ama: Kutylowski J. Competitive Maintenance of Minimum Spanning Trees under Stochastic
Adversaries. 2007.
apa: Kutylowski, J. (2007). Competitive Maintenance of Minimum Spanning Trees under
Stochastic Adversaries.
bibtex: '@article{Kutylowski_2007, title={Competitive Maintenance of Minimum Spanning
Trees under Stochastic Adversaries}, author={Kutylowski, Jaroslaw}, year={2007}
}'
chicago: Kutylowski, Jaroslaw. “Competitive Maintenance of Minimum Spanning Trees
under Stochastic Adversaries,” 2007.
ieee: J. Kutylowski, “Competitive Maintenance of Minimum Spanning Trees under Stochastic
Adversaries.” 2007.
mla: Kutylowski, Jaroslaw. Competitive Maintenance of Minimum Spanning Trees
under Stochastic Adversaries. 2007.
short: J. Kutylowski, (2007).
date_created: 2020-09-03T10:59:51Z
date_updated: 2022-01-06T06:53:55Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-03T10:59:07Z
date_updated: 2020-09-03T10:59:07Z
file_id: '18934'
file_name: pub-hni-2854.pdf
file_size: 229166
relation: main_file
success: 1
file_date_updated: 2020-09-03T10:59:07Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries
type: preprint
user_id: '15415'
year: '2007'
...
---
_id: '20374'
author:
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Marc
full_name: Szymanski, Marc
last_name: Szymanski
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Yuhui
full_name: Shi, Yuhui
last_name: Shi
citation:
ama: 'Dorigo M, Hamann H, Szymanski M, Wörn H, Shi Y. Orientation in a Trail Network
by Exploiting its Geometry for Swarm Robotics. In: IEEE Swarm Intelligence
Symposium, Honolulu, USA, April 1-5. IEEE Press; 2007:310--315. doi:10.1109/SIS.2007.367953'
apa: Dorigo, M., Hamann, H., Szymanski, M., Wörn, H., & Shi, Y. (2007). Orientation
in a Trail Network by Exploiting its Geometry for Swarm Robotics. In IEEE Swarm
Intelligence Symposium, Honolulu, USA, April 1-5 (pp. 310--315). IEEE Press.
https://doi.org/10.1109/SIS.2007.367953
bibtex: '@inproceedings{Dorigo_Hamann_Szymanski_Wörn_Shi_2007, title={Orientation
in a Trail Network by Exploiting its Geometry for Swarm Robotics}, DOI={10.1109/SIS.2007.367953},
booktitle={IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5}, publisher={IEEE
Press}, author={Dorigo, Marco and Hamann, Heiko and Szymanski, Marc and Wörn,
Heinz and Shi, Yuhui}, year={2007}, pages={310--315} }'
chicago: Dorigo, Marco, Heiko Hamann, Marc Szymanski, Heinz Wörn, and Yuhui Shi.
“Orientation in a Trail Network by Exploiting Its Geometry for Swarm Robotics.”
In IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5, 310--315.
IEEE Press, 2007. https://doi.org/10.1109/SIS.2007.367953.
ieee: M. Dorigo, H. Hamann, M. Szymanski, H. Wörn, and Y. Shi, “Orientation in a
Trail Network by Exploiting its Geometry for Swarm Robotics,” in IEEE Swarm
Intelligence Symposium, Honolulu, USA, April 1-5, 2007, pp. 310--315.
mla: Dorigo, Marco, et al. “Orientation in a Trail Network by Exploiting Its Geometry
for Swarm Robotics.” IEEE Swarm Intelligence Symposium, Honolulu, USA, April
1-5, IEEE Press, 2007, pp. 310--315, doi:10.1109/SIS.2007.367953.
short: 'M. Dorigo, H. Hamann, M. Szymanski, H. Wörn, Y. Shi, in: IEEE Swarm Intelligence
Symposium, Honolulu, USA, April 1-5, IEEE Press, 2007, pp. 310--315.'
date_created: 2020-11-17T14:59:51Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/SIS.2007.367953
language:
- iso: eng
page: 310--315
publication: IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5
publisher: IEEE Press
status: public
title: Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '20431'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Erol
full_name: Sahin, Erol
last_name: Sahin
- first_name: Winfield
full_name: Spears, Winfield
last_name: Spears
- first_name: Winfield
full_name: Winfield, Winfield
last_name: Winfield
citation:
ama: 'Hamann H, Wörn H, Sahin E, Spears W, Winfield W. An analytical and spatial
model of foraging in a swarm of robots. In: Swarm Robotics - Second SAB 2006
International Workshop. Vol 4433. ; 2007:43--55. doi:10.1007/978-3-540-71541-2_4'
apa: Hamann, H., Wörn, H., Sahin, E., Spears, W., & Winfield, W. (2007). An
analytical and spatial model of foraging in a swarm of robots. In Swarm Robotics
- Second SAB 2006 International Workshop (Vol. 4433, pp. 43--55). https://doi.org/10.1007/978-3-540-71541-2_4
bibtex: '@inproceedings{Hamann_Wörn_Sahin_Spears_Winfield_2007, title={An analytical
and spatial model of foraging in a swarm of robots}, volume={4433}, DOI={10.1007/978-3-540-71541-2_4},
booktitle={Swarm Robotics - Second SAB 2006 International Workshop}, author={Hamann,
Heiko and Wörn, Heinz and Sahin, Erol and Spears, Winfield and Winfield, Winfield},
year={2007}, pages={43--55} }'
chicago: Hamann, Heiko, Heinz Wörn, Erol Sahin, Winfield Spears, and Winfield Winfield.
“An Analytical and Spatial Model of Foraging in a Swarm of Robots.” In Swarm
Robotics - Second SAB 2006 International Workshop, 4433:43--55, 2007. https://doi.org/10.1007/978-3-540-71541-2_4.
ieee: H. Hamann, H. Wörn, E. Sahin, W. Spears, and W. Winfield, “An analytical and
spatial model of foraging in a swarm of robots,” in Swarm Robotics - Second
SAB 2006 International Workshop, 2007, vol. 4433, pp. 43--55.
mla: Hamann, Heiko, et al. “An Analytical and Spatial Model of Foraging in a Swarm
of Robots.” Swarm Robotics - Second SAB 2006 International Workshop, vol.
4433, 2007, pp. 43--55, doi:10.1007/978-3-540-71541-2_4.
short: 'H. Hamann, H. Wörn, E. Sahin, W. Spears, W. Winfield, in: Swarm Robotics
- Second SAB 2006 International Workshop, 2007, pp. 43--55.'
date_created: 2020-11-19T11:22:26Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-540-71541-2_4
intvolume: ' 4433'
language:
- iso: eng
page: 43--55
publication: Swarm Robotics - Second SAB 2006 International Workshop
status: public
title: An analytical and spatial model of foraging in a swarm of robots
type: conference
user_id: '15415'
volume: 4433
year: '2007'
...
---
_id: '20432'
abstract:
- lang: eng
text: Designing and implementing artificial self-organizing systems is a challenging
task since they typically behave non- intuitive and only little theoretical foundations
exist. Predicting a system of many components with a huge amount of interactions
is beyond human skills. The currently common use of simulations for design support
is not satisfying, as it is time-consuming and the results are most likely sub-
optimal. In this work, we present the derivation of an analytical, time-, and
space-continuous model for a swarm of autonomous robots based on the Fokker-Planck
equation. While the motion model is in most parts physically motivated, the communication
model is based on a heuristic approach. A showcase application to a recently proposed
scenario of collective perception in a huge swarm of robots with very limited
abilities is given and the simulation results are compared to the model. Despite
the high level of abstraction, the prediction discrepancies are small and the
parameters can be mapped one-to-one from the model to the control algorithm. Finally,
we give an outlook on the capabilities of the proposed model, discuss its limitations,
and suggest an improvement that could reduce the number of empirically determined
parameters.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
citation:
ama: 'Hamann H, Wörn H. A Space- and Time-Continuous Model of Self-Organizing Robot
Swarms for Design Support. In: First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007). ; 2007:23--31. doi:10.1109/saso.2007.3'
apa: Hamann, H., & Wörn, H. (2007). A Space- and Time-Continuous Model of Self-Organizing
Robot Swarms for Design Support. In First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007) (pp. 23--31). https://doi.org/10.1109/saso.2007.3
bibtex: '@inproceedings{Hamann_Wörn_2007, title={A Space- and Time-Continuous Model
of Self-Organizing Robot Swarms for Design Support}, DOI={10.1109/saso.2007.3},
booktitle={First International Conference on Self-Adaptive and Self-Organizing
Systems (SASO 2007)}, author={Hamann, Heiko and Wörn, Heinz}, year={2007}, pages={23--31}
}'
chicago: Hamann, Heiko, and Heinz Wörn. “A Space- and Time-Continuous Model of Self-Organizing
Robot Swarms for Design Support.” In First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007), 23--31, 2007. https://doi.org/10.1109/saso.2007.3.
ieee: H. Hamann and H. Wörn, “A Space- and Time-Continuous Model of Self-Organizing
Robot Swarms for Design Support,” in First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31.
mla: Hamann, Heiko, and Heinz Wörn. “A Space- and Time-Continuous Model of Self-Organizing
Robot Swarms for Design Support.” First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31, doi:10.1109/saso.2007.3.
short: 'H. Hamann, H. Wörn, in: First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31.'
date_created: 2020-11-19T11:24:11Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/saso.2007.3
language:
- iso: eng
page: 23--31
publication: First International Conference on Self-Adaptive and Self-Organizing Systems
(SASO 2007)
publication_identifier:
isbn:
- '0769529062'
publication_status: published
status: public
title: A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design
Support
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '20433'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Marius
full_name: Nagy, Marius
last_name: Nagy
- first_name: Naya
full_name: Nagy, Naya
last_name: Nagy
citation:
ama: Hamann H, Wörn H, Nagy M, Nagy N. Embodied Computation. Parallel Processing
Letters. 2007;17(3):287--298.
apa: Hamann, H., Wörn, H., Nagy, M., & Nagy, N. (2007). Embodied Computation.
Parallel Processing Letters, 17(3), 287--298.
bibtex: '@article{Hamann_Wörn_Nagy_Nagy_2007, title={Embodied Computation}, volume={17},
number={3}, journal={Parallel Processing Letters}, author={Hamann, Heiko and Wörn,
Heinz and Nagy, Marius and Nagy, Naya}, year={2007}, pages={287--298} }'
chicago: 'Hamann, Heiko, Heinz Wörn, Marius Nagy, and Naya Nagy. “Embodied Computation.”
Parallel Processing Letters 17, no. 3 (2007): 287--298.'
ieee: H. Hamann, H. Wörn, M. Nagy, and N. Nagy, “Embodied Computation,” Parallel
Processing Letters, vol. 17, no. 3, pp. 287--298, 2007.
mla: Hamann, Heiko, et al. “Embodied Computation.” Parallel Processing Letters,
vol. 17, no. 3, 2007, pp. 287--298.
short: H. Hamann, H. Wörn, M. Nagy, N. Nagy, Parallel Processing Letters 17 (2007)
287--298.
date_created: 2020-11-19T11:32:32Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
intvolume: ' 17'
issue: '3'
language:
- iso: eng
page: 287--298
publication: Parallel Processing Letters
status: public
title: Embodied Computation
type: journal_article
user_id: '15415'
volume: 17
year: '2007'
...
---
_id: '20434'
abstract:
- lang: eng
text: 'Current research in Micro, Nano and Swarm Robots as results of the European
projects Miniman, MiCRoN and I-SWARM will be presented. First, the design and
the control of 5 to 10cm3 sized mobile micro robots with five degrees of freedom
will be shown. They can handle miniaturized parts as for example an optical component
or a biological cell with a size in the micrometre-area with an accuracy of 100nm
under a microscope or a raster-electron microscope. Second, the design and the
control of a 1cm3-sized mobile untethered micro robot will be demonstrated. Here,
the robot consists of five parts: the Piezzo locomotion module, the micro control
unit, the communication unit, the navigation system and the micro gripper. The
mobile robot can be guided and positioned in an arena with an accuracy of 5 micrometre
and can be programmed and controlled over the wireless communication unit. Third,
the design and the control of 3 × 3 × 3 mm3 sized micro-/nanorobots with 2 degrees
of freedom will be presented. The transmission of energy and the communication
between the robots is realized via infrared. The robot controller is fully integrated
and has limited functionalities. Via basic sensors communication functions and
elementary rules and behaviours the micro robot can act in a swarm consisting
of hundreds and thousands of robots. Future applications could be monitoring-,
inspection-, exploring-tasks etc. of big areas or objects.'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Marc
full_name: Szymanski, Marc
last_name: Szymanski
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Ramon
full_name: Estana, Ramon
last_name: Estana
- first_name: Ming
full_name: Xie, Ming
last_name: Xie
- first_name: Steven
full_name: Dubowsky, Steven
last_name: Dubowsky
citation:
ama: 'Hamann H, Szymanski M, Wörn H, Estana R, Xie M, Dubowsky S. From Micro to
Nano and Swarm Robotics. In: Advances in Climbing and Walking Robots. Proceedings
of 10th International Conference (CLAWAR’07), Singapore, July 16-18. ; 2007:15--24.
doi:10.1142/9789812770189_0003'
apa: Hamann, H., Szymanski, M., Wörn, H., Estana, R., Xie, M., & Dubowsky, S.
(2007). From Micro to Nano and Swarm Robotics. In Advances in Climbing and
walking robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore,
July 16-18 (pp. 15--24). https://doi.org/10.1142/9789812770189_0003
bibtex: '@inproceedings{Hamann_Szymanski_Wörn_Estana_Xie_Dubowsky_2007, title={From
Micro to Nano and Swarm Robotics}, DOI={10.1142/9789812770189_0003},
booktitle={Advances in Climbing and walking robots. Proceedings of 10th International
Conference (CLAWAR’07), Singapore, July 16-18}, author={Hamann, Heiko and Szymanski,
Marc and Wörn, Heinz and Estana, Ramon and Xie, Ming and Dubowsky, Steven}, year={2007},
pages={15--24} }'
chicago: Hamann, Heiko, Marc Szymanski, Heinz Wörn, Ramon Estana, Ming Xie, and
Steven Dubowsky. “From Micro to Nano and Swarm Robotics.” In Advances in Climbing
and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07),
Singapore, July 16-18, 15--24, 2007. https://doi.org/10.1142/9789812770189_0003.
ieee: H. Hamann, M. Szymanski, H. Wörn, R. Estana, M. Xie, and S. Dubowsky, “From
Micro to Nano and Swarm Robotics,” in Advances in Climbing and walking robots.
Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18,
2007, pp. 15--24.
mla: Hamann, Heiko, et al. “From Micro to Nano and Swarm Robotics.” Advances
in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07),
Singapore, July 16-18, 2007, pp. 15--24, doi:10.1142/9789812770189_0003.
short: 'H. Hamann, M. Szymanski, H. Wörn, R. Estana, M. Xie, S. Dubowsky, in: Advances
in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07),
Singapore, July 16-18, 2007, pp. 15--24.'
date_created: 2020-11-19T11:37:49Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
doi: 10.1142/9789812770189_0003
language:
- iso: eng
page: 15--24
publication: Advances in Climbing and walking robots. Proceedings of 10th International
Conference (CLAWAR'07), Singapore, July 16-18
status: public
title: From Micro to Nano and Swarm Robotics
type: conference
user_id: '15415'
year: '2007'
...