Sciweavers

2174 search results - page 32 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
EPS
1998
Springer
15 years 2 months ago
Evolutionary Algorithms for Vertex Cover
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
Isaac K. Evans
FOCI
2007
IEEE
15 years 1 months ago
Evolutionary Algorithms in the Presence of Noise: To Sample or Not to Sample
Abstract-- In this paper, we empirically analyze the convergence behavior of evolutionary algorithms (evolution strategies
Hans-Georg Beyer, Bernhard Sendhoff
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 4 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
CEC
2007
IEEE
15 years 4 months ago
Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms
— Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The ba...
Lucas Bradstreet, R. Lyndon While, Luigi Barone
IPPS
2007
IEEE
15 years 4 months ago
A hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem
This work presents a new hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem (DRCTSP). The most important differences between the new EA and...
André Renato Villela da Silva, Luiz Satoru ...