188 search results - page 30 / 38 » Evolutionary Algorithms for Vertex Cover |
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
82
Voted
SAT
2004
Springer
15 years 5 months ago
2004
Springer
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
SOFSEM
1997
Springer
15 years 3 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
106
click to vote
SYNASC
2005
IEEE
15 years 5 months ago
2005
IEEE
The aim of this work is to analyze the applicability of crowding differential evolution to unsupervised clustering. The basic idea of this approach, interpreting the clustering pr...