Sciweavers

835 search results - page 72 / 167
» Dynamic populations in genetic algorithms
Sort
View
118
Voted
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 4 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
87
Voted
CEC
2007
IEEE
15 years 7 months ago
Performance tuning of genetic algorithms with reserve selection
Abstract— This paper provides a deep insight into the performance of genetic algorithms with reserve selection (GARS), and investigates how parameters can be regulated to solve o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu
103
Voted
ASC
2004
15 years 13 days ago
Adaptive reconfiguration of data networks using genetic algorithms
Genetic algorithms are applied to an important, but little-investigated, network design problem, that of reconfiguring the topology and link capacities of an operational network t...
David J. Montana, Talib S. Hussain
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
15 years 4 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
CEC
2007
IEEE
15 years 7 months ago
Continuous dynamic problem generators for evolutionary algorithms
— Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance in the applications of...
Renato Tinós, Shengxiang Yang