نتایج جستجو برای: revenue increasing
تعداد نتایج: 507483 فیلتر نتایج به سال:
One of the classical problems in revenue management is the capacity allocation problem, where the manager must allocate a fixed capacity among several demand classes that arrive sequentially in the order of increasing fares. The objective is to maximize expected revenue. For this classical problem, it has been known that one can compute the optimal protection levels in terms of the fares and th...
Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in O(n log n) time and space. Our goal in this paper is to reduce the space consumption while keeping the time complexity small. For √ n ≤ s ≤ n, we present algorithms that use O(s log n) bits and O( 1 s · n · log n) time for computing the length of a longe...
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be Θ̃( √ N). However, the randomized complexity is wide open. We show that the technique used in earlier work to establish the Ω( √ N) deterministic lower bound fails strongly under randomization: specifically, we show that the communication problems on which...
By reviewing Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS), the Longest Common Increasing Subsequence (LCIS) problem is explored for two non-random input cases in details. Specifically, we designed two algorithms, one solving the input sequence scenario with the case that one sequence is ordered and duplicate elements are allowed in each of sequences, and the second ...
We consider the problem of :nding the longest increasing subsequence in a sliding window over a given sequence (LISW). We propose an output-sensitive data structure that solves this problem in time O(n log log n+OUTPUT) for a sequence of n elements. This data structure substantially improves over the na?@ve generalization of the longest increasing subsequence algorithm and in fact produces an o...
Parallel Solutions of the Longest Increasing Subsequence Problem Using Pipelined Optical Bus Systems
In this paper we give parallel solutions to the problem of finding the Longest Increasing Subsequence of a given sequence of n integers. First, we show the existence of a simple dynamic programming solution. Its running time is Θ(n) and its space requirement is Θ(n). Then, we continue by showing that it is possible to develop two parallel solutions based on optical bus system of n processors, o...
We study the fluctuations, in the large deviations regime, of the longest increasing subsequence of a random i.i.d. sample on the unit square. In particular, our results yield the precise upper and lower exponential tails for the length of the longest increasing subsequence of a random permutation. §.
The interplay between two-dimensional percolation growth models and one-dimensional particle processes has always been a fruitful source of interesting mathematical phenomena. In this paper we develop a connection between the construction of Busemann functions in the Hammersley last-passage percolation model with i.i.d. random weights, and the existence, ergodicity and uniqueness of equilibrium...
background the non-revenue water refers to a difference between the volume of water entering the system and billed authorized consumption. objectives the main purpose of this study is to determine the volume of non-revenue water in order to recognize the factors influencing water losses so that the information gathered can used in non-revenue water reduction management. materials and methods ka...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید