✦ LIBER ✦

Asymptotic properties of some underdiagonal walks generation algorithms

✍ Scribed by G. Louchard

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 706 KB
Volume: 218
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00324-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The random generation of underdiagonal w

The random generation of underdiagonal walks

✍ E. Barcucci; R. Pinzani; R. Sprugnoli 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 626 KB

In this paper, we propose an algorithm for the random generation of underdiagonal walks. We consider the plane walks which are made up of different kinds of east, north-east and north steps and which start from the origin and remain under the main diagonal. The algorithm is very simple: it randomly

Exact and asymptotic properties of multi

Exact and asymptotic properties of multistate random walks

✍ Carlos B. Briozzo; Carlos E. Budde; Omar Osenda; Manuel O. Cáceres 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 680 KB

Asymptotic optimality of some multicrite

Asymptotic optimality of some multicriterion optimization algorithms

✍ N. M. Popov 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 531 KB

Asymptotic properties of set membership

Asymptotic properties of set membership identification algorithms

✍ Mitchell M. Livstone; Munther A. Dahleh 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Some properties of regularizing algorith

Some properties of regularizing algorithms

✍ A.B. Bakushinskii 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 253 KB

The asymptotic properties of a class of

The asymptotic properties of a class of recognition algorithms

✍ S.A. Yakovlev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 433 KB