Sciweavers

473 search results - page 47 / 95
» Rank based variation operators for genetic algorithms
Sort
View
BMCBI
2010
143views more  BMCBI 2010»
13 years 7 months ago
A genome alignment algorithm based on compression
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
APIN
2000
103views more  APIN 2000»
13 years 10 months ago
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
Brian J. Ross
CEC
2009
IEEE
14 years 5 months ago
Implicit Context Representation Cartesian Genetic Programming for the assessment of visuo-spatial ability
— In this paper, a revised form of Implicit Context Representation Cartesian Genetic Programming is used in the development of a diagnostic tool for the assessment of patients wi...
Stephen L. Smith, Michael A. Lones
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
14 years 2 months ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
ICMCS
2006
IEEE
192views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Classifier Optimization for Multimedia Semantic Concept Detection
In this paper, we present an AUC (i.e., the Area Under the Curve of Receiver Operating Characteristics (ROC)) maximization based learning algorithm to design the classifier for ma...
Sheng Gao, Qibin Sun