𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Effective use of memory in iterative deepening search

✍ Scribed by U.K. Sarkar; P.P. Chakrabarti; S. Ghose; S.C. De Sarkar

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
510 KB
Volume
42
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Refinements to depth-first iterative-dee
Refinements to depth-first iterative-deepening search in automatic theorem proving
✍ Xumin Nie; David A. Plaisted πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 639 KB

This paper will dzscuss two refinements to the depth-first tteratlve-deepemng search strategy The first refinement, the priority system, ts an attempt to simulate best-first search usmg depth-first tterattvedeepenmg search A new data structure, the priority hst, ts introduced mto depth-first tteratt

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

The convergence of an interior-point met
The convergence of an interior-point method using modified search directions in final iterations
✍ Weichung Wang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 765 KB

provide an asymptotic analysis of a primal-dual algorithm for linear programming that uses modified search directions in the final iterations. The algorithm determines the search directions by solving the normal equations using the preconditioned conjugate gradient algorithm. Small dual slack variab