technische universität dortmund Technical report for Collaborative Research Center SFB 876 Providing Information by Resource - Constrained Data
نویسنده
چکیده
منابع مشابه
(1+ Є)-approximation for facility location in data streams
We consider the Euclidean facility location problem with uniform opening cost. In this problem, we are given a set of n points P ⊆ R and an opening cost f ∈ R, and we want to find a set of facilities F ⊆ R that minimizes f · |F |+ ∑ p∈P min q∈F d(p, q) , where d(p, q) is the Euclidean distance between p and q. We obtain two main results: • A (1 + ε)-approximation algorithm with running time O(n...
متن کاملTECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
It has been shown that simple evolutionary algorithms are able to solve the minimum cut problem in expected polynomial time when using a multi-objective model of the problem. In this paper, we generalize these ideas to the NP-hard minimum multicut problem. Given a set of k terminal pairs, we prove that evolutionary algorithms in combination with a multi-objective model of the problem are able t...
متن کاملTECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Theoretical Analysis of Diversity Mechanisms for Global Exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to find dissimilar individuals for recombination. We focus on the global exploration capabilities of mutation-based algorithms. Using a simple bimodal test function and rigorous runtime analyses, we compare well-known div...
متن کاملTECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
Often the Pareto front of a multi-objective optimization problem grows exponentially with the problem size. In this case, it is not possible to compute the whole Pareto front efficiently and one is interested in good approximations. We consider how evolutionary algorithms can achieve such approximations by using different diversity mechanisms. We discuss some well-known approaches such as the d...
متن کاملTechnische Universität Dortmund Subproject A1 Data Mining for Ubiquitous System Software Information Extraction in Rapidminer
This paper describes the Information Extraction Plugin 1 [3] which allows the use of Information Extraction mechanisms in RapidMiner 2 .
متن کامل