Fast parallel constraint satisfaction

DOI10.1016/0004-3702(93)90063-HMaRDI QIDQ1313952zbMATH OpenOpenAlexFDO

Authors L. M. Kirousis

Publication date 19 May 1994

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(93)90063-h

zbMATH Keywords

computer visionconstraint satisfactionparallel algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Recommendations

• Fast parallel constraint satisfaction
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Publication:3493326
• A tagging method for parallel constraint satisfaction
• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects

Cites work

• A fast parallel algorithm for the maximal independent set problem
• A generic arc-consistency algorithm and its specializations
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A sufficient condition for backtrack-bounded search
• A Sufficient Condition for Backtrack-Free Search
• A taxonomy of problems with fast parallel algorithms
• Arc consistency for factorable relations.
• Constraint relaxation may be perfect
• Constructing a Maximal Independent Set in Parallel
• From local to global consistency
• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 3409270 (Why is no real title available?)
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Parallel consistent labeling algorithms
• The complexity of recognizing polyhedral scenes

Cited in

(29)

• A tagging method for parallel constraint satisfaction
• Constraints, consistency and closure
• Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes
• On the algebraic structure of combinatorial problems
• An exact algorithm for the constraint satisfaction problem: Application to logical inference
• Characterising tractable constraints
• Local and global relational consistency
• Constraint satisfaction problem with bilevel constraint: Application to interpretation of over-segmented images
• A note on domination 3-edge-critical planar graphs
• A new tractable class of constraint satisfaction problems
• Metaheuristics: A bibliography
• Fast and parallel decomposition of constraint satisfaction problems
• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
• The complexity of soft constraint satisfaction
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Uncovering trees in constraint networks
• scientific article; zbMATH DE number 4172390 (Why is no real title available?)
• scientific article; zbMATH DE number 4166938 (Why is no real title available?)
• Computer Architecture for Solving Consistent Labelling Problems
• A review of literature on parallel constraint solving
• Fast parallel constraint satisfaction
• scientific article; zbMATH DE number 2086856 (Why is no real title available?)
• Shape recognition as a constraint satisfaction problem
• Efficient Algorithms for Functional Constraints
• Strong subalgebras and the constraint satisfaction problem
• Tractable constraints on ordered domains
• Tractable constraints on ordered domains
• Dynamic algorithms for classes of constraint satisfaction problems
• An algebraic characterization of tractable constraints

This page was built for publication: Fast parallel constraint satisfaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313952)