12 search results - page 1 / 3 » Hybrid evolutionary algorithms on minimum vertex cover for r... |
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...