Sciweavers

850 search results - page 40 / 170
» On Genetic Algorithms and Lindenmayer Systems
Sort
View
CEC
2005
IEEE
15 years 7 months ago
Genetic algorithms with self-organized criticality for dynamic optimization problems
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...
Renato Tinós, Shengxiang Yang
CEC
2009
IEEE
15 years 6 months ago
A parallel genetic algorithm for protein folding prediction using the 3D-HP Side Chain model
— This work presents a methodology for the application of a parallel genetic algorithm (PGA) to the problem of protein folding prediction, using the 3DHP-Side Chain model. This m...
César Manuel Vargas Benítez, Heitor ...
HIS
2008
15 years 3 months ago
Learning Spatial Grammars for Drawn Documents Using Genetic Algorithms
The problem of object recognition may be cast into a spatial grammar framework. This system comprises three novel elements: a spatial organisation of line features, an efficient t...
Simon J. Hickinbotham, Anthony G. Cohn
EOR
2007
133views more  EOR 2007»
15 years 1 months ago
Using genetic algorithm for dynamic and multiple criteria web-site optimizations
In today’s competitive electronic marketplace, companies try to create long-lasting relations with their online customers. Log files and registration forms generate millions of...
Arben Asllani, Alireza Lari
IPM
1998
111views more  IPM 1998»
15 years 1 months ago
Crossover Improvement for the Genetic Algorithm in Information Retrieval
- Genetic algorithms (GAs) search for good solutions to a problem by operations inspired from the natural selection of living beings. Among their many uses, we can count informatio...
Dana Vrajitoru