Result 1 to 20 of 35 total
Generalization bounds of ERM algorithm with $V$-geometrically ergodic Markov chains. (English)
Adv. Comput. Math. 36, No. 1, 99-114 (2012).
1
Convergence of adaptive and interacting Markov chain Monte Carlo algorithms. (English)
Ann. Stat. 39, No. 6, 3262-3289 (2011).
2
Dynamic programming and inventory control. (English)
Studies in Probability, Optimization and Statistics 3. Amsterdam: IOS Press (ISBN 978-1-60750-769-7/hbk; 978-1-60750-770-3/ebook). vii, 369~p. EUR~135.00; \$~196.00 (2011).
3
The Perron-Frobenius theorem ‒ a proof with the use of Markov chains. (English)
J. Math. Sci., New York 157, No. 5, 675-680 (2009); translation from Zap. Nauchn. Semin. POMI 359, 5-16 (2008).
4
Nonlinearly perturbed stochastic processes. (English)
Theory Stoch. Process. 14, No. 3-4, 129-164 (2008).
5
Stochastic networks and queues. Translation from the French. (English)
Applications of Mathematics 52. Berlin: Springer (ISBN 3-540-00657-5/hbk; 978-3-642-05625-3/pbk). xix, 398~p. EUR~64.95/net; \$~79.95; \sterling~45.50; sFr~108.00 (2003).
6
Kemeny’s constant and the random surfer. (English)
Am. Math. Mon. 109, No.8, 741-745 (2002).
7
Entropy estimators and serial tests for ergodic chains. (English)
IEEE Trans. Inf. Theory 47, No.6, 2480-2489 (2001).
8
A geometric approach to ergodic non-homogeneous Markov chains. (English)
He, Tian-Xiao (ed.), Wavelet analysis and multiresolution methods. Proceedings of the conference, University of Illinois, Urbana-Champaign, IL, USA. New York, NY: Marcel Dekker. Lect. Notes Pure Appl. Math. 212, 341-366 (2000).
9
Average convergence rate of the first return time. (English)
Colloq. Math. 84-85, Pt. 1, 159-171 (2000).
10
Convergence of a random algorithm for function optimization. (English)
Numer. Funct. Anal. Optimization 20, No.9-10, 825-833 (1999).
11
An extension of Foster’s network theorem. (English)
Bollobás, Béla (ed.) et al., Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 541-547 (1997).
12
Theoretical probability for applications. (English)
Chichester: Wiley \& Sons. xviii, 894 p. \sterling 95.00 (1994).
13
Numerical methods for stochastic processes. (English)
Wiley Series in Probability and Mathematical Statistics. Applied Probability and Statistics. New York: Wiley. xvii, 359 p. \sterling 54.00 (1994).
14
An extension of Foster’s network theorem. (English)
Comb. Probab. Comput. 3, No.3, 421-427 (1994).
15
On a closed communication system with fast sources and operating in Markovian environments. (English)
J. Inf. Process. Cybern. 29, No.4, 241-246 (1993).
16
On the irreducibility of a Markov chain defined on a space of genotype configurations by a sampling scheme. (English)
Biometrics 49, No.1, 163-175 (1993).
17
The blocked stack algorithm of RMA in a network with a finite number of stations. (Russian)
Probl. Peredachi Inf. 28, No.1, 89-96 (1992).
18
An asymptotic approach to the multiple machine interference problem with Markovian environments. (English)
Publ. Math. 41, No.3-4, 325-339 (1992).
19
Blocked RMA stack algorithm for a network with a finite number of stations. (English)
Probl. Inf. Transm. 28, No.1, 79-86 (1992); translation from Probl. Peredachi Inf. 28, No.1, 89-96 (1992).
20
Result 1 to 20 of 35 total
Start
Contact
Print
General Help
