2095 search results - page 44 / 419 » Improved pebbling bounds |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We prove that the constraint languages invariant under a short sequence of J´onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they h...
JAIR
2010
13 years 8 months ago
2010
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
CP
2007
Springer
14 years 4 months ago
2007
Springer
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Let ( ) denote the maximum size of a -ary code of length and distance . We study the minimum asymptotic redundancy ( ) = log ( ) as grows while and are fixed. For any and 1, long a...