138 search results - page 6 / 28 » Finding an optimal tree searching strategy in linear time |
ALGORITHMICA
2011
13 years 5 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
MOBIHOC
2003
ACM
14 years 10 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
AAAI
1996
13 years 11 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
FGCS
2000
13 years 10 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...