Sciweavers

844 search results - page 103 / 169
» Generalized crowding for genetic algorithms
Sort
View
EC
2000
96views ECommerce» more  EC 2000»
14 years 9 months ago
Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied ...
David A. van Veldhuizen, Gary B. Lamont
JACM
2002
94views more  JACM 2002»
14 years 9 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
CEC
2007
IEEE
15 years 4 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
GECCO
2007
Springer
119views Optimization» more  GECCO 2007»
15 years 4 months ago
Optimising the flow of experiments to a robot scientist with multi-objective evolutionary algorithms
A Robot Scientist is a physically implemented system that applies artificial intelligence to autonomously discover new knowledge through cycles of scientific experimentation. Ad...
Emma Byrne
AIEDAM
2000
134views more  AIEDAM 2000»
14 years 9 months ago
Adaptive enlargement of state spaces in evolutionary designing
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...
John S. Gero, Vladimir A. Kazakov