7129 search results - page 26 / 1426 » Approximation Algorithms for Treewidth |
JACM
2007
13 years 10 months ago
2007
UAI
2008
14 years 8 days ago
2008
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
IJCAI
2001
14 years 7 days ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
DISOPT
2007
13 years 10 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
EJC
2008
13 years 11 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...