✦ LIBER ✦

On the worst-case ratio of a compound multiprocessor scheduling algorithm

✍ Scribed by Manfred Kunde; Horst Steppat

Book ID: 113163142
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 474 KB
Volume: 25
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90217-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case analysis of a scheduling algo

Worst-case analysis of a scheduling algorithm

✍ Jeremy Spinrad 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 150 KB

A note on worst-case analysis of approxi

A note on worst-case analysis of approximation algorithms for a scheduling problem

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 370 KB

A Note on "An On-Line Scheduling Heurist

A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"

✍ Chandrasekaran, R.; Chen, Bo; Galambos, Gábor; Narayanan, P. R.; Van Vliet, Andr 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 162 KB

A Short Note on an Advance in Estimating

A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm

✍ Paletta, Giuseppe; Vocaturo, Francesca 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 138 KB

On the Worst-Case Behavior of String-Sea

On the Worst-Case Behavior of String-Searching Algorithms

✍ Rivest, Ronald L. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 589 KB

On the worst-case divergence of the leas

On the worst-case divergence of the least-squares algorithm

✍ Hüseyin Akçay; Brett Ninness 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 371 KB

In this paper, we provide a ~-norm lower bound on the worst-case identification error of least-squares estimation when using FIR model structures. This bound increases as a logarithmic function of model complexity and is valid for a wide class of inputs characterized as being quasi-stationary with c