A stopping rule for a compound poisson random variable
โ Scribed by Randolph, Paul ;Sahino??lu, Mehmet
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 456 KB
- Volume
- 11
- Category
- Article
- ISSN
- 8755-0024
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
One of the key issues in symbolic dynamic filtering (SDF) is how to obtain a lower bound on the length of symbol blocks for computing the state probability vectors of probabilistic finite-state automata (PFSA). Having specified an absolute error bound at a confidence level, this short work formulate
## Abstract In the multifacility location problem, a number of new facilities are to be located so as to minimize a sum of weighted distances. Recently, a lower bound on the optimal value was developed, for use in deciding when to stop an iterative solution procedure. We develop a stronger bound th