✦ LIBER ✦

A characterization of digital search trees from the successful search viewpoint

✍ Scribed by Wojciech Szpankowski

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 1018 KB
Volume: 85
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90050-c

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Unified Approach to the Parallel Const

A Unified Approach to the Parallel Construction of Search Trees

✍ S.K. Das; K.B. Min 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 642 KB

The analysis of a fringe heuristic for b

The analysis of a fringe heuristic for binary search trees

✍ Patricio V Poblete; J.Ian Munro 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Agent searching in a tree and the optima

Agent searching in a tree and the optimality of iterative deepening

✍ Pallab Dasgupta; P.P. Chakrabarti; S.C. DeSarkar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 695 KB

The agent searching framework models the effort of a search strategy in terms of the distance traversed by an agent while exploring the search space. The framework has been found to be useful in modeling search problems where the cost of backtracking and retracing search paths is important in determ

Selfies: searching for the image of God in a digital age

✍ Craig Detweiler 📂 Fiction 📅 2018 🏛 Baker Publishing Group;Brazos Press 🌐 en-US ⚖ 2 MB 👁 3 views

A nationally known writer and speaker on media issues examines the "selfie" phenomenon, helping us explore how we can love God and serve our neighbors through social media.

The incremental maintenance of a Depth-F

The incremental maintenance of a Depth-First-Search tree in directed acyclic graphs

✍ Paolo G. Franciosa; Giorgio Gambosi; Umberto Nanni 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 748 KB

We propose an incremental algorithm to maintain a DFS-forest in a directed acyclic graph under a sequence of arc insertions in 0( nm) worst case total time, where n is the number of nodes and m is the number of arcs after the insertions. This compares favorably with the time required to recompute DF

A correction to “Agent searching in a tr

A correction to “Agent searching in a tree and the optimality of iterative deepening”

✍ Pallab Dasgupta; P.P. Chakrabarti; S.C. DeSarkar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 229 KB

This paper contains a correction to one of the results presented in an earlier work [ 21 and establishes a new result in that direction. In the paper entitled "Agent searching in a tree and the optimality of iterative deepening" [2] we had presented three independent results, namely that there exist