A systolic design for generating combinations in lexicographic order
β Scribed by J.C Tsay; C.J Lin
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 410 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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
Today, drug combinations are frequently used in the treatment of cancer to increase therapeutic efficacy. Currently used clinical protocols for cancer combination therapies are mainly obtained empirically or on the basis of results from previous clinical trials. Information obtained from clinical pr