Sciweavers

3928 search results - page 555 / 786
» Optimal suffix selection
Sort
View
SIGMOD
1994
ACM
91views Database» more  SIGMOD 1994»
15 years 10 months ago
Estimating Page Fetches for Index Scans with Finite LRU Buffers
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
Arun N. Swami, K. Bernhard Schiefer
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
15 years 10 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood
GECCO
2007
Springer
147views Optimization» more  GECCO 2007»
15 years 10 months ago
A comparison of evaluation methods in coevolution
In this research, we compare four different evaluation methods in coevolution on the Majority Function problem. The size of the problem is selected such that an evaluation against...
Ting-Shuo Yo, Edwin D. de Jong
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 10 months ago
Learning recursive programs with cooperative coevolution of genetic code mapping and genotype
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
Garnett Carl Wilson, Malcolm I. Heywood
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 10 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria