Pages that link to "Item:Q1844713"
From MaRDI portal
The following pages link to Networks of constraints: Fundamental properties and applications to picture processing (Q1844713):
Displaying 50 items.
- Using OBDDs to handle dynamic constraints (Q290226) (← links)
- Computing and restoring global inverse consistency in interactive constraint satisfaction (Q334804) (← links)
- On minimal constraint networks (Q359976) (← links)
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- A condensed semantics for qualitative spatial reasoning about oriented straight line segments (Q420800) (← links)
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
- New algorithms for max restricted path consistency (Q429801) (← links)
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582) (← links)
- A survey of constraint-based programming paradigms (Q458465) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Qualitative constraint satisfaction problems: an extended framework with landmarks (Q490417) (← links)
- A constraint propagation approach to structural model based image segmentation and recognition (Q497274) (← links)
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (Q543614) (← links)
- Dualities and dual pairs in Heyting algebras (Q603889) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class (Q679419) (← links)
- On some partial line graphs of a hypergraph and the associated matroid (Q686485) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Reduction operations for constraint satisfaction (Q754642) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Fuzzy constraint networks for signal pattern recognition (Q814488) (← links)
- Temporal scenario modelling and recognition based on possibilistic logic (Q814498) (← links)
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning (Q821556) (← links)
- Non-local configuration of component interfaces by constraint satisfaction (Q823765) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Computing leximin-optimal solutions in constraint networks (Q835811) (← links)
- Solving connected row convex constraints by variable elimination (Q840826) (← links)
- On topological consistency and realization (Q850454) (← links)
- The TV-break packing problem (Q853012) (← links)
- Predicting and detecting symmetries in FOL finite model search (Q861703) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- On redundant topological constraints (Q891795) (← links)
- Decomposing a relation into a tree of binary relations (Q909447) (← links)
- Fuzzy reasoning in a multidimensional space of hypotheses (Q911799) (← links)
- A logic language for combinatorial optimization (Q918429) (← links)
- Comments on Mohr and Henderson's path consistency algorithm (Q921947) (← links)
- Soft constraint abstraction based on semiring homomorphism (Q944369) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- A note on some collapse results of valued constraints (Q987814) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462) (← links)
- Local consistency for extended CSPs (Q1035707) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Interval propagation and search on directed acyclic graphs for numerical constraint solving (Q1041436) (← links)
- Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
- Parallel consistent labeling algorithms (Q1104118) (← links)
- Tree clustering for constraint networks (Q1116363) (← links)
- An optimal k-consistency algorithm (Q1124348) (← links)
- No more ``Partial'' and ``Full Looking Ahead'' (Q1128494) (← links)
- Relational consistency algorithms and their application in finding subgraph and graph isomorphisms (Q1143807) (← links)
