Results 281 to 290 of about 144,876 (334)

An efficient solution to Hidden Markov Models on trees with coupled branches. [PDF]

IEEE Trans Signal Process
Vafa F, Hormoz S.
europepmc   +1 more source

Beyond the States: Developing a Discrete Event Simulation Model Using R. [PDF]

Pharmacoeconomics
Lin Z, Briggs A.
europepmc   +1 more source

Mass hepatitis C virus screening among persons in custody in Hong Kong: a modelling cost-effectiveness analysis based on a prospective cohort study. [PDF]

Lancet Reg Health West Pac
Dai Z, Wong KT, Chow E, Seto WK, Yuen MF, Li X, Mak LY.   +6 more
europepmc   +1 more source

Modelling ion channels with a view towards identifiability. [PDF]

Bull Math Biol
Siekmann I.
europepmc   +1 more source

Spatio-Temporal Modeling of Land-Use/Land-Cover Change and Land Surface Temperature Using SVM and CA-Markov in Dilla Town, Ethiopia. [PDF]

Glob Chall
Kebede TA, Gebremariam WH, Bogale HY, Reda TM, Jothimani M.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

∞-Generalized Fibonacci Sequences and Markov Chains

The Fibonacci Quarterly, 2000
The authors study the convergence of generalized Fibonacci sequences defined by the recursion \[ V_{n+1}= a_0V_n+ a_1V_{n-1}+\cdots+ a_{s-1}V_{n-s+1}, \] with non-negative coefficients \(a_0,\dots, a_{s-1}\), by first reducing to the case where \(\sum_i a_i=1\) and then using ideas from the theory of Markov chains.
Mouline, Mehdi, Rachidi, Mustapha
openaire   +2 more sources

Generating Markov-Chain Transitions Quickly: II

ORSA Journal on Computing, 1991
A predecessor to this paper gives a way to generate transitions in continuous-time Markov chains. It is fast when a “similarity” condition holds. Exploiting a balanced binary search tree, we reduce the computational complexity of that method. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 ...
Fox, Bennett L., Young, Andrew R.
openaire   +2 more sources

Generating General Levels using Markov Chains

2019 11th Computer Science and Electronic Engineering (CEEC), 2019
The use of machine learning techniques for content generation has recently emerged on the scene. Procedural Content Generation via Machine Learning is the generation of game content by models that have been trained on existing game content. The aim of this paper is to generate general video game levels using Markov chains.
Adeel Zafar, Ayesha Irfan, Muhammad Zeeshan Sabir   +2 more
openaire   +1 more source

Generalized Jarzynski’s equality in inhomogeneous Markov chains

Journal of Mathematical Physics, 2007
A rigorous mathematical theory of generalized Jarzynski’s equality in inhomogeneous Markov chains is given. Then, we explain its physical meaning and applications through several previous work including the original works of Jarzynski [Phys. Rev. Lett. 78, 2690 (1997); Phys. Rev. E 56, 5018 (1997); J. Stat. Phys. 96, 415 (1999); J. Stat. Phys.
Ge, Hao, Qian, Min
openaire   +2 more sources