Sciweavers

374 search results - page 34 / 75
» A Genetic Algorithm for the Index Selection Problem
Sort
View
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 4 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
15 years 1 months ago
Crossover gene selection by spatial location
Spatial based gene selection for division of chromosomes used by crossover operators is proposed for three-dimensional problems. This spatial selection is shown to preserve more g...
David M. Cherba, William F. Punch
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 4 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 3 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
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
15 years 4 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...