TY - CONF
AB - We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\beta$. While for $\beta series = {LNCS}
AU - Mäcker, Alexander
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
AU - Riechers, Sören
ID - 207
T2 - Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
TI - Cost-efficient Scheduling on Machines from the Cloud
ER -
TY - GEN
ED - Meyer auf der Heide, Friedhelm
ID - 187
IS - 1
T2 - Transactions on Parallel Computing (TOPC)
TI - Introduction to the Special Issue on SPAA 2014
ER -
TY - CONF
AB - The self-organizing bio-hybrid collaboration ofrobots and natural plants allows for a variety of interestingapplications. As an example we investigate how robots can beused to control the growth and motion of a natural plant, using LEDs to provide stimuli. We follow an evolutionaryrobotics approach where task performance is determined bymonitoring the plant's reaction. First, we do initial plantexperiments with simple, predetermined controllers. Then weuse image sampling data as a model of the dynamics ofthe plant tip xy position. Second, we use this approach toevolve robot controllers in simulation. The task is to makethe plant approach three predetermined, distinct points in anxy-plane. Finally, we test the evolved controllers in real plantexperiments and find that we cross the reality gap successfully. We shortly describe how we have extended from plant tipto many points on the plant, for a model of the plant stemdynamics. Future work will extend to two-axes image samplingfor a 3-d approach.
AU - Wahby, Mostafa
AU - Hofstadler, Daniel Nicolas
AU - Heinrich, Mary Katherine
AU - Zahadat, Payam
AU - Hamann, Heiko
ID - 19961
SN - 9781509035342
T2 - Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems
TI - An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap
ER -
TY - CONF
AU - Rybář, Milan
AU - Hamann, Heiko
ID - 20002
SN - 9781450342063
T2 - Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016)
TI - Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes
ER -
TY - CONF
AU - Polevoy, Gleb
AU - de Weerdt, M.M.
AU - Jonker, C.M.
ID - 17655
KW - agents
KW - action
KW - repeated reciprocation
KW - fixed
KW - floating
KW - network
KW - Nash equilibrium
KW - social welfare
KW - price of anarchy
KW - price of stability
KW - convex combination
T2 - Proceedings of the 2016 European Conference on Artificial Intelligence
TI - The Game of Reciprocation Habits
VL - Volume 285: ECAI 2016
ER -
TY - CONF
AB - 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).
AU - Cord-Landwehr, Andreas
AU - Fischer, Matthias
AU - Jung, Daniel
AU - Meyer auf der Heide, Friedhelm
ID - 16359
T2 - Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Asymptotically Optimal Gathering on a Grid
ER -
TY - GEN
AB - 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 $\mathcal{O}(n)$ in the fully synchronous
$\mathcal{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 $2\times 2$-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 $L_1$-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 \emph{merged} to be only
one robot. The locality constraint is the significant challenging issue here,
since robot movements 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 connectivity. In our model, robots can obtain a special
state, which marks such a robot to be performing specific connectivity
preserving movements in order to allow later merge operations of the swarm.
Compared to the grid, for gathering in the Euclidean plane for the same robot
and time model the best known upper bound is $\mathcal{O}(n^2)$.
AU - Cord-Landwehr, Andreas
AU - Fischer, Matthias
AU - Jung, Daniel
AU - Meyer auf der Heide, Friedhelm
ID - 16450
T2 - arXiv:1602.03303
TI - Asymptotically Optimal Gathering on a Grid
ER -
TY - JOUR
AB - 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.
AU - Feldotto, Matthias
AU - Graffi, Kalman
ID - 145
IS - 5
JF - Concurrency and Computation: Practice and Experience
TI - Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM
VL - 28
ER -
TY - CONF
AB - Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees.
AU - König, Jürgen
AU - Mäcker, Alexander
AU - Meyer auf der Heide, Friedhelm
AU - Riechers, Sören
ID - 157
T2 - Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
TI - Scheduling with Interjob Communication on Parallel Processors
ER -
TY - GEN
AU - Leder, Lennart
ID - 210
TI - Congestion Games with Mixed Objectives
ER -
TY - GEN
AU - Bülling, Jonas
ID - 5406
TI - Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden
ER -
TY - GEN
AU - Kutzias, Damian
ID - 688
TI - Friendship Processes in Network Creation Games
ER -
TY - CONF
AU - Hamann, Heiko
AU - Divband Soorati, Mohammad
ID - 19979
T2 - IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016)
TI - Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures
ER -
TY - CONF
AU - Khaluf, Yara
AU - Hamann, Heiko
ID - 20003
T2 - ANTS 2016
TI - On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations
VL - 9882
ER -
TY - CONF
AB - We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study.
AU - Kühne, Thomas
AU - Hamann, Heiko
AU - Arifulina, Svetlana
AU - Engels, Gregor
ID - 169
T2 - Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)
TI - Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application
ER -
TY - CONF
AU - Polevoy, Gleb
AU - de Weerdt, Mathijs
AU - Jonker, Catholijn
ID - 17656
KW - agent's influence
KW - behavior
KW - convergence
KW - perron-frobenius
KW - reciprocal interaction
KW - repeated reciprocation
SN - 978-1-4503-4239-1
T2 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems
TI - The Convergence of Reciprocation
ER -
TY - CONF
AB - We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems.
AU - Drees, Maximilian
AU - Gmyr, Robert
AU - Scheideler, Christian
ID - 215
T2 - Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
TI - Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
ER -
TY - GEN
AU - Handirk, Tobias
ID - 1082
TI - Über die Rolle von Informationen in Verkehrsnetzwerken
ER -
TY - JOUR
AB - 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).
AU - Abshoff, Sebastian
AU - Kling, Peter
AU - Markarian, Christine
AU - Meyer auf der Heide, Friedhelm
AU - Pietrzyk, Peter
ID - 139
IS - 4
JF - Journal of Combinatorial Optimization
TI - Towards the price of leasing online
ER -
TY - CONF
AB - Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus.
AU - Abu-Khzam, Faisal N.
AU - Li, Shouwei
AU - Markarian, Christine
AU - Meyer auf der Heide, Friedhelm
AU - Podlipyan, Pavel
ID - 177
T2 - Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)
TI - On the Parameterized Parallel Complexity and the Vertex Cover Problem
ER -