Abstract. Agent-based simulation of large multicellular biological systems has become a viable option owing to affordable parallel computers, such as Beowulf-style clusters. We de...
Toh Da-Jun, Francis Tang, Travis Lee, Deepak Sarda...
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,...
Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
Gareth E. Evans, Jonathan M. Keith, Dirk P. Kroese
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...