2924 search results - page 169 / 585 » Lower Bounds in Distributed Computing |
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
104
click to vote
ATMOS
2008
15 years 2 months ago
2008
Abstract. In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planni...
111
click to vote
DCC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
COMBINATORICS
2006
15 years 1 months ago
2006
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...
90
Voted
SIAMJO
2008
15 years 27 days ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...