Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Irwin Greenberg"'
Autor:
Wampler, Roy H.
Publikováno v:
Mathematics of Computation, 1970 Oct 01. 24(112), 995-995.
Externí odkaz:
https://www.jstor.org/stable/2004647
Publikováno v:
American Artist; Mar1969, Vol. 33 Issue 3, p76-97, 4p
Autor:
Irwin Greenberg
Publikováno v:
Operations Research Letters. 21:153-158
Level-crossing problems are encountered in a number of stochastic processes such as queueing, dams, inventory and in the cumulative sum (CUSUM) charts of statistical quality control. Approximate computational methods, using Markov chains to determine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d828c098a7e1b26cb5da03c7deeea2d
https://doi.org/10.1016/s0167-6377(97)00033-3
https://doi.org/10.1016/s0167-6377(97)00033-3
Autor:
Irwin Greenberg, Arnold Barnett
Publikováno v:
Interfaces. 21:96-102
The paper discusses the continuing controversy about the magnitudes of particular risks and proper ranking of various hazards that affect our longevity and the longevity of our descendants.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38325939d65035eafb6b20115ab68551
https://doi.org/10.1287/inte.21.6.96
https://doi.org/10.1287/inte.21.6.96
Autor:
Irwin Greenberg
Publikováno v:
Mathematical and Computer Modelling. 15:51-54
An 'explosive' stochastic process features an intensity function that decays exponentially in the absence of occurrences and increases in jumps following each occurrence. Two such processes are examined and some transient and steady-state probabiliti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88ec10bdb2ef67c5d28132830c19a9a7
https://doi.org/10.1016/0895-7177(91)90023-z
https://doi.org/10.1016/0895-7177(91)90023-z
Autor:
Irwin Greenberg
Publikováno v:
Journal of the American Society for Information Science. 41:330-333
Probability estimates for letters in a finite alphabet are derived in order to apply the Huffman algorithm to determine an optimal binary prefix-condition code. The estimates maximize the entropy subject to constraints specifying second-level orderin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85a6e2762e1a045e8d88678d07f4946b
https://doi.org/10.1002/(sici)1097-4571(199007)41:5<330::aid-asi3>3.0.co
https://doi.org/10.1002/(sici)1097-4571(199007)41:5<330::aid-asi3>3.0.co
Publikováno v:
Linea: The Journal of the Art Students League; Spring2010, Vol. 14 Issue 1, p22-22, 1p
Autor:
Irwin Greenberg
Publikováno v:
Naval Research Logistics Quarterly. 27:223-230
Single server queues with general interarrival and service times are approximated by queues with two-point (Bernoulli) interarrival times and exponential service times. The parameters are chosen such that the first four moments of the difference of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c236e86ecae4c28d1f80fbc8a48a5cef
https://doi.org/10.1002/nav.3800270207
https://doi.org/10.1002/nav.3800270207