Markov processes, Bernoulli schemes, and Ising model
β Scribed by Francesco di Liberto; Giovanni Gallavotti; Lucio Russo
- Publisher
- Springer
- Year
- 1973
- Tongue
- English
- Weight
- 992 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0010-3616
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we present an approximation method to compute the reorder point s in an (R, s, Q) inventory model with a service level restriction. Demand is modelled as a compound Bernoulli process, i.e., with a fixed probability there is positive demand during a time unit; otherwise demand is zero.
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for solving them run in time polynomial in the size of the state space, where this size is extremely large for most real-world
It is shown that any discrete probability distribution with non-negative support can be represented as a generalized Poisson process with state-dependent rates. By looking at empirical estimates of these rate parameters from data, models can be built in terms of an appropriate functional form for th