✦ LIBER ✦

An optimal polynomial for a covering radius problem

✍ Scribed by Jyrki Lahtonen

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 228 KB
Volume: 105
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90154-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for set covering problem

✍ J.E. Beasley 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 763 KB

An optimization principle applied to cer

An optimization principle applied to certain extremal problems for polynomials

✍ M.A Qazi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 444 KB

On upper bounds for code distance and co

On upper bounds for code distance and covering radius of designs in polynomial metric spaces

✍ G Fazekas; V.I Levenshtein 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Polynomial approximation technique for d

Polynomial approximation technique for dynamic optimization problems

✍ David F. Dianich; Jatinder N.D. Gupta 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 502 KB

Application of optimal polynomial contro

Application of optimal polynomial controller to a benchmark problem

✍ Agrawal, A. K.; Yang, J. N.; Wu, J. C. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

In this paper, we investigate the performance of optimal polynomial control for the vibration suppression of a benchmark problem; namely, the active tendon system. The optimal polynomial controller is a summation of polynomials of different orders, i.e., linear, cubic, quintic, etc., and the gain ma

An extremal problem for the spectral rad

An extremal problem for the spectral radius of a graph

✍ Miroslav Fiedler 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 519 KB