2200 search results - page 37 / 440 » Bloch's Constant is Computable |
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The faults are deterministic (i...
PPL
2000
14 years 9 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
CIE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...
JSC
2008
14 years 9 months ago
2008
We present an algorithm for computing generators for the ideal of algebraic relations among sequences which are given by homogeneous linear recurrence equations with constant coef...
102
click to vote
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
In this note, we show that the size of the perimeter of (α, β)-covered objects is a linear function of the diameter. Specifically, for an (α, β)-covered object O, per(O) ≤ c...