890 search results - page 29 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
134
Voted
CP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
104
Voted
IRI
2006
IEEE
15 years 8 months ago
2006
IEEE
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
ICMCS
2000
IEEE
15 years 6 months ago
2000
IEEE
A multi-clip query requests multiple video clips. In this paper we address the multi-clip query optimization problem. We propose a new heuristics called Restricted Search Interval...
125
Voted
SPIN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
173
click to vote
BMCBI
2011
14 years 5 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...