158 search results - page 24 / 32 » Evolutionary algorithms and the Vertex Cover problem |
EVOW
2005
Springer
15 years 3 months ago
2005
Springer
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...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
EC
2000
14 years 9 months ago
2000
To successfully apply evolutionary algorithms to the solution of increasingly complex problems, we must develop effective techniques for evolving solutions in the form of interact...
DAM
2008
14 years 10 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
EMO
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...