This is a preview. Log in through your library . Abstract Consider a binary Markov random field whose neighbor structure is specified by a countable graph with nodes of uniformly bounded degree. Under ...
This is a preview. Log in through your library . Abstract This paper establishes a fundamental decomposition theorem in multiattribute utility theory. The methodology uses fractional hypercubes to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback