๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bounds for circular error probabilities

โœ Scribed by Y. S. Sathe; S. M. Joshi; S. P. Nabar


Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
277 KB
Volume
38
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Estimates of circular error probabilitie
โœ M. Evans; Z. Govindarajulu; J. Barthoulot ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 733 KB
A note on circular error probabilities
โœ Z. Govindarajulu ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 245 KB ๐Ÿ‘ 1 views
Error bounds for EOQ
โœ Ram Rachamadugu ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 284 KB ๐Ÿ‘ 1 views

In this article we explore the properties of the discounted total cost function for the economic order quantity. We show that it is convex. Furthermore, it is shown that the classical economic order quantity (based on Wilson's formula) is not less than the true optimum value based on discounting. Bo

New Error Bounds for Solomonoff Predicti
โœ Marcus Hutter ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 149 KB

Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when it knows the true probability distribution of the sequence. Several new relations between universal Solomonoff sequence pr

Improved Error Bounds for Lattice Rules
โœ Harald Niederreiter ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 424 KB

We establish results on the worst-case errors that can be achieved by wellchosen lattice rules for standard classes of multivariate periodic functions. These theorems improve or generalize earlier results of this type. 1993 Academic Press, Inc

Tighter error bounds and weighted error
โœ Chang, Chin-Chen ;Shih, Zen-Chung ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 66 KB ๐Ÿ‘ 1 views

In this paper we first derive a tighter error bound on form factors as a subdivision criterion for the hierarchical radiosity algorithm. Such an error bound can reduce more unnecessary links and improve the performance of the hierarchical radiosity algorithm to meet a user-specified error tolerance.