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

Optimal allocation of dispersed generators for loss minimization

โœ Scribed by Koichi Nara; Yasuhiro Hayashi; Bin Deng; Kazushige Ikeda; Tomoo Ashizawa

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
275 KB
Volume
136
Category
Article
ISSN
0424-7760

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An optimal parallel algorithm for genera
An optimal parallel algorithm for generating permutations in minimal change order
โœ 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