Show simple item record

dc.contributor.authorGaver, Donald Paul
dc.contributor.authorJacobs, Patricia A.
dc.contributor.authorLatouche, Guy
dc.date1982-04
dc.date.accessioned2013-03-07T21:52:49Z
dc.date.available2013-03-07T21:52:49Z
dc.date.issued1982-04
dc.identifier.urihttp://hdl.handle.net/10945/29875
dc.description.abstractFinite Markov processes are considered, with bi-dimensional state space, such that transitions from state (n,i) to state (m,j) are possible only if m or = n+l. The analysis leads to efficient computational algorithms, to determine the stationary probability distribution, and moments of first passage times. (Author)en_US
dc.description.sponsorshipprepared with the partial support of the Probability and Statistics Program of the Office of Naval Research, Arlington, VA.en_US
dc.description.urihttp://archive.org/details/finitemarkovchai00lato
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.subject.lcshUNITED STATES. NAVY--OFFICERS.MANPOWER POLICY--UNITED STATES. NAVY.MANPOWER PLANNING.en_US
dc.titleFinite Markov chain models skip-free in one directionen_US
dc.typeTechnical Reporten_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.description.funderN0001482WR20017en_US
dc.description.recognitionNAen_US
dc.identifier.oclcNA
dc.identifier.npsreportNPS55-82-015


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record