Sciweavers

498 search results - page 94 / 100
» An Evolutionary Algorithm to Solve Cryptarithmetic Problem
Sort
View
BMCBI
2010
110views more  BMCBI 2010»
13 years 7 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 8 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
Susan Khor
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
14 years 1 months ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...
RECOMB
2006
Springer
14 years 7 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...