We study the update of the distribution in Estimation of Distribution Algorithms, and show that a simple modiļ¬cation leads to unbiased estimates of the optimum. The simple modiļ...
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to ļ¬nd a solution of high ļ¬tness of a given combinatoria...
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...