351 search results - page 35 / 71 » Perfect Constraints Are Tractable |
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract— We consider power allocation algorithms for fixedrate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel stat...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
UAI
2000
13 years 9 months ago
2000
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
MOR
2008
13 years 7 months ago
2008
Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...