5580 search results - page 44 / 1116 » Randomized priority algorithms |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Random projection methods give distributions over k
111
click to vote
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
RTCSA
2007
IEEE
15 years 4 months ago
2007
IEEE
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
102
click to vote
CSREAESA
2006
14 years 11 months ago
2006
- In recent years, there has been a rapid and wide spread proliferation of non-traditional embedded computing platforms such as digital camcorders, cellular phones, and portable me...
STACS
2001
Springer
15 years 2 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...