<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Lozovanu, D.</creatorName>
<affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation>
</creator>
<creator>
<creatorName>Pickl, S.</creatorName>
<affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Algorithms for Determining the State-Time Probabilities and the Limit Matrix in Markov Chains</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2011</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1024-7696</relatedIdentifier>
<subjects>
<subject>Discrete Markov Process</subject>
<subject>Probability of State Transition</subject>
<subject>Limit State Matrix</subject>
<subject>dynamic programming</subject>
<subject>Polynomial Time Algorithm</subject>
</subjects>
<dates>
<date dateType='Issued'>2011-04-01</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>New calculation procedures for ¯nding the probabilities of state transitions of the system in Markov chains based on dynamic programming are developed and polynomial time algorithms for determining the limit state matrix in such pro-
cesses are proposed. Computational complexity aspects and possible applications of
the proposed algorithms for the stochastic optimization problems are characterized.</description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>