𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stochastic analysis of the Merge–Sort algorithm

✍ Scribed by M. Cramer

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
212 KB
Volume
11
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Further results on almost sure convergen
Further results on almost sure convergence of the stochastic gradient algorithm
✍ Miloje S. Radenkovic 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

In this paper, we consider the rate of convergence of the parameter estimation error and the cost function for the stochastic gradient-type algorithm. The problem is solved in the case of the minimum-variance stochastic adaptive control. It is proven that the cost function has the rate of convergenc

The performance of a selection of sortin
The performance of a selection of sorting algorithms on a general purpose parallel computer
✍ DOWSING, R. D.; MARTINS, W. S. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 2 views

In the past few years, there has been considerable interest in general purpose computational models of parallel computation to enable independent development of hardware and software. The BSP and related models represent an important step in this direction, providing a simple view of a parallel mach

Fast Solvers for the White Noise Analysi
Fast Solvers for the White Noise Analysis of Stochastic Systems
✍ H.G. Matthies; A. Keese 📂 Article 📅 2002 🏛 John Wiley and Sons ⚖ 102 KB

We consider fast numerical methods for computing the response of stochastic systems. The stochastic discretization is performed via a Karhunen-Loéve and Wiener's polynomial chaos expansion. In truncating this expansion and using a Galerkin projection, a finite dimensional system of equations remains