Pages that link to "Item:Q1116363"
From MaRDI portal
The following pages link to Tree clustering for constraint networks (Q1116363):
Displaying 50 items.
- Computational social choice for coordination in agent networks (Q314440) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- STR2: optimized simple tabular reduction for table constraints (Q429802) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Learning cluster-based structure to solve constraint satisfaction problems (Q647439) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- Constraint models for the covering test problem (Q850459) (← links)
- Coalition structure generation: a survey (Q900307) (← links)
- A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← links)
- Temporal constraint networks (Q1182161) (← links)
- From local to global consistency (Q1193482) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach (Q1204867) (← links)
- Structure identification in relational data (Q1204870) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems (Q1332852) (← links)
- Accelerating new product development by overcoming complexity constraints (Q1371184) (← links)
- On computing minimal models (Q1380414) (← links)
- Local and global relational consistency (Q1391940) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
- Decomposable constraints (Q1589469) (← links)
- A comparison of structural CSP decomposition methods (Q1589639) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Compiling constraint satisfaction problems (Q1606322) (← links)
- Binary vs. non-binary constraints (Q1614859) (← links)
- On point-duration networks for temporal reasoning (Q1614860) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Focusing on independent diagnosis problems (Q1924813) (← links)
- Propositional semantics for disjunctive logic programs (Q1924819) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Optimization of a recursive conveyor by reduction to a constraint satisfaction problem (Q2069702) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
