7129 search results - page 13 / 1426 » Approximation Algorithms for Treewidth |
UAI
2008
13 years 11 months ago
2008
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
CP
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
KR
2010
Springer
14 years 2 months ago
2010
Springer
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
AAAI
2008
2008
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
14 years 2 days ago
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
WG
2005
Springer
14 years 3 months ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...