Add to BibSonomyAbstract
Tree search and graph matching problems are ubiquitous in artificial intelligence. Applications areas include scheduling, theorem proving, and scene labeling/interpretation for computer vision. In general these problems have exponential time complexity and become intractable rapidly as the number of variables grow.
© 1988 Optical Society of America
PDF ArticleMore Like This
Use of optical techniques in the consistent labeling problem
M. W. Haney, R. A. Athale, and R. A. Geesey
TUW1 OSA Annual Meeting (FIO) 1987
Problem solving of optical design by R graph with Bidirectional search mechanics
Rong-Seng Chang and Der-Chin Chen
LTuF4 International Lens Design (IODC) 1990
Optical Matrix Encoding for Constraint Satisfaction
Gary C. Marsden, F. Kiamilev, S. Esener, and Sing H. Lee
MC2 Optical Computing (IP) 1989