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:
“It would be some advantage to live a primitive and frontier life, though in the midst of an outward civilization, if only to learn what are the gross necessaries of life and what methods have been taken to obtain them.”
—Henry David Thoreau (1817–1862)
“A state that denies its citizens their basic rights becomes a danger to its neighbors as well: internal arbitrary rule will be reflected in arbitrary external relations. The suppression of public opinion, the abolition of public competition for power and its public exercise opens the way for the state power to arm itself in any way it sees fit.... A state that does not hesitate to lie to its own people will not hesitate to lie to other states.”
—Václav Havel (b. 1936)
“As our disorderly, competitive technological society is piling up its victims and constantly developing new problems of maladjustment, we must use our scientific knowledge to determine the cause and prevention of suffering rather than putting all our emphasis on its alleviation ...”
—Agnes E. Meyer (1887–1970)