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.
- Temporal constraint networks (Q1182161) (← links)
- From local to global consistency (Q1193482) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- A generic arc-consistency algorithm and its specializations (Q1199922) (← links)
- The logic of constraint satisfaction (Q1204865) (← links)
- Constraint satisfaction using constraint logic programming (Q1204868) (← links)
- Structure identification in relational data (Q1204870) (← links)
- Reasoning about qualitative temporal information (Q1204871) (← links)
- Consistency in networks of relations (Q1231783) (← links)
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling (Q1266543) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- A gentle introduction to Numerica (Q1274762) (← links)
- On the algebraic structure of combinatorial problems (Q1276253) (← links)
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems (Q1307812) (← links)
- Counting representable sets on simple graphs (Q1314321) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
- Characterising tractable constraints (Q1321064) (← links)
- Arc-consistency for continuous variables (Q1321065) (← links)
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems (Q1332852) (← links)
- Model-based inference in CHARME. (Q1342427) (← links)
- A hypergraph model for constraint logic programming and applications to bus drivers' scheduling (Q1353919) (← links)
- Interactive scheduling as a constraint satisfiability problem (Q1356209) (← links)
- Refinements of the maximum approach to decision-making in a fuzzy environment (Q1367463) (← links)
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton} (Q1391927) (← links)
- From local to global consistency in temporal constraint networks (Q1391930) (← links)
- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic (Q1391939) (← links)
- Local and global relational consistency (Q1391940) (← links)
- A theoretical evaluation of selected backtracking algorithms. (Q1399134) (← links)
- Twenty-one large tractable subclasses of Allen's algebra (Q1402726) (← links)
- Fundamental properties of neighbourhood substitution in constraint satisfaction problems (Q1402745) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- A new approach to cyclic ordering of 2D orientations using ternary relation algebras (Q1583517) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- Decomposable constraints (Q1589469) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Compiling constraint satisfaction problems (Q1606322) (← links)
- On point-duration networks for temporal reasoning (Q1614860) (← links)
- Solving multi-granularity temporal constraint networks (Q1614864) (← links)
- On tree-preserving constraints (Q1688715) (← links)
- A global constraint for over-approximation of real-time streams (Q1699526) (← links)
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs (Q1706596) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Relation algebras and their application in temporal and spatial reasoning (Q1781107) (← links)
- Pushing the frontier of minimality (Q1786605) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Constraint satisfaction problems: Algorithms and applications (Q1809839) (← links)
