A parallel implementation of constraint satisfac-tion by arc consistency is presented. The im-plementation is constructed of standard digital hardware elements, used in a very fine-grained, massively parallel style. As an example of how to specialize the design, a parallel implementation for solving graph isomorphism with arc consis-tency is also given. Complexity analyses are given for both circuits. Worst case running time for the algorithms turns out to be linear in the number of variables n and labels a, O(an), and if the I/O must be serial, it will dominate the computation time. Fine-grained parallelism trades off time complexity for space complexity, but the number of gates re-quired is only O(a2n2). I
The use of constraint propagation is the main feature of any constraint solver. It is thus o
Constraint Satisfaction Problems (CSPs) are NP-complete in general, however, there are many tractabl...
Enforcing box consistency---or a variation thereof---is an efficient means to reliably solve nonline...
This paper discusses how better arc consistency algorithms for constraint satisfaction can be develo...
Abstract Applying parallelism to constraint solving seems a promising approach and it has been done ...
AbstractConsistency techniques are an efficient way of tackling constraint satisfaction problems (CS...
AbstractConsistency techniques are an efficient way of tackling constraint satisfaction problems (CS...
Program parallelization becomes increasingly important when new multi-core architectures provide way...
Consistency techniques can significantly reduce the search space of constraint satisfaction problems...
This work presents the parallelisation of the AC-5 arc-consistency algorithm for two dierent paralle...
Program parallelization becomes increasingly important when new multi-core architectures provide way...
Writing efficient parallel programs is the biggest challenge of the software industry for the forese...
Applying parallelism to constraint solving seems a promising approach and it has been done with vary...
Applying parallelism to constraint solving seems a promising approach and it has been done with vary...
Applying parallelism to constraint solving seems a promising approach and it has been done with vary...
The use of constraint propagation is the main feature of any constraint solver. It is thus o
Constraint Satisfaction Problems (CSPs) are NP-complete in general, however, there are many tractabl...
Enforcing box consistency---or a variation thereof---is an efficient means to reliably solve nonline...
This paper discusses how better arc consistency algorithms for constraint satisfaction can be develo...
Abstract Applying parallelism to constraint solving seems a promising approach and it has been done ...
AbstractConsistency techniques are an efficient way of tackling constraint satisfaction problems (CS...
AbstractConsistency techniques are an efficient way of tackling constraint satisfaction problems (CS...
Program parallelization becomes increasingly important when new multi-core architectures provide way...
Consistency techniques can significantly reduce the search space of constraint satisfaction problems...
This work presents the parallelisation of the AC-5 arc-consistency algorithm for two dierent paralle...
Program parallelization becomes increasingly important when new multi-core architectures provide way...
Writing efficient parallel programs is the biggest challenge of the software industry for the forese...
Applying parallelism to constraint solving seems a promising approach and it has been done with vary...
Applying parallelism to constraint solving seems a promising approach and it has been done with vary...
Applying parallelism to constraint solving seems a promising approach and it has been done with vary...
The use of constraint propagation is the main feature of any constraint solver. It is thus o
Constraint Satisfaction Problems (CSPs) are NP-complete in general, however, there are many tractabl...
Enforcing box consistency---or a variation thereof---is an efficient means to reliably solve nonline...