Abstract
Constraint satisfaction problems require a search through a large set of possibilities. Consistent labeling is a method by which search spaces can be drastically reduced. We present a highly parallel consistent labeling algorithm, which achieves strong k-consistency for any value k and which can include higher-order constraints. The algorithm uses vector outer product, matrix summation, and matrix intersection operations. These operations require local computation with global communication and, therefore, are well suited to a optoelectronic implementation.
© 1991 Optical Society of America
Full Article | PDF ArticleMore Like This
Ramamohan Paturi, Dau-Tsuong Lu, Joseph E. Ford, Sadik C. Esener, and Sing H. Lee
Appl. Opt. 30(8) 917-927 (1991)
Philippe Lalanne, Donald Prévost, and Pierre Chavel
Appl. Opt. 40(23) 3861-3876 (2001)
Gary C. Marsden, Brita Olson, and Sadik C. Esener
Appl. Opt. 35(32) 6320-6330 (1996)