When the Decomposition Meets the Constraint Satisfaction Problem

When the Decomposition Meets the Constraint Satisfaction Problem

This paper explores the joint use of decomposition methods and parallel computing for solving constraint satisfaction problems and introduces a framework called Parallel Decomposition for Constraint Satisfaction Problems (PD-CSP). The main idea is that the set of constraints are first clustered usin...

Full description

Bibliographic Details
Main Authors: Youcef Djenouri, Djamel Djenouri, Zineb Habbas, Jerry Chun-Wei Lin, Tomasz P. Michalak, Alberto Cano
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
CSP
decomposition
scalability
GPU
Online Access:https://ieeexplore.ieee.org/document/9260140/

Internet

https://ieeexplore.ieee.org/document/9260140/

Similar Items