MARC record from Internet Archive

LEADER: 01809cam 2200421Ia 4500
001 ocm83099182
003 OCoLC
005 20090414143819.0
008 820712s1982 caua b f000 0 eng d
040 $aCMontNP$cAD#$dOCLCG$dAD#
037 $aADA115128
086 0 $aD 208.14/2:NPS-55-82-015
088 $aNPS-55-82-015
049 $aAD#A
100 1 $aLatouche, G.
245 10 $aFinite Markov chain models skip-free in one direction /$cby G. Latouche, D.P. Gaver, P.A. Jacobs.
260 $aMonterey, California :$bNaval Postgraduate School,$c1982.
300 $a1 v. (various pagings) :$bill. ;$c28 cm.
500 $a"NPS-55-82-015"--Cover.
500 $aCover title.
500 $a"April 1982"--Cover.
500 $a"Prepared for: Office of Naval Research, Arlington, VA 22217."
504 $aIncludes bibliographical references (p. 36-37).
506 $a"Approved for public release; distribution is unlimited"--Cover.
513 $aTechnical report; 1982.
520 $aFinite 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)
592 $ack/ 4/15/09.
650 0 $aMarkov processes.
650 0 $aProgramming (Mathematics)
650 0 $aAlgorithms$xMathematical models.
710 2 $aNaval Postgraduate School (U.S.)
700 1 $aGaver, Donald Paul.
700 1 $aJacobs, Patricia A.
700 1 $aLatouche, G.$q(Guy)
994 $aC0$bAD#
035 $a(CStRLIN)CDKG82-B1910
949 $lgen$nL$aQA273$b.L328$s1$tnorm$u00001$i32768000470504
926 $aNPS-LIB$bDIGIPROJ$cD 208.14/2:NPS-55-82-015$dTECH_RPT$eNEVER$f1