Sciweavers

1830 search results - page 186 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
FCT
2001
Springer
15 years 2 months ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 4 months ago
A novel ab-initio genetic-based approach for protein folding prediction
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary str...
Sergio Raul Duarte Torres, David Camilo Becerra Ro...
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
15 years 11 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami
CEC
2007
IEEE
15 years 2 months ago
Development and validation of different hybridization strategies between GA and PSO
In this paper a new class of hybridization strategies between GA and PSO is presented and validated. The Genetical Swarm Optimization (GSO) approach is presented here with respect ...
A. Gandelli, F. Grimaccia, Marco Mussetta, Paola P...
GECCO
2008
Springer
278views Optimization» more  GECCO 2008»
14 years 11 months ago
Elitism reduces bloat in genetic programming
Elitism is commonly used in generational GP to ensure that the best individuals discovered in a generation are not lost, and are made available for possible further improvements t...
Riccardo Poli, Nicholas Freitag McPhee, Leonardo V...