1984 search results - page 356 / 397 » The colourful feasibility problem |
AAAI
1996
13 years 11 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
BMCBI
2010
13 years 10 months ago
2010
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...
BMCBI
2010
13 years 10 months ago
2010
Background: The study of biological systems demands computational support. If targeting a biological problem, the reuse of existing computational models can save time and effort. ...
BMCBI
2007
13 years 10 months ago
2007
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...