✦ LIBER ✦

A generalization of two code ordering optimizations

✍ Scribed by Christopher W. Fraser

Book ID: 113162530
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 246 KB
Volume: 16
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90026-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalization of boson normal orderin

A generalization of boson normal ordering

✍ Toufik Mansour; Matthias Schork; Simone Severini 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Code generation with a recursive optimiz

Code generation with a recursive optimizer

✍ Gordon Stevenson 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

Optimal Binary Coding of Ordered Numbers

✍ Steiglitz, K.; Bernstein, A. J. 📂 Article 📅 1965 🏛 Society for Industrial and Applied Mathematics ⚖ 248 KB

Random Generation of Optimal Codes

✍ LoNGUET-HIGGINS, H. C. 📂 Article 📅 1967 🏛 Nature Publishing Group 🌐 English ⚖ 302 KB

First-order optimality conditions for tw

First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization

✍ Li-Ping Pang; Ming-Zheng Wang; Zun-Quan Xia 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 310 KB

## a b s t r a c t We investigate two classes of generalized nonsmooth semi-infinite optimization problems in this paper, that is, the generalized convex semi-infinite optimization problem and the generalized Lipscitz semi-infinite optimization problem. Their first order necessary optimality condit

A generalization of the binary Preparata

A generalization of the binary Preparata code

✍ A.S. Kuzmin; V.T. Markov; A.A. Nechaev; A.S. Neljubin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 199 KB