Optical Techniques For Increasing The Efficiency Of Tree Search Algorithms

Michael W. Haney; Ravindra A. Athale

doi:10.1117/12.947925

8 February 1988 Optical Techniques For Increasing The Efficiency Of Tree Search Algorithms

Michael W. Haney, Ravindra A. Athale

Proceedings Volume 0963, Optical Computing '88; (1988) https://doi.org/10.1117/12.947925
Event: Optical Computing '88, 1988, Toulon, France

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.

Citation Download Citation

Michael W. Haney and Ravindra A. Athale "Optical Techniques For Increasing The Efficiency Of Tree Search Algorithms", Proc. SPIE 0963, Optical Computing '88, (8 February 1988); https://doi.org/10.1117/12.947925

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available