205 search results - page 11 / 41 » Incomparability of Results Between Phylogenetic Search Progr... |
AAAI
2007
14 years 11 months ago
2007
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and...
IOR
2008
14 years 9 months ago
2008
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...
IJCAI
1989
14 years 10 months ago
1989
To explore the parallelism among rules is one of the ways to increase the speed of production systems. In this paper, an Object Pattern Matching model is proposed to interpret the...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
BMCBI
2006
14 years 9 months ago
2006
Background: Multiple sequence alignment is the foundation of many important applications in bioinformatics that aim at detecting functionally important regions, predicting protein...