A Solution of Average Time for Pure and Multiset Permutations

被引：1
|
作者：
Chen, Ray Jinzhu [1 ]
Reschke, Kevin Scott [2 ]
Tong, Muchenxuan [1 ]
机构：
[1] Xiamen Univ, Software Sch, Xiamen 361005, Peoples R China
[2] Stream Sage, Washington, DC 20005 USA
来源：
2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL I | 2009年
关键词：
Permutation; Average Time; Multiset; Evaluation; GENERATING INTEGER PARTITIONS; ALGORITHMS;
D O I：
10.1109/ICIE.2009.103
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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 N-N possible inputs with length N. One formula is for non-lexicographic permutations and the other is for lexicographic permutations. For lexicographic permutations, we use 2 representatives to generate the average time for all N-N possible inputs; and, for non-lexicographic permutations, we use much fewer than 2(N-1) representatives to generate the average time for all N-N possible inputs.
引用
收藏
页码：509 / +
页数：3
相关论文
共 50 条
12345