17541 search results - page 415 / 3509 » Complexity in scalable computing |
164
click to vote
EUROPAR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We investigate the performance of two approaches for matrix inversion based on Gaussian (LU factorization) and Gauss-Jordan eliminations. The target architecture is a cur...
139
click to vote
DEXAW
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper describes two self-optimisation techniques that have been employed in the design of two exemplar agent-based mobile computing systems, namely Gullivers Genie and the Ag...
161
click to vote
ASIACRYPT
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. In this paper, we consider the problem of mutually authenticated key exchanges between a low-power client and a powerful server. We show how the Jakobsson-Pointcheval sch...
135
click to vote
IC
2003
15 years 6 months ago
2003
We describe the design and features of our Grid Computing Environments Shell system, or GCEShell. We view computing Grids as providing essentially a globally scalable distributed ...
141
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...