会议专题

A Solution of Average Time for Pure and Multiset Permutations

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.

Indez Terms-Permutation Average Time Multiset Evaluation

Ray Jinzhu Chen Kevin Scott Reschke Muchenxuan Tong

Software School of Xiamen University, Xiamen, 361005, PRC StreamSage, 1110 Vermont Ave NW, Suite 600, Washington DC 20005

国际会议

2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)

太原

英文

509-513

2009-07-10(万方平台首次上网日期,不代表论文的发表时间)