@inproceedings{1787,
  author       = {{Suess, Tim and Schoenrock, Andrew and Meisner, Sebastian and Plessl, Christian}},
  booktitle    = {{Proc. Int. Symp. on Parallel and Distributed Processing Workshops (IPDPSW)}},
  isbn         = {{978-0-7695-4979-8}},
  pages        = {{64--73}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Parallel Macro Pipelining on the Intel SCC Many-Core Computer}}},
  doi          = {{10.1109/IPDPSW.2013.136}},
  year         = {{2013}},
}

@inproceedings{20173,
  abstract     = {{This paper investigates the properties required to evolve Artificial Neural Networks for distributed control in modular robotics, which typically involves non-linear dynamics and complex interactions in the sensori-motor space. We investigate the relation between macro-scale properties (such as modularity and regularity) and micro-scale properties in Neural Network controllers. We show how neurons capable of multiplicative-like arithmetic operations may increase the performance of controllers in several ways whenever challenging control problems with non-linear dynamics are involved. This paper provides evidence that performance and robustness of evolved controllers can be improved by a combination of carefully chosen micro- and macro-scale neural network properties.}},
  author       = {{Hamann, Heiko and Stradner, Jürgen and Bredeche, Nicolas and Cazenille, Leo}},
  booktitle    = {{14th Annual Genetic and Evolutionary Computation Conference, GECCO 2012}},
  pages        = {{89--96}},
  publisher    = {{ACM}},
  title        = {{{Impact of Neuron Models and Network Structure on Evolving Modular Robot Neural Network Controllers}}},
  doi          = {{10.1145/2330163.2330177}},
  year         = {{2012}},
}

@inproceedings{20174,
  abstract     = {{As a contribution to the efforts towards robotic systems of higher flexibility we present our concept of morphologically dynamic robots. Within the projects SYMBRION and REPLICATOR, that focus on modular robotics, we have developed bio-inspired control techniques to achieve new concepts of dynamic, autonomous morphological structures. We propose three modes of coupling between robot modules: swarm, team, and organism mode. We demonstrate our concepts along with simple robot experiments.}},
  author       = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen}},
  booktitle    = {{Austrian Robotics Workshop (Operational Programme Slovenia-Austria)}},
  title        = {{{Towards Morphological Flexibility: Modular Robotics and Bio-inspired Control}}},
  year         = {{2012}},
}

@inproceedings{20175,
  author       = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Zahadat, Payam and Adami, Christoph and Bryson, David M. and Ofria, Charles and Pennock, Robert T.}},
  booktitle    = {{Alife XIII}},
  pages        = {{597--598}},
  publisher    = {{MIT Press}},
  title        = {{{On-line, On-board Evolution of Reaction-Diffusion Control for Self-Adaptation}}},
  year         = {{2012}},
}

@article{20176,
  author       = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}},
  issn         = {{1387-3954}},
  journal      = {{Mathematical and Computer Modelling of Dynamical Systems}},
  number       = {{1}},
  pages        = {{39--50}},
  title        = {{{Self-organized pattern formation in a swarm system as a transient phenomenon of non-linear dynamics}}},
  doi          = {{10.1080/13873954.2011.601418}},
  volume       = {{18}},
  year         = {{2012}},
}

@article{20177,
  abstract     = {{One of the main challenges in automatic controller synthesis is to develop methods that can successfully be applied for complex tasks. The difficulty is increased even more in the case of settings with multiple interacting agents. We apply the artificial homeostatic hormone system (AHHS) approach, which is inspired by the signaling network of unicellular organisms, to control a system of several independently acting agents decentrally. The approach is designed for evaluation-minimal, artificial evolution in order to be applicable to complex modular robotics scenarios. The performance of AHHS controllers is compared with neuroevolution of augmenting topologies (NEAT) in the coupled inverted pendulums benchmark. AHHS controllers are found to be better for multimodular settings. We analyze the evolved controllers with regard to the usage of sensory inputs and the emerging oscillations, and we give a nonlinear dynamics interpretation. The generalization of evolved controllers to initial conditions far from the original conditions is investigated and found to be good. Similarly, the performance of controllers scales well even with module numbers different from the original domain the controller was evolved for. Two reference implementations of a similar controller approach are reported and shown to have shortcomings. We discuss the related work and conclude by summarizing the main contributions of our work.}},
  author       = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}},
  issn         = {{1064-5462}},
  journal      = {{Artificial Life}},
  number       = {{2}},
  pages        = {{165--198}},
  title        = {{{A Hormone-Based Controller for Evaluation-Minimal Evolution in Decentrally Controlled Systems}}},
  doi          = {{10.1162/artl_a_00058}},
  volume       = {{18}},
  year         = {{2012}},
}

@article{20178,
  author       = {{Hamann, Heiko and Schmickl, Thomas and Wörn, Heinz and Crailsheim, Karl}},
  issn         = {{0941-0643}},
  journal      = {{Neural Computing and Applications}},
  number       = {{2}},
  pages        = {{207--218}},
  title        = {{{Analysis of emergent symmetry breaking in collective decision making}}},
  doi          = {{10.1007/s00521-010-0368-6}},
  volume       = {{21}},
  year         = {{2012}},
}

@inproceedings{20179,
  author       = {{Hamann, Heiko and Engelbrecht, Andreas and Birattari, Mauro and Dorigo, Marco and Blum, Christian and Stuetzle, Thomas and Christensen, Anders Lyhne and Gross, Roderich}},
  booktitle    = {{Swarm Intelligence: 8th International Conference, ANTS 2012}},
  isbn         = {{9783642326493}},
  issn         = {{0302-9743}},
  pages        = {{168--179}},
  publisher    = {{Springer}},
  title        = {{{Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions}}},
  doi          = {{10.1007/978-3-642-32650-9_15}},
  volume       = {{7461}},
  year         = {{2012}},
}

@inproceedings{17664,
  author       = {{Cohen, Reuven and Nudelman, Ilia and Polevoy, Gleb}},
  booktitle    = {{Infocom'2012, Orlando, Florida}},
  title        = {{{On the Admission of Dependent Flows in Powerful Sensor Networks}}},
  year         = {{2012}},
}

@article{579,
  abstract     = {{A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.}},
  author       = {{Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}},
  journal      = {{Transactions on Algorithms}},
  number       = {{3}},
  pages        = {{30}},
  publisher    = {{ACM}},
  title        = {{{Smoothed analysis of left-to-right maxima with applications}}},
  doi          = {{10.1145/2229163.2229174}},
  year         = {{2012}},
}

@inproceedings{580,
  abstract     = {{We present and study a new model for energy-aware and profit-oriented scheduling on a single processor.The processor features dynamic speed scaling as well as suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines.On the arrival of a new job, the scheduler may either accept or reject the job.Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values.Here, power consumption at speed $s$ is given by $P(s)=s^{\alpha}+\beta$ and the energy investment is power integrated over time.Additionally, the scheduler may decide to suspend the processor to a sleep mode in which no energy is consumed, though awaking entails fixed transition costs $\gamma$.The objective is to minimize the total value of rejected jobs plus the total energy.Our model combines aspects from advanced energy conservation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models.We show that \emph{rejection-oblivious} schedulers (whose rejection decisions are not based on former decisions) have – in contrast to the model without sleep states – an unbounded competitive ratio.It turns out that the jobs' value densities (the ratio between a job's value and its work) are crucial for the performance of such schedulers.We give an algorithm whose competitiveness nearly matches the lower bound w.r.t\text{.} the maximum value density.If the maximum value density is not too large, the competitiveness becomes $\alpha^{\alpha}+2e\alpha$.Also, we show that it suffices to restrict the value density of low-value jobs only.Using a technique from \cite{Chan:2010} we transfer our results to processors with a fixed maximum speed.}},
  author       = {{Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik}},
  booktitle    = {{Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)}},
  editor       = {{Even, Guy and Rawitz, Dror}},
  pages        = {{218--231}},
  title        = {{{Slow Down & Sleep for Profit in Online Deadline Scheduling}}},
  doi          = {{10.1007/978-3-642-34862-4_17}},
  year         = {{2012}},
}

@inproceedings{581,
  abstract     = {{Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.}},
  author       = {{Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}},
  pages        = {{1272--1283}},
  title        = {{{Self-Organizing Particle Systems}}},
  doi          = {{10.1109/IPDPS.2012.116}},
  year         = {{2012}},
}

@phdthesis{601,
  abstract     = {{Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gel{\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\"u}ssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden k{\"o}nnen. Daf{\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken f{\"u}r die ben{\"o}tigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen F{\"a}llen wird außerdem die ben{\"o}tigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz ben{\"o}tigen w{\"u}rde. So werden kompetititve Faktoren hergeleitet.}},
  author       = {{Kempkes, Barbara}},
  isbn         = {{978-3-942647-21-2}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Local strategies for robot formation problems}}},
  volume       = {{302}},
  year         = {{2012}},
}

@inproceedings{619,
  abstract     = {{Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.}},
  author       = {{Brandes, Philipp and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}},
  pages        = {{9--14}},
  title        = {{{Distributed Computing in Fault-Prone Dynamic Networks}}},
  doi          = {{10.1145/2414815.2414818}},
  year         = {{2012}},
}

@inproceedings{628,
  abstract     = {{Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers.}},
  author       = {{Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}},
  booktitle    = {{Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}},
  pages        = {{72----83}},
  title        = {{{Basic Network Creation Games with Communication Interests}}},
  doi          = {{10.1007/978-3-642-33996-7_7}},
  year         = {{2012}},
}

@inproceedings{636,
  abstract     = {{We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length lk. Opening a facility i using lease type k causes a cost of f k i and ensures that i is open for the next lk time steps. In addition to costs for opening facilities, we have to take connection costs ci j into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.This variant of the online facility location problem was introduced by Nagarajan and Williamson [7] and is strongly related to both the online facility problem by Meyerson [5] and the parking permit problem by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O(Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in lmax.}},
  author       = {{Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter}},
  booktitle    = {{Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)}},
  pages        = {{61--72}},
  title        = {{{An Algorithm for Facility Leasing}}},
  doi          = {{10.1007/978-3-642-31104-8_6}},
  year         = {{2012}},
}

@misc{638,
  author       = {{Eidens, Fabian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}}},
  year         = {{2012}},
}

@inbook{16445,
  author       = {{Kempkes, Barbara and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Experimental Algorithms}},
  isbn         = {{9783642308499}},
  issn         = {{0302-9743}},
  title        = {{{Continuous Local Strategies for Robotic Formation Problems}}},
  doi          = {{10.1007/978-3-642-30850-5_2}},
  year         = {{2012}},
}

@inproceedings{16446,
  author       = {{Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA '12}},
  isbn         = {{9781450312134}},
  title        = {{{Optimal and competitive runtime bounds for continuous, local gathering of mobile robots}}},
  doi          = {{10.1145/2312005.2312009}},
  year         = {{2012}},
}

@inbook{16448,
  author       = {{Kempkes, Barbara and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Algorithms for Sensor Systems}},
  isbn         = {{9783642282089}},
  issn         = {{0302-9743}},
  title        = {{{Local, Self-organizing Strategies for Robotic Formation Problems}}},
  doi          = {{10.1007/978-3-642-28209-6_2}},
  year         = {{2012}},
}