scispace - formally typeset
Search or ask a question

Showing papers by "Indian Institute of Management Calcutta published in 1986"


Proceedings Article
11 Aug 1986
TL;DR: The number of terminal nodes of the game tree examined by ITERSSS* is a function of M, but is never greater than the number of terminals examined by the alphabeta procedure.
Abstract: When searching game trees, Algorithm SSS* examines fewer terminal nodes than the alphabeta procedure, but has the disadvantage that the storage space required by it is much greater. ITERSSS* is a modified version of SSS* that does not suffer from this limitation. The memory M that is available for use by the OPEN list can be fed as a parameter to ITERSSS* at run time. For successful operation M must lie above a threshold value MO. But MO is small in magnitude and is of the same order as the memory requirement of the alphabeta procedure. The number of terminal nodes of the game tree examined by ITERSSS* is a function of M, but is never greater than the number of terminals examined by the alphabeta procedure. For large enough M, ITERSSS* is identical in operation to SSS*.

9 citations


Journal ArticleDOI
01 Apr 1986
TL;DR: In this article, a study of organizational situations which indicate the hidden realities of Quality of Work Life (QWL) in our organizations, the author focuses on the point that management academics who play...
Abstract: From a study of organizational situations which indicate the hidden realities of Quality of Work Life (QWL) in our organizations, the author focuses on the point that management academics who play ...

7 citations


Proceedings ArticleDOI
01 Feb 1986
TL;DR: Here an attempt is made to develop general methods of analysis, using the notion of the discrimlnant of a search graph as the starting point, and it is hoped that this general approach will encourage similar studies on search graphs other than trees.
Abstract: A search graph has the form of an m-ary tree with bidire:tional arcs of unit cost. In general there are a number of solution paths of different lengths. The shortest solution path has length N. It is assumed that the heuristic estimates of all nongoal nodes, after being appropriately normallzed~ are independent and identically distributed random variables. Under what conditions is the expected number of node expansions polynomial in N ? Earlier efforts at answering this question have considered only special cases. Here an attempt is made to develop general methods of analysis, using the notion of the discrimlnant of a search graph as the starting point. It is hoped that this general approach will encourage similar studies on search graphs other than trees. Section I Introduction A worst-case analysis of a heuristic search algorithm gives at best only an imperfect picture about its performance characteristics. Unfortunately~ an average case analysis is far more difficult to achieve. The major problem lies in deciding how exactly the averaging is to be done. No completely satisfactory method is currently known. One way out is to take a graph of simple structure which is representative in some sense, and then see how a search algorithm llke A* fares when run on it. This has been done by Huyn, Dechter and Pearl ~4G, and by Pearl C6G. Their graph is an m-ary tree, with bidirectional arcs of unit cost and one goal node at a distance N from the root. It is assumed that the heuristic estimates of nongoal nodes, after being appropriately normalized, are independent, identically distributed random variables. The expected number of node expansions made by A* is then computed. In this idealized modbl, no node is expanded more than once by A* t and a minimal cost solution is always obtained. Detailed proofs can be found in Pearl DTJ. Bagchi and Srimani L-~J have looked at the same problem, but because of their interest in inadmissible heuristics, they have given the dlscrlmlnant a major role in Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. © 1986 A C M 0 8 9 7 9 1 1 7 7 6 / 8 6 / 0 0 0 2 / 0 3 0 9 $00 .75

3 citations