32 search results - page 5 / 7 » Tree exploration with logarithmic memory |
AAAI
2007
13 years 10 months ago
2007
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
PLDI
1999
ACM
14 years 22 days ago
1999
ACM
Hardware trends have produced an increasing disparity between processor speeds and memory access times. While a variety of techniques for tolerating or reducing memory latency hav...
ISCA
2010
IEEE
13 years 10 months ago
2010
IEEE
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page t...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...