Sciweavers

715 search results - page 48 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
WWW
2004
ACM
15 years 10 months ago
Matching web site structure and content
To keep an overview of a complex corporate web sites, it is crucial to understand the relationship of contents, structure and the user's behavior. In this paper, we describe ...
Vassil Gedov, Carsten Stolz, Ralph Neuneier, Micha...
64
Voted
GECCO
2003
Springer
137views Optimization» more  GECCO 2003»
15 years 3 months ago
The Spatially-Dispersed Genetic Algorithm
Abstract. Spatially structured population models improve the performance of genetic algorithms by assisting the selection scheme in maintaining diversity. A significant concern wi...
Grant Dick
IJCAI
1993
14 years 11 months ago
Evolutionary Learning Strategy using Bug-Based Search
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...
Hitoshi Iba, Tetsuya Higuchi, Hugo de Garis, Taisu...
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
15 years 3 months ago
A genetic algorithm encoding for a class of cardinality constraints
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
Helio J. C. Barbosa, Afonso C. C. Lemonge
ICEC
1994
37views more  ICEC 1994»
14 years 11 months ago
A Method for Utilizing Diploid/Dominance in Genetic Search
homologous alleles seemingly compete prior to manifestation in the observed phenotype, will be referred to as sub-phenotype interaction.A method is proposed for implementing diploi...
F. Greene