158 search results - page 15 / 32 » Evolutionary algorithms and the Vertex Cover problem |
TCS
2008
14 years 10 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
In case the objective function to be minimized is not known analytically and no assumption can be made about the single extremum, global optimization (GO) methods must be used. Pap...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
JACM
2006
14 years 10 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...