๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel algorithms for the segment dragging problem

โœ Scribed by Sung Kwon Kim

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
449 KB
Volume
36
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Comments on parallel algorithms for the
Comments on parallel algorithms for the knapsack problem
โœ Carlos Alberto Alonso Sanches; Nei Yoshihiro Soma; Horacio Hideki Yanasse ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 65 KB

Chang et al. [Parallel Comput. (1994) 233] introduced a parallel algorithm based on a shared memory SIMD architecture for the generation phase of the classic Horowitz and Sahni [J. ACM 21(2) (1974) 277] two-list serial algorithm for the knapsack problem. They claimed that their parallel generation p

Parallel Algorithms for Orthotropic Prob
Parallel Algorithms for Orthotropic Problems
โœ Ivar Gustafsson; Gunhild Lindskog ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 784 KB

Finite element meshes and node-numberings suitable for parallel solution with equally loaded processors are presented for linear orthotropic elliptic partial differential equations. These problems are of great importance, for instance in the oil and airfoil industries. The linear systems of equation

An optimal parallel algorithm for digita
An optimal parallel algorithm for digital curve segmentation
โœ Peter Damaschke ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 935 KB

First we give an optimal EREW PRAM algorithm that finds an unknown discrete monotone function f, with domain and range of size n, in O(log n) time using O(n) independent threshold queries of kind "f(x) > y?". Here "independent" means that simultaneous queries always refer to mutually disjoint values