Decomposition Methods For Arbitrary Problems
The following methods can be used for translating an arbitrary constraint satisfaction problem, either binary or otherwise. Since they can also be used on binary problems, they can also be used on the result of making constraints binary, either by translating to the dual problem or by using hidden variables.
Some of these methods associate constraints with nodes of the tree, and define width taking into account the number of constraints associated with nodes. This may reduce the width of some problems. For example, a decomposition in which ten variables are associated with each node has width ten; however, if each of these sets of ten variables is the scope of a constraint, each node can be associated that constraint instead, resulting in width one.
Read more about this topic: Decomposition Method (constraint Satisfaction)
Famous quotes containing the words methods, arbitrary and/or problems:
“I believe in women; and in their right to their own best possibilities in every department of life. I believe that the methods of dress practiced among women are a marked hindrance to the realization of these possibilities, and should be scorned or persuaded out of society.”
—Elizabeth Stuart Phelps (1844–1911)
“... no one who has not been an integral part of a slaveholding community, can have any idea of its abominations.... even were slavery no curse to its victims, the exercise of arbitrary power works such fearful ruin upon the hearts of slaveholders, that I should feel impelled to labor and pray for its overthrow with my last energies and latest breath.”
—Angelina Grimké (1805–1879)
“All problems are finally scientific problems.”
—George Bernard Shaw (1856–1950)