Share Email Print

Proceedings Paper

Optical Techniques For Increasing The Efficiency Of Tree Search Algorithms
Author(s): Michael W. Haney; Ravindra A. Athale
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Artificial Intelligence problems are often formulated as search trees. These problems suffer from exponential growth of the solution space with problem size. Consequently, solutions based on exhaustive search are generally impractical. To overcome the combinatorial explosion, forward-checking techniques are employed to prune the search space down to a manageable size before or during the actual search procedure. Boolean matrices are a natural data representation for those problems in which the initial problem information is given in the form of a set of binary constraints. In this paper optical implementations of Boolean matrix operations are described for manipulating the constraint matrices to perform forward-checking and thereby increase the search efficiency. Architectural issues affecting the speed of these techniques are discussed.

Paper Details

Date Published: 8 February 1988
PDF: 13 pages
Proc. SPIE 0963, Optical Computing '88, (8 February 1988); doi: 10.1117/12.947925
Show Author Affiliations
Michael W. Haney, BDM Corporation (United States)
Ravindra A. Athale, BDM Corporation (United States)

Published in SPIE Proceedings Vol. 0963:
Optical Computing '88
Pierre H. Chavel; Joseph W. Goodman; Gerard Roblin, Editor(s)

© SPIE. Terms of Use
Back to Top