Sciweavers

444 search results - page 56 / 89
» Solving Mastermind Using Genetic Algorithms
Sort
View
CEC
2010
IEEE
13 years 6 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...
WABI
2001
Springer
110views Bioinformatics» more  WABI 2001»
14 years 1 months ago
Boosting EM for Radiation Hybrid and Genetic Mapping
Radiation hybrid (RH) mapping is a somatic cell technique that is used for ordering markers along a chromosome and estimating physical distances between them. It nicely complements...
Thomas Schiex, Patrick Chabrier, Martin Bouchez, D...
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
13 years 9 months ago
Parameter-less evolutionary search
The paper presents the parameter-less implementation of an evolutionary-based search. It does not need any predefined control parameters values, which are usually used for geneti...
Gregor Papa
AAAI
2008
13 years 11 months ago
Efficient Haplotype Inference with Answer Set Programming
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
Esra Erdem, Ferhan Türe
CEC
2008
IEEE
14 years 3 months ago
A study on constrained MA using GA and SQP: Analytical vs. finite-difference gradients
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...