Algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Best sorting algorithm for nearly sorted lists
Communications of the ACM
Algorithm 235: Random permutation
Communications of the ACM
Recognizing Sources of Random Strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
Let @@@@ = {R1,R2,…,RM} be an ordered set of M elements where Ri j whenever i et al [M1] are available for the case when the distribution G(&pgr;) is a uniform distribution (i.e., where all the elements of &pgr; are generated with equal probability). In this paper we consider the case when the distribution G(&pgr;) is not necessarily uniform. We present a strategy for specifying the distribution G(&pgr;) and propose a technique for generating the elements of the &pgr; according to the distribution G(&pgr;). Applications of the technique to generate “almost sorted lists” and in the Travelling Salesman Problem have been presented. Finally, simulation results have been included which demonstrate the power of the Random Permutation Generation (RPG) technique.