614 search results - page 17 / 123 » Local Computation: Lower and Upper Bounds |
AAAI
1996
13 years 8 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
RANDOM
1998
Springer
13 years 11 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
MFCS
2009
Springer
13 years 12 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
EPEW
2007
Springer
14 years 1 months ago
2007
Springer
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...