5562 search results - page 192 / 1113 » Implementing Parallel Cell-DEVS |
132
Voted
SRDS
1998
IEEE
15 years 8 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
138
Voted
CONPAR
1994
15 years 7 months ago
1994
This paper considers the issue of dynamic task control in the context of a parallel Haskell implementation on the GRIP multiprocessor. For the rst time, we report the e ect of our ...
127
Voted
DGCI
2006
Springer
15 years 7 months ago
2006
Springer
Critical kernels constitute a general framework settled in the of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of thi...
104
Voted
EUROPAR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Embedded Runge-Kutta methods are among the most popular methods for the solution of non-stiff initial value problems of ordinary differential equations (ODEs). We investi...
148
Voted
ENTCS
2008
15 years 2 months ago
2008
In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. ...