Academic
Publications
A Solution of Average Time for Pure and Multiset Permutations

A Solution of Average Time for Pure and Multiset Permutations,10.1109/ICIE.2009.103,Ray Jinzhu Chen,Kevin Scott Reschke,Muchenxuan Tong

A Solution of Average Time for Pure and Multiset Permutations   (Citations: 2)
BibTex | RIS | RefWorks Download
Two efficient techniques for evaluating the performance of candidate multiset permutation algorithms are introduced. We arrive at two formulas for simulating the average running time of multiset permutations for all NN possible inputs with length N. One formula is for non-lexicographic permutations and the other is for lexicographic permutations. For lexicographic permutations, we use 2N-1 representatives to generate the average time for all NN possible inputs; and, for non-lexicographic permutations, we use much fewer than 2N-1 representatives to generate the average time for all NN possible inputs.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: