Sciweavers

281 search results - page 19 / 57
» Code Compaction Using Genetic Algorithms
Sort
View
GECCO
2003
Springer
14 years 3 months ago
Quad Search and Hybrid Genetic Algorithms
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
L. Darrell Whitley, Deon Garrett, Jean-Paul Watson
ENC
2003
IEEE
14 years 3 months ago
Metrics for Symbol Clustering from a Pseudoergodic Information Source
We discuss a set of metrics, which aims to facilitate the formation of symbol groups from a pseudoergodic information source. An optimal codification can then be applied on the sy...
Angel Fernando Kuri Morales, Oscar Herrera-Alcanta...
CVPR
2010
IEEE
13 years 11 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
SPIRE
2009
Springer
14 years 4 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
ECAL
2007
Springer
14 years 3 months ago
Genotype Editing and the Evolution of Regulation and Memory
Our agent-based model of genotype editing is defined by two distinct genetic components: a coding portion encoding phenotypic solutions, and a non-coding portion used to edit the ...
Luis Mateus Rocha, Jasleen Kaur