Shared memory implementation of constraint satisfaction problem resolution

Parallel Processing Letters

Volumn 11, Issue 4, 2001, Pages 487-501

  Habbas, Zineb ^a   Krajecki, Michaël ^b   Singer, Daniel ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

^b LERI   (France)

Author keywords

Constraint satisfaction problems; Irregular applications; OpenMP; Parallel processing; Shared memory

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; PARALLEL ALGORITHMS; PROBLEM SOLVING;

CONSTRAINT LOGIC PROGRAMMING (CLP);

PARALLEL PROCESSING SYSTEMS;

EID: 0035571419     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626401000749     Document Type: Article

References (23)

1. Consistency in networks of relations
2. Dynamic variable ordering in CSPs
3. Look-ahead value ordering for constraint satisfaction problems
4. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition
5. A comparison of structural CSP decomposition methods
6. Extracting constraint satisfaction subproblems
7. Parallel resolution of CSP with OpenMP
8. Networks of constraints: Fundamental properties and applications to pictures processing
9. Some practicable filtering techniques for the constraint satisfaction problem
10. Hybrid algorithms for the constraint satisfaction problem
11. Binary constraint satisfaction problems: Some are harder than others
12. Phase transition and the mushy region in constraint satisfaction problems
13. Tree-clustering schemes for constraint-processing
14. A sufficient condition for backtrack-free search
15. Local consistency in parallel constraint satisfaction networks
16. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs
17. Décomposition: Vers une érosion du pic de difficulté?
18. Load balancing strategies for parallel forward search algorithm with conflict baaed backjumping
19. Recherche coopérative et nogood recording