๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Iterative deepening multiobjective A

โœ Scribed by S. Harikumar; Shashi Kumar

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
423 KB
Volume
58
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Time complexity of iterative-deepening-A
Time complexity of iterative-deepening-Aโˆ—
โœ Richard E. Korf; Michael Reid; Stefan Edelkamp ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 178 KB

We analyze the time complexity of iterative-deepening-A \* (IDA \* ). We first show how to calculate the exact number of nodes at a given depth of a regular search tree, and the asymptotic brute-force branching factor. We then use this result to analyze IDA \* with a consistent, admissible heuristic

A dual-space model of iteratively deepen
A dual-space model of iteratively deepening exploratory learning
โœ John Rieman; Richard M. Young; Andrew Howes ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 396 KB

When users of interactive computers must work with new software without formal training , they rely on strategies for ''exploratory learning'' . These include trial and error , asking for help from other users , and looking for information in printed and on-line documentation . This paper describes

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