Showing papers on "Heuristic published in 1971"

On the optimal detection of curves in noisy pictures

Abstract: : A technique for recognizing systems of lines is presented, in which the heuristic of the problem is not embedded in the recognition algorithm but is expressed in a figure of merit. A multistage decision process is then able to recognize in the input picture the optimal system of lines according to the given figure of merit. Due to the global approach, greater flexibility and adequacy in the particular problem is achieved. The relation between the structure of the figure of merit and the complexity of the optimization process is then discussed. (Modified author abstract)

A Material Handling System Selection Model

Abstract: A technique is presented which can be used to design, or assist in the design of, an integrated materials handling system for a manufacturing facility or a major department of the facility. The developed procedure selects the materials handling equipment to be used to perform a given set of moves in order to miriimize the system's costs associated with the handling, assuming the plant arrangement remains fixed. To demonstrate the selection procedure, an example problem is presented. Since the method is heuristic, no claim of optimality is made.

Attempts to Calculate Global Solutions of Problems that May Have Local Minima

Abstract: : Proposals for obtaining global solutions to not necessarily convex programming problems are examined with emphasis on the associated pitfalls. Included are penalty function methods, Lagrangian methods, grid methods, heuristic methods, random methods, and a branch and bound technique for separable programming problems.

Operational Analysis of Nodal Hierarchies in Network Systems

Abstract: The general location-allocation problem is identified and discussed. The hierarchical extension of this problem is then shown to be of especial interest. A computational algorithm for heuristic solution of the hierarchical problem is described. This algorithm appears to yield solutions of high quality. Finally a numerical problem is examined.

A Branch and Bound Algorithm for Minimizing Cost in Project Scheduling

Abstract: This paper presents a “branch and bound” algorithm for the following problem: given a project consisting of a set of activities partially ordered by a set of precedence restrictions, with each activity having a fixed resource requirement over a specified duration, find that set of activity start times which minimizes the combined cost of fluctuations in resource demand and delay of project completion. Cost bounding procedures are augmented by dominance relationships presented as theorems. Initial feasible schedules are generated using a heuristic scheduling rule. Both the heuristic rule and the branch and bound algorithm have been programmed for the computer. Results indicate that while computation time is related to the project network structure, more significant factors are the number of activities and the relative values of the activity parameters, duration and resource requirement. Also, results indicate that the optimal schedule is relatively insensitive to changes in the ratio of the project complet...

Heuristic algorithms for automated space planning

Abstract: This paper reviews the major characteristics of existing programs for automatically solving space planning problems. It outlines general features of this class of problem and introduces a set of heuristic decision rules called Constraint Structured Planning, which in preliminary tests have efficiently solved a variety of problems. Developments allowing even greater efficiencies are also outlined.

A New Look At Heuristic Teaching

Abstract: NOT MUCH has been said or written lately about heuristic teaching in mathe matics. Perhaps this is because few people can agree on just what heuristic teaching encompasses. Or perhaps we have as sumed that heuristic teaching is synono mous with discovery teaching. Things are further complicated by the fact that the term heuristic has a specialized meaning and lengthy history in the field of mathe matics. To a mathematician the word

Reasoning by Analogy as an Aid to Heuristic Theorem Proving.

Abstract: When heuristic problem-solving programs are faced with large data bases that contain numbers of facts far in excess of those needed to solve any particular problem, their performance rapidly deteriorates. In this paper, the correspondence between a new unsolved problem and a previously solved analogous problem is computed and invoked to tailor large data bases to manageable sizes. This paper outlines the design of an algorithm for generating and exploiting analogies between theorems posed to a resolution-logic system. These algorithms are believed to be the first computationally feasible development of reasoning by analogy to be applied to heuristic theorem proving.

Experimental Study of Heuristic Search Method for Two-Dimensional Multimodal Optimum Point.

Abstract: : The paper is an experimental study of a heuristic method for searching the global optimum point of a two-dimensional, multimodal, non-linear, and unknown criterion function by using sighted, blindfolded, and blind subjects. First, the paper defines a heuristic search, formulates the problem of heuristic search, clarifies important assumptions embedded in the heuristic search, establishes an experimental method for such a heuristic search, and develops a series of experiments. Second, the paper surveys some examples of the heuristic search behaviro, deviation of the trial number of search, and the degree of heuristic search performance. (Author)

Heuristic Models of Social Systems

Abstract: Quantitative models of complex systems, ranging from the cell to social systems, that can be programmed for computers and reflect the dynamics of variation of structures and functions, are becoming very common in science. They allow one to determine the behavior of a system under different conditions, to optimize system control, and outline new approaches to experimental investigation.

A heuristic approach to optimal control

Abstract: Considerable difficulties have been encountered in the direct application of variational methods to control systems optimization because two-point boundary problems are involved which cannot normally be solved in real time. In this paper a method is described in which, by the use of heuristic computation techniques, this limitation is overcome.

Application of questionnaire theory to pattern recognition

Abstract: Analogies between Pattern Recognition and Statistacal Communication Theory are pointed out. With the relative entropy between the "ideal attribute" and "heuristic attribute" sets as an index of performance, optimum selection of possible heuristic operators resuJ ts in a recognition decision in probabilitty, with t he smallest possi ble average number of tests during a "sequential analysis". On the other hand, a computer gencration of quasi-optimal operators may be done based on numerical attributes using the same entropy index of performance. Experimental results are presented : Optimal operator choice is demonstrated for recognition of handwri tten capital letter words and for vocoder speech recogniti on. Computer buildi ng of quasi-optimal operators Is shown for digitized images. They are limited to first level linear numerical operators.