title: Highly parallel consistent labeling algorithm suitable for optoelectronic implementation.
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.
authors.forename: G C
authors.initials: GC
authors.lastname: Marsden
authors.forename: F
authors.initials: F
authors.lastname: Kiamilev
authors.forename: S
authors.initials: S
authors.lastname: Esener
authors.forename: S H
authors.initials: SH
authors.lastname: Lee