Sciweavers

304 search results - page 12 / 61
» Exploiting problem structure in a genetic algorithm approach...
Sort
View
TSP
2010
13 years 2 months ago
Gaussian multiresolution models: exploiting sparse Markov and covariance structure
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
CSCLP
2006
Springer
13 years 11 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 8 months ago
Evolving sequence patterns for prediction of sub-cellular locations of eukaryotic proteins
A genetic algorithm (GA) is utilised to discover known and novel PROSITE-like sequence templates that can be used to classify the sub-cellular location of eukaryotic proteins. Whi...
Greg Paperin
ICMLA
2007
13 years 9 months ago
Improving gene expression programming performance by using differential evolution
Gene Expression Programming (GEP) is an evolutionary algorithm that incorporates both the idea of a simple, linear chromosome of fixed length used in Genetic Algorithms (GAs) and...
Qiongyun Zhang, Chi Zhou, Weimin Xiao, Peter C. Ne...
FBIT
2007
IEEE
14 years 2 months ago
Developmental Evaluation in Genetic Programming: A Position Paper
—Standard genetic programming genotypes are generally highly disorganized and poorly structured, with little code replication. This is also true of existing developmental genetic...
Tuan Hao Hoang, Robert I. McKay, Daryl Essam, Nguy...