✦ LIBER ✦

A parallel cost-optimal algorithm to compute the supremum of max-min powers

✍ Scribed by Francis Suraweera; Prabir Bhattacharya

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 467 KB
Volume: 18
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(92)90090-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm to compute the supremum of

An algorithm to compute the supremum of max-min powers and a property of fuzzy graphs

✍ Prabir Bhattacharya; Francis Suraweera 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 543 KB

An optimal algorithm to compute all the

An optimal algorithm to compute all the covers of a string

✍ Dennis Moore; W.F. Smyth 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 667 KB

A correction to “An optimal algorithm to

A correction to “An optimal algorithm to compute all the covers of a string”

✍ Dennis Moore; W.F. Smyth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 265 KB

An algorithm to find the number of paral

An algorithm to find the number of parallel stations for optimal cell scheduling

✍ Gursel A. Suer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 271 KB

Optimal algorithms to compute the closur

Optimal algorithms to compute the closure of a set of iso-rectangles

✍ Eljas Soisalon-Soininen; Derick Wood 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 852 KB

AN APPLICATION OF CHEBYSHEV'S MIN–MAX CR

AN APPLICATION OF CHEBYSHEV'S MIN–MAX CRITERION TO THE OPTIMAL DESIGN OF A DAMPED DYNAMIC VIBRATION ABSORBER

✍ E. Pennestrı&#x0300; 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 179 KB

In this paper an application of the Chebyshev's criterion to the optimal design of the damped dynamic vibration absorber is presented. The results are summarized in ready-to-use computational graphs. The reliability of the proposed method is demonstrated through a comparison of the numerical results