4565 search results - page 376 / 913 » Time Optimal Self-Stabilizing Algorithms |
173
click to vote
AAAI
2000
15 years 6 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
151
click to vote
SIGGRAPH
1993
ACM
15 years 9 months ago
1993
ACM
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model rep...
146
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
143
click to vote
DAM
2010
15 years 5 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
167
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...