608 search results - page 74 / 122 » On Dependent Randomized Rounding Algorithms |
COCO
2010
Springer
13 years 8 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
WCE
2007
13 years 9 months ago
2007
— This paper proposes an age artificial immune system (AAIS), for optimal order pickings in an Automated Storage and Retrieval System (AS/RS) with multiple input/ output stations...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
GD
2004
Springer
14 years 1 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...