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

A parallel algorithm for the monadic unification problem

โœ Scribed by Ivan E. Auger; M. S. Krishnamoorthy

Publisher
Springer Netherlands
Year
1985
Tongue
English
Weight
312 KB
Volume
25
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A parallel QR algorithm for the nonsymme
A parallel QR algorithm for the nonsymmetric eigenvalue problem
โœ Daniel Boley; Robert Maier; Joung Kim ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 973 KB

This paper describes a prototype parallel algorithm for approximating eigenvalues of a dense nonsymmetric matrix on a linear, synchronous processor array. The algorithm is a parallel implementation of the explicitly-shifted QR, employing n distributed-memory processors to deliver all eigenvalues in

A parallel two-list algorithm for the kn
A parallel two-list algorithm for the knapsack problem
โœ Der-Chyuan Lou; Chin-Chen Chang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 695 KB

An n-element knapsack problem has 2" possible solutions to search over, so a task which can be accomplished in 2" trials if an exhaustive search is used. Due to the exponential time in solving the knapsack problem, the problem is considered to be very hard. In the past decade, much effort has been d

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