Sciweavers

188 search results - page 23 / 38
» Evolutionary Algorithms for Vertex Cover
Sort
View
PPSN
1998
Springer
15 years 3 months ago
A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...
Marco Laumanns, Günter Rudolph, Hans-Paul Sch...
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 5 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
EC
2008
153views ECommerce» more  EC 2008»
14 years 11 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
15 years 5 months ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...
EVOW
2005
Springer
15 years 5 months ago
Evolutionary Biclustering of Microarray Data
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
Jesús S. Aguilar-Ruiz, Federico Divina