6251 search results - page 379 / 1251 » Randomness, Computability, and Density |
159
click to vote
PODC
2004
ACM
16 years 6 days ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
189
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
180
click to vote
IACR
2011
14 years 6 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
157
click to vote
IMSCCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Ensemble Kalman Filter (EnKF) uses a randomized ensemble of subsurface models for error and uncertainty estimation. However, the complexity of geological models and the requiremen...
168
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...