✦ LIBER ✦

A statistical analysis of an algorithm's complexity

✍ Scribed by S. Chakraborty; P.P. Choudhury

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 263 KB
Volume: 13
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(00)00043-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A mixed evolutionary-statistical analysi

A mixed evolutionary-statistical analysis of an algorithm's complexity

✍ C. Cotta; P. Moscato 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 372 KB

A combination of evolutionary algorithms and statistical techniques is used to analyze the worst-case computational complexity of two sorting algorithms. It is shown that excellent bounds for these algorithms can be obtained using this approach; this fact raises interesting prospects for applying th

A statistical measure of complexity

✍ R. López-Ruiz; H.L. Mancini; X. Calbet 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 504 KB

An algorithmic and complexity analysis o

An algorithmic and complexity analysis of interpolation search

✍ Gaston H. Gonnet; Lawrence D. Rogers; J. Alan George 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 558 KB

Statistical analysis of a portable paral

Statistical analysis of a portable parallel non-linear programming algorithm

✍ J. Lyu; A. Gunasekaran 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 539 KB

It is well known that the availability of cost-effective and powerful parallel computers has enhanced the ability of the operations research community to solve laborious computational problems. But many researchers argue that the lack of portability of parallel algorithms is a major drawback to util

A shape preserving representation with a

A shape preserving representation with an evaluation algorithm of linear complexity

✍ J. Delgado; J.M. Peña 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 108 KB

We consider a blending basis for which we obtain an algorithm for the evaluation of polynomial curves with linear time complexity and we prove that it is a normalized totally positive basis. Therefore, it simultaneously satisfies efficiency and shape preservation. We also provide the corner cutting

Average-case analysis of multiple Quicks

Average-case analysis of multiple Quickselect: An algorithm for finding order statistics

✍ Janice Lent; Hosam M. Mahmoud 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 596 KB