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 -
TY - CONF
AB - We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.
AU - Feldotto, Matthias
AU - Leder, Lennart
AU - Skopalik, Alexander
ID - 209
T2 - Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
TI - Congestion Games with Mixed Objectives
ER -
TY - GEN
AU - Schaefer, Johannes Sebastian
ID - 689
TI - Routing Algorithms on Delayed Networks for Disaster Management Support
ER -
TY - CONF
AB - Defining, measuring, and comparing the quality and efficiency of rendering algorithms in computer graphics is a demanding challenge: quality measures are often application specific and efficiency is strongly influenced by properties of the rendered scene and the used hardware. We survey the currently employed evaluation methods for AQ1 the development process of rendering algorithms. Then, we present our PADrend framework, which supports systematic and flexible development, evaluation, adaptation, and comparison of rendering algorithms, and provides a comfortable and easy-to-use platform for developers of rendering algorithms. The system includes a new evaluation method to improve the objectivity of experimental evaluations of rendering algorithms.
AU - Fischer, Matthias
AU - Jähn, Claudius
AU - Meyer auf der Heide, Friedhelm
AU - Petring, Ralf
ED - Kliemann, Lasse
ED - Sanders, Peter
ID - 16351
T2 - Algorithm Engineering
TI - Algorithm Engineering Aspects of Real-Time Rendering Algorithms
VL - 9220
ER -