2084 search results - page 178 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
276
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
123
click to vote
ALGORITHMICA
2008
15 years 5 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
125
click to vote
CSL
2002
Springer
15 years 4 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
137
click to vote
SC
1994
ACM
15 years 9 months ago
1994
ACM
The N - body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. Greengard's algorithm claims to compu...
147
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...