1552 search results - page 46 / 311 » On the Complexity of Constant Propagation |
147
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
141
click to vote
DFN
2003
15 years 7 months ago
2003
: Large-scale deployment of virtual private networks with hundreds or thousands of clients means a constant battle with complexity that can only be won by setting up powerful authe...
149
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
140
click to vote
LICS
2008
IEEE
16 years 20 days ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
159
click to vote
FOCS
2007
IEEE
16 years 18 days ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...