Showing papers by "Indian Institute of Management Calcutta published in 1983"
TL;DR: Three heuristic search algorithms, called algorithms a, b and c, are presented and it is shown that on the whole a and b are inferior to c, which is a slightly modified version of b.
Abstract: Three heuristic search algorithms, called algorithms a, b and c, are presented. Their performance, with the admissibility condition relaxed, is compared using the following two criteria: (i) number of node expansions and (ii) cost of solution found. First, a general comparison is made. In this process some variations and extensions of c are also considered. Subsequently, two types of heuristic estimates, called proper and path dependent, are defined, and the algorithms are reexamined. It is shown that on the whole a (Nilsson's algorithm) and b (Martelli's algorithm) are inferior to c, which is a slightly modified version of b. 7 references.
86 citations
TL;DR: It is shown here that the requirement that the heuristic be consistent can be relaxed to the one that theHeuristic be merely admissible, which should encourage wider use of HS in applications.
32 citations
TL;DR: This paper considers the service system MX/G/∞ characterized by an infinite number of servers and a general service time distribution, which is a random variable, the time between group arrivals being exponentially distributed.
25 citations
TL;DR: In this article, the authors take a fresh look at the classic model of a device supported by a single statistically identical spare and provision for repairs, with system failure resulting whenever the currently operating unit fails before the repair of the previously failed unit is completed to allow it to become a spare.
4 citations
TL;DR: This paper develops certain useful results and pre-estimates about the possible minimal cost of implementation and describes a simple reduction methodology to pick-up one of the near minimal or engineering solutions with much less computational labor and, if necessary, the true minimal solution with some extra computation.
Abstract: Minimization of control memory bit dimension constitutes a major problem in the synthesis of a microprogrammed digital computer. This paper investigates the problem in both the cases of static and dynamic microprogramming, i.e., the problems of ROM, as well as WCS minimization. It develops certain useful results and pre-estimates about the possible minimal cost of implementation and finally describes a simple reduction methodology to pick-up one of the near minimal or engineering solutions with much less computational labor and, if necessary, the true minimal solution with some extra computation.
1 citations
01 Jan 1983
TL;DR: In this paper, a flowchart for assessing the potential effectiveness of an ad is developed based on 10 drafts of an advertisement that may contribute most to its effectiveness, and two Calcutta-based samples, one of 100 advertising executives and the other of 160 graduate students, were utilized to identify 10 drafts.
Abstract: There is much ignorance even among advertising professionals as to how an ad creates or fails to create a favourable selling climate for the product advertised. Two Calcutta-based samples, one of 100 advertising executives and the other of 160 graduate students, were utilized to identify 10 drafts of an ad that may contribute most to its effectiveness. Based on these drafts, a flowchart for assessing the potential effectiveness of an ad is developed.
1 citations