Sciweavers

97 search results - page 9 / 20
» Best SubTree genetic programming
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 1 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
AIR
2006
76views more  AIR 2006»
13 years 7 months ago
Evolved term-weighting schemes in Information Retrieval: an analysis of the solution space
Evolutionary computation techniques are increasingly being applied to problems within Information Retrieval (IR). Genetic programming (GP) has previously been used with some succe...
Ronan Cummins, Colm O'Riordan
ISMB
1994
13 years 8 months ago
High Speed Pattern Matching in Genetic Data Base with Reconfigurable Hardware
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...
Eric Lemoine, Joël Quinqueton, Jean Sallantin
BMCBI
2005
126views more  BMCBI 2005»
13 years 7 months ago
GANN: Genetic algorithm neural networks for the detection of conserved combinations of features in DNA
Background: The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA struc...
Robert G. Beiko, Robert L. Charlebois