5793 search results - page 379 / 1159 » Individual communication complexity |
166
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
184
click to vote
EUROMICRO
1996
IEEE
15 years 11 months ago
1996
IEEE
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
169
click to vote
FDL
2007
IEEE
15 years 10 months ago
2007
IEEE
With the increasing complexity of today's embedded systems, there is a need to formally verify such designs at mixed abstraction levels. This is needed if some compoe describ...
162
click to vote
ESAW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
197
click to vote
MPC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...