An adaptive aggregation/disaggregation algorithm for hierarchical Markovian models

Article Abstract:

A study was conducted to examine an analysis method for large continuous time Markov chains resulting from hierarchical frameworks specified as stochastic petri nets or queueing networks. The method combines iterative solution methods based on a compact representation of the generator matrix. Results indicated that the approach allows the memory and time efficient analysis of very large frameworks that cannot be evaluated using conventional means.

Analysis, Iterative methods (Mathematics), Iteration (Mathematics), Algorithms

---

Computational algorithms for modeling unreliable manufacturing systems based on Markovian property

Article Abstract:

It has been possible to develop an alternative method based on the concept of continuous time time-homogenous Markov processes for establishing steady-state probabilities of unreliable systems with finite capacity. It is shown that the algorithms are effective for measuring various performances when general equations or formula cannot be easily obtained.

---

Modelling curling as a Markov process

Article Abstract:

Research involving the modelling of curling as a Markov process is presented. It was found that teams usually seem to have an advantage of just over one point when starting the game with the hammer.

Curling

Similar abstracts:

• Abstracts: A new penalty function algorithm for convex quadratic programming. Effect of maintenance on the economic design of x-control chart
• Abstracts: Strategic production-distribution models: a critical review with emphasis on global supply chain models. A global supply chain model with transfer pricing and transportation cost allocation
• Abstracts: An expanding-core algorithm for the exact 0-1 knapsack problem. Budgeting with bounded multiple-choice constraints
• Abstracts: Americanising EU antitrust litigation. Preparing for the UK antitrust revolution. Prioritising antitrust due diligence
• Abstracts: Scheduling preemptive jobs with precedence constraints on parallel machines. Perfect, ideal and balanced matrices

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