𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving partial constraint satisfaction problems with tree decomposition

✍ Scribed by Arie M. C. A. Koster; Stan P. M. van Hoesel; Antoon W. J. Kolen

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
166 KB
Volume
40
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Solving Frequency Assignment Problems vi
Solving Frequency Assignment Problems via Tree-Decomposition1
✍ Arie M.C.A. Koster; Stan P.M. van Hoesel; Antoon W.J. Kolen πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 69 KB

In this extended abstract we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. Wi

Solving balanced Procrustes problem with
Solving balanced Procrustes problem with some constraints by eigenvalue decomposition
✍ Yuyang Qiu; Anding Wang πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 499 KB

The balanced Procrustes problem with some special constraints such as symmetric orthogonality and symmetric idempotence are considered. By one time eigenvalue decomposition of the matrix product generated by the matrices A and B, the constrained solutions are constructed simply. Similar strategy is

A C-tree decomposition algorithm for 2D
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
✍ Xiao-Shan Gao; Qiang Lin; Gui-Fang Zhang πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 311 KB

In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in