602 search results - page 109 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
BMCBI
2006
13 years 10 months ago
2006
Background: Genetic recombination can produce heterogeneous phylogenetic histories within a set of homologous genes. These recombination events can be obscured by subsequent resid...
CP
2007
Springer
14 years 4 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
INFORMS
2010
13 years 8 months ago
2010
Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of m...
CNSM
2010
13 years 7 months ago
2010
The classification of encrypted traffic on the fly from network traces represents a particularly challenging application domain. Recent advances in machine learning provide the opp...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...