1089 search results - page 37 / 218 » Bounds on generalized Frobenius numbers |
FSTTCS
1995
Springer
13 years 11 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
AAAI
2006
13 years 9 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
JUCS
2007
13 years 7 months ago
2007
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
COCO
2001
Springer
14 years 4 days ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...