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.
Original language | English (US) |
---|---|
Pages (from-to) | 185-194 |
Number of pages | 10 |
Journal | Applied Optics |
Volume | 30 |
Issue number | 2 |
DOIs | |
State | Published - Jan 10 1991 |
Externally published | Yes |
Keywords
- Consistent labeling
- Constraint satisfaction
- Optoelectronic computing
- Parallel algorithm
ASJC Scopus subject areas
- Atomic and Molecular Physics, and Optics
- Engineering (miscellaneous)
- Electrical and Electronic Engineering