Search cost for a nearly optimal path in a binary tree
نویسندگان
چکیده
منابع مشابه
Search cost for a nearly optimal path in a binary tree
Consider a binary tree, to the vertices of which are assigned independent Bernoulli random variables with mean p ≤ 1/2. How many of these Bernoullis one must look at in order to find a path of length n from the root which maximizes, up to a factor of 1− , the sum of the Bernoullis along the path? In the case, p = 1/2 (the critical value for nontriviality), it is shown to take Θ( −1n) steps. In ...
متن کاملNearly Optimal Minimax Tree Search?
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree. Since real-life minimax trees aren’t uniform, the exact size of this tree isn’t known for most applications. Further, most games have transpositions, implying that there exists a minimal graph which is ...
متن کاملA Concurrency-Optimal Binary Search Tree
The paper presents the first concurrency-optimal implementation of a binary search tree (BST). The implementation, based on a standard sequential implementation of an internal tree, ensures that every schedule is accepted, i.e., interleaving of steps of the sequential code, unless linearizability is violated. To ensure this property, we use a novel read-write locking scheme that protects tree e...
متن کاملThe estimated cost of a search tree on binary words
The problem of constructing a binary search tree for a set of binary words has wide applications in computer science, biology, mineralogy, etc. Shannon considered a similar statement in his optimal coding theorem. It is NP-complete to construct a tree of minimum cost [4]; therefore, the problem arises of finding simple algorithms for constructing nearly optimal trees. We show in this correspond...
متن کاملWord Prediction via a Clustered Optimal Binary Search Tree
Word prediction methodologies depend heavily on the statistical approach that uses the unigram, bigram, and the trigram of words. However, the construction of the N-gram model requires a very large size of memory, which is beyond the capability of many existing computers. Beside this, the approximation reduces the accuracy of word prediction. In this paper, we suggest to use a cluster of comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2009
ISSN: 1050-5164
DOI: 10.1214/08-aap585