Sciweavers

5595 search results - page 855 / 1119
» Comparing Subsumption Optimizations
Sort
View
231
Voted
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
16 years 14 days ago
Discovering biological motifs with genetic programming
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
Rolv Seehuus, Amund Tveit, Ole Edsberg
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
16 years 14 days ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
GECCO
2005
Springer
122views Optimization» more  GECCO 2005»
16 years 14 days ago
An enhanced GA to improve the search process reliability in tuning of control systems
Evolutionary Algorithms (EAs) have been largely applied to optimisation and synthesis of controllers. In spite of several successful applications and competitive solutions, the st...
Andrea Soltoggio
GECCO
2005
Springer
16 years 14 days ago
Predicting healthcare costs using GAs
Predicting prospective healthcare costs is of increasing importance. Genetic search is used to discover attribute sets and associated posterior probability classifiers that predi...
Christopher R. Stephens, Henri Waelbroeck, S. Tall...
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
16 years 14 days ago
Is negative selection appropriate for anomaly detection?
Negative selection algorithms for hamming and real-valued shape-spaces are reviewed. Problems are identified with the use of these shape-spaces, and the negative selection algori...
Thomas Stibor, Philipp H. Mohr, Jonathan Timmis, C...