205 search results - page 18 / 41 » Incomparability of Results Between Phylogenetic Search Progr... |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
BMCBI
2005
14 years 9 months ago
2005
Background: General protein evolution models help determine the baseline expectations for the evolution of sequences, and they have been extensively useful in sequence analysis an...
140
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But...
103
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their ma...
ICML
2002
IEEE
15 years 10 months ago
2002
IEEE
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...