Results 211 to 220 of about 23,325 (286)

Absolute Binding Free Energy Calculations between the SARS-CoV-2 Main Protease and 130 Drug Leads Using Implicit Ligand Theory. [PDF]

J Chem Inf Model
Nguyen HH, Xie B, Minh DDL.
europepmc   +1 more source

Quantum-Assisted Variational Monte Carlo. [PDF]

Precis Chem
Chang L, Li Z, Fang WH.
europepmc   +1 more source

Enhanced graph coevolution network for social network analysis using assimilation modified emotional algorithm. [PDF]

Sci Rep
Li HH, Chang PC, Liao YH.
europepmc   +1 more source

Way More than the Sum of Their Parts: From Statistical to Structural Mixtures. [PDF]

Entropy (Basel)
Crutchfield JP.
europepmc   +1 more source

<i>dandelionR</i>: Single-cell immune repertoire trajectory analysis in R. [PDF]

Comput Struct Biotechnol J
Yu J, Xu X, Borcherding N, Tuong ZK.
europepmc   +1 more source

Numerically Stable Methods for the Computation of Exit Rates in Markov Chains

Methodology and Computing in Applied Probability, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan A. Carrasco
semanticscholar   +3 more sources

Computational Methods for Markov Chains Occurring in Queueing Theory

Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen, 1987
An algorithmic method for computing the probability vector of finite irreducible Markov chains is developed. The block elimination scheme used is especially well suited for highly structured and/or sparse transition matrices. Special variants for block Hessenberg and tridiagonal matrices often occurring in queueing theory are derived.
Manfred Krämer
semanticscholar   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains

SIAM Journal on Algebraic Discrete Methods, 1987
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. Heyman
openaire   +2 more sources

Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains

SIAM Journal on Algebraic and Discrete Methods, 1984
We propose new methods which combine aggregation with point and block iterative techniques for computing the stationary probability vector of a finite ergodic Markov chain. These techniques are also compared numerically with several methods which have recently appeared in the literature for the class of nearly completely decomposable Markov chains.
Koury, J. R., McAllister, D. F., Stewart, W. J.   +2 more
exaly   +3 more sources

Computational Methods for Controlled Markov Chains

, 1992
The chapter presents many of the basic ideas which are in current use for the solution of the dynamic programming equations for the optimal control and value function for the approximating Markov chain models. We concentrate on methods for problems which are of interest over a potentially unbounded time interval.
Harold J. Kushner, Paul Dupuis
openalex   +2 more sources