Sciweavers

FOCI
2007
IEEE
14 years 18 days ago
Evolutionary Algorithms in the Presence of Noise: To Sample or Not to Sample
Abstract-- In this paper, we empirically analyze the convergence behavior of evolutionary algorithms (evolution strategies
Hans-Georg Beyer, Bernhard Sendhoff
FOCI
2007
IEEE
14 years 18 days ago
An Investigation on the Compression Quality of aiNet
AiNet is an immune-inspired algorithm for data compression, i.e. the reduction of redundancy in data sets. In this paper we investigate the compression quality of aiNet. Therefore,...
Thomas Stibor, Jonathan Timmis
FOCI
2007
IEEE
14 years 18 days ago
Conflict Analysis Based on Discernibility and Indiscernibility
Abstract-- The dual notions of discernibility and indiscernibility play an important role in intelligent data analysis. While discernibility focuses on the differences, the indisce...
Yiyu Yao, Yan Zhao
FOCI
2007
IEEE
14 years 18 days ago
On the Influence of Phenotype Plasticity on Genotype Diversity
A large body of research has investigated the advantages of combining phenotype adaptation and genotype adaptation. The hybridization of genetic search and local search methods, of...
Ingo Paenke, Jürgen Branke, Yaochu Jin
FCT
2007
Springer
14 years 18 days ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
FCT
2007
Springer
14 years 18 days ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
FCT
2007
Springer
14 years 18 days ago
Multi-dimensional Packing with Conflicts
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
Leah Epstein, Asaf Levin, Rob van Stee
FCT
2007
Springer
14 years 18 days ago
Productivity of Stream Definitions
We give an algorithm for deciding productivity of a large and natural class of recursive stream definitions. A stream definition is called `productive' if it can be evaluated ...
Jörg Endrullis, Clemens Grabmayer, Dimitri He...
FCT
2007
Springer
14 years 18 days ago
Factorisation Forests for Infinite Words
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
Thomas Colcombet
FCT
2007
Springer
14 years 18 days ago
Local Testing of Message Sequence Charts Is Difficult
Abstract. Message sequence charts are an attractive formalism for specifying communicating systems. One way to test such a system is to substitute a component by a test process and...
Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. N...