Searching for "Remarks on the Upper Bound Theorem." – sorted by Relevance.
-
Comonotonicity, correlation order and premium principles
- follows immediately from Corollary 8 and Theorem 9. Remark that the upper bound in Theorem 10 corresponds
- Cited by 15 (10 self) – Add To MetaCart
-
On the Complexity of Umbra and Penumbra ∗
- , is then O(nk3 ). Remark. The upper bound of Theorem 2 is not known to be tight. However, we prove, in Lemma
- Cited by 1 (1 self) – Add To MetaCart
-
Records, the maximal layer, and the uniform distributions
- proportional to (~)I/(2aa¢l) (/.fl+a) 2/(2"+I) REMARK. The upper bound of Theorem 12 is again sc
- Cited by 3 (0 self) – Add To MetaCart
-
The Analysis of Some Algorithms for Generating Random Variates with a Given Hazard Rate
- +- ( 2A A/2 - ) 10g2(1 + A) REMARK: The upper bound of Theorem 5 increases as 2A/log(A) as A -'1' 00
- Cited by 2 (1 self) – Add To MetaCart
-
The Randomized Integer Convex Hull
- ) + x; x) d dx = Z K P (x) dx 7 as claimed. 2 Proof of Theorem 1.1. We begin with the upper bound
- Cited by 1 (1 self) – Add To MetaCart

