Sciweavers

1830 search results - page 281 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 1 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
PDP
2006
IEEE
15 years 3 months ago
An Experimental Validation of the PRO Model for Parallel and Distributed Computation
— The Parallel Resource-Optimal (PRO) computation model was introduced by Gebremedhin et al. [2002] as a framework for the design and analysis of efficient parallel algorithms. ...
Mohamed Essaïdi, Jens Gustedt
KDD
2006
ACM
107views Data Mining» more  KDD 2006»
15 years 10 months ago
Out-of-core frequent pattern mining on a commodity PC
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
Gregory Buehrer, Srinivasan Parthasarathy, Amol Gh...
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
14 years 11 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
BMCBI
2007
166views more  BMCBI 2007»
14 years 10 months ago
Optimization of filtering criterion for SEQUEST database searching to improve proteome coverage in shotgun proteomics
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
Xinning Jiang, Xiaogang Jiang, Guanghui Han, Mingl...