The design of backtrack algorithms.
Smith, Douglas R.
MacLennan, Bruce J.
MetadataShow full item record
The backtrack control structure is a well Known combinatorial problem solving approach in computer science. The strategy can be abstracted into a program schema with slots for lower level functions which is suitable for the automated synthesis of backtrack programs. Employing a Known model of program synthesis based on a problem reduction problem representation, two reduction rules are developed for transforming a problem specification into a backtrack control structure with specifications for lower level functions. We illustrate these rules with sample problems.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Agrawal, B.N. (1993);This paper presents a boundary-layer model to predict dynamic characteristics of liquid motion in partially filled tanks of a spinning spacecraft. The solution is obtained by solving three boundary-value problems: an ...
Schwartz, Garry S. (Monterey, California. Naval Postgraduate School, 1993-03);This thesis addresses two problems in aligning the recruiting structure for Navy Recruiting Command. The first problem involves two decisions affecting recruiting stations within a single recruiting district: which stations ...
On partitioning an arbitrarily given set of elements of a finite Boolean algebra into the minimum number of sets of compatible elements Colwell, Samuel C., III (Monterey, California. Naval Postgraduate School, 1964);During the past several years at the United States Naval Postgraduate School there has been much interest in obtaining an efficient method for making a time schedule for classes. A mathematical model for a simplified ...