نتایج جستجو برای: continuous time markov chain
تعداد نتایج: 2344467 فیلتر نتایج به سال:
the probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. a discrete time markov chain with an absorbing state is established in a directed acyclic network. then, the probability of transition from the initial state to the absorbing state is computed. it is as...
This paper presents a three-level supply chain model which includes single supplier, several distribution centers and sets of retailers. For this purpose, by adopting the queuing approach, a mixed nonlinear integer programming model is formulated. The proposed model follows minimizing the total cost of the system by determining: 1) the number and location of distribution centers between candida...
In this paper we study the long term evolution of a continuous time Markov chain formed by two interacting birth-and-death processes and motivated by modelling interaction between populations. We show transience/recurrence of the Markov chain under fairly general assumptions on transition rates and describe in more detail its asymptotic behaviour in some transient cases. 1 The model and results...
Motivated by an original on-line page-ranking algorithm, starting from an arbitrary Markov chain (Cn) on a discrete state space S, a Markov chain (Cn, Mn) on the product space S, the cat and mouse Markov chain, is constructed. The first coordinate of this Markov chain behaves like the original Markov chain and the second component changes only when both coordinates are equal. The asymptotic pro...
Animal biologists commonly use continuous time Markov chain models to describe patterns of animal behaviour. In this paper we consider the use of these models for describing AFL football. In particular we test the assumptions for continuous time Markov chain models (CTMCs), with time, distance and speed values associated with each transition. Using a simple event categorisation it is found that...
markov chain anticipation for the online traveling salesman problem by simulated annealing algorithm
the arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. the policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. in on-line created tours arc costs are not available for decision makers. the on-line traversed nodes are f...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید