✦ LIBER ✦

Optimal algorithms for seeking the interval of greatest values for a class of functions

✍ Scribed by V.P. Tarasova

Publisher: Elsevier Science
Year: 1981
Weight: 605 KB
Volume: 21
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(81)90095-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal strategies for seeking the domai

Optimal strategies for seeking the domain of greatest values for a class of functions

✍ V.P. Tarasova 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 909 KB

An algorithm for seeking the maximum val

An algorithm for seeking the maximum value of univariate functions

✍ A.G. Korotchenko 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 797 KB

Approximately optimal algorithms for det

Approximately optimal algorithms for determining extrema in a certain class of functions

✍ A.G. Korotchenko 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 547 KB

Optimal passive algorithms for evaluatin

Optimal passive algorithms for evaluating the maximum of a function in an interval

✍ G.S. Ganshin 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 652 KB

Optimal strategies for seeking the globa

Optimal strategies for seeking the global maximum of a function

✍ N.F. Zaliznyak; A.A. Ligun 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 527 KB

Optimal Routing Algorithms for a Class o

Optimal Routing Algorithms for a Class of Cylindrical Banyan Multicomputers

✍ N.S. Woo; B. Naylor 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 538 KB

The cylindrical banyan network is a variation of the classical banyan network in two ways: (1) each node is a processor with a switch, and (2) every pair of nodes at the two ends is merged. We present a routing algorithm for the cylindrical banyan network, and show it is optimal in terms of the path