TY - CONF
AU - Polevoy, Gleb
AU - Trajanovski, Stojan
AU - Grosso, Paola
AU - de Laat, Cees
ID - 17652
KW - flow
KW - filter
KW - MMSA
KW - set cover
KW - approximation
KW - local ratio algorithm
SN - 978-3-319-71150-8
T2 - Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I
TI - Filtering Undesirable Flows in Networks
ER -
TY - JOUR
AU - Lüke, Carina
AU - Ritterfeld, Ute
AU - Grimminger, Angela
AU - Liszkowski, Ulf
AU - Rohlfing, Katharina
ID - 20206
JF - Journal of Speech, Language, and Hearing Research
TI - Development of pointing gestures in children with typical and delayed language acquisition.
ER -
TY - GEN
AB - We consider a swarm of $n$ autonomous mobile robots, distributed on a
2-dimensional grid. A basic task for such a swarm is the gathering process: All
robots have to gather at one (not predefined) place. A common local model for
extremely simple robots is the following: The robots do not have a common
compass, only have a constant viewing radius, are autonomous and
indistinguishable, can move at most a constant distance in each step, cannot
communicate, are oblivious and do not have flags or states. The only gathering
algorithm under this robot model, with known runtime bounds, needs
$\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time
model for the algorithm is the fully synchronous $\mathcal{FSYNC}$ model. On
the other side, in the case of the 2-dimensional grid, the only known gathering
algorithms for the same time and a similar local model additionally require a
constant memory, states and "flags" to communicate these states to neighbors in
viewing range. They gather in time $\mathcal{O}(n)$.
In this paper we contribute the (to the best of our knowledge) first
gathering algorithm on the grid that works under the same simple local model as
the above mentioned Euclidean plane strategy, i.e., without memory (oblivious),
"flags" and states. We prove its correctness and an $\mathcal{O}(n^2)$ time
bound in the fully synchronous $\mathcal{FSYNC}$ time model. This time bound
matches the time bound of the best known algorithm for the Euclidean plane
mentioned above. We say gathering is done if all robots are located within a
$2\times 2$ square, because in $\mathcal{FSYNC}$ such configurations cannot be
solved.
AU - Fischer, Matthias
AU - Jung, Daniel
AU - Meyer auf der Heide, Friedhelm
ID - 17811
T2 - arXiv:1702.03400
TI - Gathering Anonymous, Oblivious Robots on a Grid
ER -
TY - GEN
AU - Ditz, Michael
AU - Meschut, Gerson
AU - Schwarze, Thomas
AU - Smart, Dominic
ID - 20314
KW - Kleben
KW - Bruchbild
KW - Versagen
TI - Entwicklung und Qualifizierung einer rechnergestützten Auswertemethode zur Differenzierung der Versagensanteile klebtechnisch gefügter Proben
ER -
TY - CONF
AU - Nagel, C.
AU - Fiedler, A.
AU - Brede, M.
AU - Çavdar, Serkan
AU - Meschut, Gerson
AU - Kroll, U.
AU - Matzenmiller, A.
AU - Rybar, G.
AU - Melz, T.
ID - 20376
T2 - 17. Kolloquium Gemeinsame Forschung in der Klebtechnik
TI - Analyse der Schwingfestigkeit geklebter Stahlverbindungen unter mehrkanaliger Belastung
ER -
TY - JOUR
AU - Berner, K
AU - Morris, L
AU - Baumeister, J
AU - Louw, Q
ID - 20460
IS - 1
JF - BMC Musculoskelet Disord
TI - Objective impairments of glait and balance in adults living with HIV-1 infection: a systematic review and meta-analysis of observational studies
VL - 18
ER -
TY - JOUR
AU - Dammann, Christian
AU - Lenz, Peter
AU - Mahnken, Rolf
ID - 10006
JF - Procedia CIRP
SN - 2212-8271
TI - "Thermo-chemo-mechanical Effective Properties for Homogeneous and Heterogeneous n -Phase Mixtures with Application to Curing"
VL - 66
ER -
TY - JOUR
AU - Landmann, M.
AU - Rauls, E.
AU - Schmidt, Wolf Gero
ID - 10020
JF - Physical Review B
SN - 2469-9950
TI - Understanding band alignments in semiconductor heterostructures: Composition dependence and type-I–type-II transition of natural band offsets in nonpolar zinc-blendeAlxGa1−xN/AlyGa1−yNcomposites
ER -
TY - JOUR
AU - Jin, Ligang
AU - Steffen, Eckhard
ID - 10157
JF - J. Graph Theory
TI - Petersen cores and the oddness of cubic graphs
VL - 84
ER -
TY - GEN
AU - Sürücü, Oktay
AU - Mir Djawadi, Behnud
AU - Brangewitz, Sonja
ID - 1057
TI - Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries
ER -