2168 search results - page 92 / 434 » Randomized Algorithms and Complexity Theory |
135
click to vote
IANDC
2011
14 years 10 months ago
2011
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
116
click to vote
SAGT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
128
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
103
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
124
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...