Fast parallel constraint satisfaction

DOI10.1016/0004-3702(93)90063-HzbMath0787.68091OpenAlexW1989168011MaRDI QIDQ1313952

Lefteris 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 visionparallel algorithmconstraint satisfaction

Mathematics Subject Classification ID

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

Related Items

A review of literature on parallel constraint solving, Metaheuristics: A bibliography, Local and global relational consistency, Uncovering trees in constraint networks, Unnamed Item, An algebraic characterization of tractable constraints, The complexity of soft constraint satisfaction, Dynamic algorithms for classes of constraint satisfaction problems, A new tractable class of constraint satisfaction problems, An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects, Tractable constraints on ordered domains, Tractable constraints on ordered domains, Constraints, consistency and closure, Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes, On the algebraic structure of combinatorial problems, Efficient Algorithms for Functional Constraints, Characterising tractable constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arc consistency for factorable relations.
• Parallel consistent labeling algorithms
• The complexity of recognizing polyhedral scenes
• From local to global consistency
• A generic arc-consistency algorithm and its specializations
• Constraint relaxation may be perfect
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• A taxonomy of problems with fast parallel algorithms
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A fast parallel algorithm for the maximal independent set problem
• A sufficient condition for backtrack-bounded search
• A Sufficient Condition for Backtrack-Free Search
• Constructing a Maximal Independent Set in Parallel