Sciweavers

1830 search results - page 205 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
GECCO
2005
Springer
145views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolving an ecology of two-tiered organizations
Evolutionary models typically rely on a single level of evolution for training a team of cooperating agents. I present a model that evolves at two levels—an “organizational”...
Travis Kriplean
HIS
2008
14 years 11 months ago
Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...
Stefano Benedettini, Luca Di Gaspero, Andrea Roli
PEPM
2010
ACM
15 years 7 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
EUROGP
2007
Springer
175views Optimization» more  EUROGP 2007»
15 years 4 months ago
Fast Genetic Programming on GPUs
As is typical in evolutionary algorithms, fitness evaluation in GP takes the majority of the computational effort. In this paper we demonstrate the use of the Graphics Processing...
Simon Harding, Wolfgang Banzhaf