Results 1  10
of
405,202
Compositional Calculation of SteadyState Probabilities
"... We describe a method for converting the problem of computing steadystate probabilities of a continuoustime Markov chain into the problem of computing absorption probabilities for a related chain. ..."
Abstract
 Add to MetaCart
We describe a method for converting the problem of computing steadystate probabilities of a continuoustime Markov chain into the problem of computing absorption probabilities for a related chain.
Recursive Computation Of SteadyState Probabilities In Priority Queues
 Operations Research Letters
, 1990
"... We derive recursive formulas for computing the state probabilities in priority queueing systems (preemptive and nonpreemptive). The derivation is based only on the general structure of the generating function involved, and thus is simpler and more general than previous methods. We also discuss the ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
the applications of our method to other queueing systems. Keywords: Priority Queues, recursive computation, steadystate probabilities. ____________________________________ 1 Currently with IBM, Thomas J. Watson Research Center, Yorktown Heights, NY 10598, U.S.A.  2  1. INTRODUCTION Queueing models
Steadystate probabilities for attractors in probabilistic Boolean networks
, 2005
"... Boolean networks form a class of disordered dynamical systems that have been studied in physics owing to their relationships with disordered systems in statistical mechanics and in biology as models of genetic regulatory networks. Recently they have been generalized to probabilistic Boolean networks ..."
Abstract
 Add to MetaCart
of the model, the steadystate probabilities of the attractors are critical to networkunderstanding. Heretofore they have been found by simulation; in this paper we derive analytic expressions for these probabilities, first for Boolean
Calculation of steadystate probabilities of M/M queues: further approaches
 Journal of Applied Mathematics and Decision Sciences 6.1
, 2002
"... Abstract. This paper draws attention to the risk of rounding error in the numerical evaluation of steadystate probabilities for the M/M family of queues. A method for avoiding the risk is presented which is easy to program for calculation in practice. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. This paper draws attention to the risk of rounding error in the numerical evaluation of steadystate probabilities for the M/M family of queues. A method for avoiding the risk is presented which is easy to program for calculation in practice.
An approximation method for solving the steadystate probability distribution of probabilistic Boolean networks
, 2006
"... Motivation: Probabilistic Boolean networks (PBNs) have been proposed to model genetic regulatory interactions. The steadystate probability distribution of a PBN gives important information about the captured genetic network. The computation of the steadystate probability distribution usually inclu ..."
Abstract
 Add to MetaCart
Motivation: Probabilistic Boolean networks (PBNs) have been proposed to model genetic regulatory interactions. The steadystate probability distribution of a PBN gives important information about the captured genetic network. The computation of the steadystate probability distribution usually
STEADYSTATE PROBABILITIES FOR SOME QUEUEING SYSTEMS: I By
"... ABSTRACT: Two routing rules for a queuing system of two stations are considered as alternative models for modeling a queuing network. These routing rules allow customers to switch queues under certain server and other resource availability conditions, either external to the system upon arrival to th ..."
Abstract
 Add to MetaCart
to the network, or internal to the system after arrival to a primary queue. Under the assumption of Poisson arrivals and exponentially distributed service times, these systems are analyzed using matrixgeometric techniques, yielding a nontrivial set of ergodicity conditions and the steadystate joint
Steady State Probabilities of a Three Preemptive Single Server Queue
"... A three preemptive priority queuing system is considered where customers with three priorities joined a queue according to a Poisson process. A customer with higher priority needs to enter the service immediately upon arrival. The recursive formulas approach was extended to determine the steady stat ..."
Abstract
 Add to MetaCart
state probabilities of such a priority queuing system. Key words: Poisson process, recursive formulas based approach, steady state probabilities, three
TraceDriven SteadyState Probability Estimation in FSMs with Application to Power Estimation
, 1998
"... This paper illustrates, analytically and quantitatively, the effect of highorder temporal correlations on steadystate and transition probabilities in finite state machines (FSMs). As the main theoretical contribution, we extend the previous work done on steadystate probability calculation in FSMs ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
This paper illustrates, analytically and quantitatively, the effect of highorder temporal correlations on steadystate and transition probabilities in finite state machines (FSMs). As the main theoretical contribution, we extend the previous work done on steadystate probability calculation
TraceDriven SteadyState Probability Estimation in FSMs with Application to Power Estimation
, 1998
"... This paper illustrates, analytically and quantitatively, the effect of highorder temporal correlations on steadystate and transition probabilities in .finite state machines (FSMs). As the main theoretical contribution, we extend the previous work done on steadystate probability calculation in FSM ..."
Abstract
 Add to MetaCart
This paper illustrates, analytically and quantitatively, the effect of highorder temporal correlations on steadystate and transition probabilities in .finite state machines (FSMs). As the main theoretical contribution, we extend the previous work done on steadystate probability calculation
SteadyState Probability Estimation IN FSMs CONSIDERING HIGHORDER TEMPORAL EFFECTS
, 1997
"... This paper illustrates, analytically and quantitatively, the effect of highorder temporal correlations on steadystate and transition probabilities in Finite State Machines (FSMs). As the main theoretical contribution, we extend the previous work done on steadystate probability calculation in FSMs ..."
Abstract
 Add to MetaCart
This paper illustrates, analytically and quantitatively, the effect of highorder temporal correlations on steadystate and transition probabilities in Finite State Machines (FSMs). As the main theoretical contribution, we extend the previous work done on steadystate probability calculation
Results 1  10
of
405,202