114 search results - page 4 / 23 » New topologies for genetic search space |
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
GECCO
2005
Springer
14 years 4 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
SAC
2011
ACM
13 years 1 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
EH
2003
IEEE
14 years 4 months ago
2003
IEEE
In the present paper, single-opamp sinusoidal oscillators are synthesized using genetic algorithms. The motivation is to evolve new topologies of oscillators using different activ...
WABI
2004
Springer
14 years 4 months ago
2004
Springer
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...