74 search results - page 6 / 15 » Random Debaters and the Hardness of Approximating Stochastic... |
COCO
2010
Springer
14 years 10 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...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
CIBCB
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...