𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparison of iterative and defined classes of search trees

✍ Scribed by Th. Ottman; D. Wood

Publisher
Springer
Year
1982
Tongue
English
Weight
950 KB
Volume
11
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A comparison of minimax tree search algo
A comparison of minimax tree search algorithms
✍ Murray S. Campbell; T.A. Marsland πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 849 KB

Although theoretic performance measures of most game-searching algorithms exist, for various reasons their practicality is limited. This paper examines and extends the existing search methods, and reports on empirical performance studies on trees with useful size and ordering properties. Emphasis is

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

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

A Coalgebraic View of Infinite Trees and
A Coalgebraic View of Infinite Trees and Iteration
✍ Peter Aczel; JiΕ™Γ­ AdΓ‘mek; JiΕ™Γ­ Velebil πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 255 KB

The algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ideal recursive equations are uniquely solvable. This is proved here to be a general coalgebraic phenomenon: let H be an endofunctor such that for every object X a final coalgebra, T X, of H( )+X exists. Then T