Sciweavers

2152 search results - page 30 / 431
» Backward-chaining evolutionary algorithms
Sort
View
CEC
2007
IEEE
16 years 7 days 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
ICTAI
2005
IEEE
15 years 11 months ago
Determining the Optimal Number of Clusters Using a New Evolutionary Algorithm
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré
EMO
2006
Springer
182views Optimization» more  EMO 2006»
15 years 9 months ago
Multi-objective Pole Placement with Evolutionary Algorithms
Multi-Objective Evolutionary Algorithms (MOEA) have been succesfully applied to solve control problems. However, many improvements are still to be accomplished. In this paper a new...
Gustavo Sánchez, Minaya Villasana, Miguel S...
TCS
2008
15 years 5 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev
PPSN
2010
Springer
15 years 4 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...