373 search results - page 6 / 75 » Nearness and uniform convergence |
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
MOC
2000
13 years 7 months ago
2000
The ultraconvergence property of a gradient recovery technique proposed by Zienkiewicz and Zhu is analyzed for the Laplace equation in the two dimensional setting. Under the assump...
MOC
2002
13 years 7 months ago
2002
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
TON
2008
13 years 7 months ago
2008
Abstract-- Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Bo...