58 search results - page 2 / 12 » Satisfiability and Computing van der Waerden Numbers |
JCT
2010
13 years 3 months ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
ECAI
2004
Springer
13 years 8 months ago
2004
Springer
The task of eliciting all probabilities required for a Bayesian network can be supported by first acquiring qualitative constraints on the numerical quantities to be obtained. Buil...
UAI
2008
13 years 6 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
STOC
2010
ACM
13 years 8 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
CG
2004
Springer
13 years 10 months ago
2004
Springer
In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead...