Sciweavers

444 search results - page 64 / 89
» Solving Mastermind Using Genetic Algorithms
Sort
View
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 2 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
AOSD
2011
ACM
13 years 10 days ago
An aspect-oriented approach for implementing evolutionary computation applications
Object-oriented frameworks support design and code reuse for specific application domains. To facilitate the development of evolutionary computation (EC) programs, such as geneti...
Andres J. Ramirez, Adam C. Jensen, Betty H. C. Che...
AEI
2005
99views more  AEI 2005»
13 years 8 months ago
Comparison among five evolutionary-based optimization algorithms
Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed ...
Emad Elbeltagi, Tarek Hegazy, Donald E. Grierson
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 2 months ago
Exploring selection mechanisms for an agent-based distributed evolutionary algorithm
In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since ...
A. E. Eiben, Marc Schoenauer, Juan Luís Jim...
JACM
2002
94views more  JACM 2002»
13 years 8 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