A Lexicographic Optimization Algorithm
β Scribed by A.V. Zykina
- Book ID
- 111572360
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 2004
- Tongue
- English
- Weight
- 99 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0005-1179
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we solve the open problem of designing a costoptimal parallel algorithm for generating permutations of M elements out of the set {0, 1, . . . , N -1}, in lexicographic order. Our algorithm runs on the simplest model of parallel computation, i.e., a linear array of size M, where each pr
A systolic algorithm is described for generating all permutations of \(n\) elements in lexicographic order. The algorithm is designed to be executed on a linear array of \(n\) processors, each having constant size memory, and each being responsible for producing one element of a given permutation. T