3055 search results - page 72 / 611 » Randomized Search Trees |
DMTCS
2002
13 years 10 months ago
2002
Abstract. q
RECOMB
2007
Springer
14 years 10 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
ECAI
2006
Springer
14 years 1 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
RECOMB
2008
Springer
14 years 10 months ago
2008
Springer
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...