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

Parallel minimization algorithms by generalized subdifferentiability

โœ Scribed by C. Sutti; A. Peretti


Publisher
Wuhan University
Year
1996
Tongue
English
Weight
571 KB
Volume
1
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An optimal parallel algorithm for genera
โœ Jong-Chuang Tsay; Wei-Ping Lee ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 430 KB

Permutation generation is an important problem in combinatorial computing. In this paper we present an optimal parallel algorithm to generate all N! permutations of N objects. The algorithm is designed to be executed on a very simple computation model that is a linear array with N identical processo

Parallel algorithms for line generation
โœ Rok Sosiฤ; Richard F. Riesenfeld ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer ๐ŸŒ English โš– 800 KB