890 search results - page 97 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
207
click to vote
GECCO
2009
Springer
16 years 27 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
166
click to vote
CP
2007
Springer
16 years 15 days ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
163
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
159
click to vote
AAAI
2007
15 years 8 months ago
2007
Artificial intelligence has begun to play a critical role in basic science research. In high energy physics, AI methods can aid precision measurements that elucidate the underlyi...
188
click to vote
JCB
2000
15 years 6 months ago
2000
Multiple sequence alignments (MSAs) are frequently used in the study of families of protein sequences or DNA/RNA sequences. They are a fundamental tool for the understanding of th...