Iterative methods based on splitting for stochastic automata networks

Article Abstract:

Block versions of iterative methods follow directly from taking into account block of order nN, the order of the last automaton, in the given ranking. Bigger blocks may be taken into account by combining a number of automata at the end of the given ranking and ending recursive calls of the lower triangular backward solution algorithm when the initial automata in the classification is chanced upon.

Electronic computers, Electronic Computer Manufacturing, Utility Computer Systems, Research, Public utilities, Computer applications, Probabilistic automata

---

Lumpable continuous-time stochastic automata networks

Article Abstract:

Usage of aggregation with iterative disaggregation, to study occurrence of ordinary lumpability in stochastic automata networks like Markov processes, is described.

Statistical methods, Information networks

---

Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering

Article Abstract:

Numerical results on stochastic comparison method to improve Markov processes of componentwise bounding algorithm are presented.

Methods

Similar abstracts:

• Abstracts: Development and analysis of cost-based dispatching rules for job shop scheduling. An alternative framework to Lagrangian relaxation approach for job shop scheduling
• Abstracts: A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept
• Abstracts: The k-means range algorithm for personalized data clustering in e-commerce. Towards using computational methods for real-time negotiations in electronic commerce
• Abstracts: The bicriterion semi-obnoxious location (BSL) problem solved by an E-approximation. An improved heuristic for deciding on emergency transshipments
• Abstracts: Index policies for the maintenance of a collection of machines by a set of repairmen. A fully subjective approach to modelling inspection maintenance

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.