Sciweavers

715 search results - page 67 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
ISDA
2009
IEEE
15 years 4 months ago
Valley-Adaptive Clearing Scheme for Multimodal Optimization Evolutionary Search
Recent studies [13, 18] have shown that clearing schemes are efficient multi-modal optimization methods. They efficiently reduce genetic drift which is the direct reason for prema...
Mostafa Mostafa Hashim Ellabaan, Yew-Soon Ong
ACSC
2009
IEEE
15 years 4 months ago
Inference of Gene Expression Networks Using Memetic Gene Expression Programming
In this paper we aim to infer a model of genetic networks from time series data of gene expression profiles by using a new gene expression programming algorithm. Gene expression n...
Armita Zarnegar, Peter Vamplew, Andrew Stranieri
HIS
2008
14 years 11 months ago
Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...
Stefano Benedettini, Luca Di Gaspero, Andrea Roli
IJCNN
2000
IEEE
15 years 2 months ago
Supervised Scaled Regression Clustering: An Alternative to Neural Networks
: This paper describes a rather novel method for the supervised training of regression systems that can be an alternative to feedforward Artificial Neural Networks (ANNs) trained w...
Mark J. Embrechts, Dirk Devogelaere, Marcel Rijcka...
RECOMB
2004
Springer
15 years 10 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...