Tractability-preserving transformations of global cost functions
نویسندگان
چکیده
منابع مشابه
Tractability-preserving transformations of global cost functions
Graphical model processing is a central problem in artificial intelligence. The optimization of the combined cost of a network of local cost functions federates a variety of famous problems including CSP, SAT and Max-SAT but also optimization in stochastic variants such as Markov Random Fields and Bayesian networks. Exact solving methods for these problems typically include branch and bound and...
متن کاملGenerating functions for volume-preserving transformations
A general implicit solution for determining volume-preserving transformations in the ndimensional Euclidean space is obtained in terms of a set of 2n generating functions in mixed coordinates. For n = 2, the proposed representation corresponds to the classical definition of a potential stream function in a canonical transformation. For n = 3, the given solution defines a more general class of i...
متن کاملSome Observations on Dirac Measure-Preserving Transformations and their Results
Dirac measure is an important measure in many related branches to mathematics. The current paper characterizes measure-preserving transformations between two Dirac measure spaces or a Dirac measure space and a probability measure space. Also, it studies isomorphic Dirac measure spaces, equivalence Dirac measure algebras, and conjugate of Dirac measure spaces. The equivalence classes of a Dirac ...
متن کاملFiltering Decomposable Global Cost Functions
As (Lee and Leung 2012) have shown, weighted constraint satisfaction problems can benefit from the introduction of global cost functions, leading to a new Cost Function Programming paradigm. In this paper, we explore the possibility of decomposing global cost functions in such a way that enforcing soft local consistencies on the decomposition achieves the same level of consistency on the origin...
متن کاملThe Tractability of Global Constraints
Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or during backtracking search. Propagating global constraints is intractable in general. In this paper, we characterize a number of important questions related to constraint propagation. For example, we consider the two questions: “Is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2016
ISSN: 0004-3702
DOI: 10.1016/j.artint.2016.06.005