Appoaches to filtering in parallel

Part of the Lecture Notes in Computer Science book series (LNCS, volume 597)


We have shown in this chapter how filtering can be performed in parallel. We started with a simple scheme for implementing filtering and filtering with tagging on multiprocessors. Then, we introduced how an arbitrary binary constraint satisfaction problem, i.e., a set of 0-ary and binary dynamic constraints, can be transformed into a connectionist network consisting of 0-nodes and 2-nodes. 2-nodes are initialized with either 1 or 0, depending on whether they correspond to an admissible value combination or an inconsistent one; 0-nodes are initialized with a Gödel number, representing the possible paths of solutions.


Connectionist Network Constraint Satisfaction Constraint Satisfaction Problem Dynamic Constraint Constraint Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Personalised recommendations