Sciweavers

1830 search results - page 315 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
CORR
2004
Springer
87views Education» more  CORR 2004»
14 years 9 months ago
Exploring tradeoffs in pleiotropy and redundancy using evolutionary computing
Evolutionary computation algorithms are increasingly being used to solve optimization problems as they have many advantages over traditional optimization algorithms. In this paper...
Matthew J. Berryman, Wei-Li Khoo, Hiep Nguyen, Eri...
ICCV
2003
IEEE
15 years 11 months ago
Feature Selection for Unsupervised and Supervised Inference: the Emergence of Sparsity in a Weighted-based Approach
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
Lior Wolf, Amnon Shashua
ICALP
2005
Springer
15 years 3 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
15 years 1 months ago
Evolving ensemble of classifiers in random subspace
Various methods for ensemble selection and classifier combination have been designed to optimize the results of ensembles of classifiers. Genetic algorithm (GA) which uses the div...
Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souz...
DAS
2006
Springer
14 years 11 months ago
Extraction and Analysis of Document Examiner Features from Vector Skeletons of Grapheme 'th'
Abstract. This paper presents a study of 25 structural features extracted from samples of grapheme `th' that correspond to features commonly used by forensic document examiner...
Vladimir Pervouchine, Graham Leedham