Sciweavers

229 search results - page 17 / 46
» Potential fitness for genetic programming
Sort
View
CEC
2010
IEEE
13 years 5 months ago
Active Learning Genetic programming for record deduplication
The great majority of genetic programming (GP) algorithms that deal with the classification problem follow a supervised approach, i.e., they consider that all fitness cases availab...
Junio de Freitas, Gisele L. Pappa, Altigran Soares...
CEC
2008
IEEE
14 years 2 months ago
A contour method in population-based stochastic algorithms
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
Ying Lin, Jun Zhang, Lu-kai Lan
EUROGP
2005
Springer
156views Optimization» more  EUROGP 2005»
14 years 1 months ago
Evolving Rules for Document Classification
We describe a novel method for using Genetic Programming to create compact classification rules based on combinations of N-Grams (character strings). Genetic programs acquire fitne...
Laurence Hirsch, Masoud Saeedi, Robin Hirsch
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
14 years 1 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang
APIN
1998
98views more  APIN 1998»
13 years 7 months ago
The Evolution of Concurrent Programs
Process algebra are formal languages used for the rigorous specification and analysis of concurrent systems. By using a process algebra as the target language of a genetic program...
Brian J. Ross