Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence
✍ Scribed by Corrêa, Ricardo C.; Farias, Pablo M.S.; de Souza, Críston P.
- Book ID
- 120515786
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 325 KB
- Volume
- 21
- Category
- Article
- ISSN
- 1570-8667
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Consider a wood cutting setting where different panels have to be cut from large boards. Each cut panel size is put into a stack which remains opened until the last panel of that size is cut. The problem considered here deals with the sequencing of the patterns in order to minimize the maximum numbe
## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph
This paper establishes the asymptotic validity for the moving block bootstrap as an approximation to the joint distribution of the sum and the maximum of a stationary sequence. An application is made to statistical inference for a positive time series where an extreme value statistic and sample mean
Consider a stochastic process {X.}, n = 0, 1, 2 .... with initial value Xo and a sequence of independent, random variables, { Yi}, i ~ N with exponential distribution with parameter one, where X. + 1 = max(X., aX. + Y. + t), 0 < a < 1. In this paper, we show that this sequence behaves like the seque