1612 search results - page 153 / 323 » Analysing Randomized Distributed Algorithms |
190
click to vote
ALT
2011
Springer
14 years 5 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
146
click to vote
SPIN
2004
Springer
15 years 10 months ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
134
Voted
ICS
2005
Tsinghua U.
15 years 10 months ago
2005
Tsinghua U.
Although unstructured mesh algorithms are a popular means of solving problems across a broad range of disciplines—from texture mapping to computational fluid dynamics—they ar...
154
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
144
click to vote
JSAC
2008
15 years 5 months ago
2008
In this paper, we generalize the random access game model, and show that it provides a general game-theoretic framework for designing contention based medium access control. We ext...