Virtual Bucket Research Articles

빠른 계수 정렬법의 제안

Among comparison sorts, no algorithm excels a current set lower bound of O(nlogn) in operation. Quicksort, the fastest of its kind, has a complexity of O(nlogn) at its best and on average and at worst. This paper thus presents two methods: first is an O(n+k) simple counting sort which operates much more speedily than an O(n+k), (k=maximum value) counting sort, and second is an O(ln) radix counting sort which counts the frequency of numbers in the digit l of a data and saves it in a corresponding virtual bucket in an array, only to virtually divide the array into radix digit numbers. For the 6 experimental data, the proposed algorithm makes O(nlogn) or of Quicksort simple into O(n+k) or O(ln). After all, the proposed sorting algorithm has proved to be much faster than the counting sort and Quicksort.

Multi-Leg Seat Inventory Control Based on EMSU and Virtual Bucket

Expected marginal seat revenue (EMSR) is a well-known method for airline seat inventory control airlines. However, this method employs a static model to study the dynamic reservation process, and does not take into account the risk tolerance of policy makers. Expected marginal seat utility (EMSU) replaces revenue by utility, which addresses the real situation of seat inventory control. However, there is still a lack of multi-leg seat control algorithms based on EMSU. Therefore, using EMSU and bucket algorithms, this paper applies the Markov decision-making process to simulate the flight reservation process and builds a dynamic multi-leg seat inventory control model. Experimental results validate the effectiveness of the proposed method.