✦ LIBER ✦

An efficient algorithm for optimum decomposition of recycle systems

✍ Scribed by Ravindra S. Upadhye; Edward A. Grens II

Publisher: American Institute of Chemical Engineers
Year: 1972
Tongue: English
Weight: 769 KB
Volume: 18
Category: Article
ISSN: 0001-1541
DOI: 10.1002/aic.690180312

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient gradient-based optimization

An efficient gradient-based optimization algorithm for mechanical systems

✍ Kegl, M. ;Butinar, B. J. ;Kegl, B. 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

An Algorithm for the Modular Decompositi

An Algorithm for the Modular Decomposition of Hypergraphs

✍ Paola Bonizzoni; Gianluca Della Vedova 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

We propose an O n algorithm to build the modular decomposition tree of hypergraphs of dimension three and show how this algorithm can be generalized to time the decomposition of hypergraphs of any fixed dimension k.

An efficient fixed-lag smoothing algorit

An efficient fixed-lag smoothing algorithm for discrete linear systems

✍ Gerald J. Bierman 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 446 KB

The modified Bryson-Frazier fixed interval smoothing algorithm [6], is an addendem to the Kalman filter• This algorithm when applied to the problem of fixedlag smoothing is computationally more efficient than the algorithms recently reported in refs. [1][2][3]. Features of the algorithm are ease of

A multilevel genetic algorithm for the o

A multilevel genetic algorithm for the optimum design of structural control systems

✍ Q. S. Li; D. K. Liu; A. Y. T. Leung; N. Zhang; Q. Z. Luo 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

An algorithm for the decomposition of gr

An algorithm for the decomposition of graphs into cliques

✍ Xiang-Ying Su 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 340 KB 👁 1 views

## Abstract Chung (F. R. K. Chung, On the decomposition of graphs, __SIAM J. Algebraic Discrete Methods__ 23 (1981), 1–12.) and independently Györi and Kostochka (E. Györi and A. V. Kostochka, On a problem of G. O. H. Katona and T. Tarján, __Acta Math. Acad. Sci. Hung.__ 34 (1979), 321–327.) proved

An Efficient Algorithm and Parallel Impl

An Efficient Algorithm and Parallel Implementations for Binary and Residue Number Systems

✍ C.N. Zhang; B. Shirazi; D.Y.Y. Yun 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 331 KB

Arithmetic units based on a Residue Number System (RNS) are fast and simple, and therefore attractive for use in digital signal processing and symbolic computation applications. However, RNS suffers from overheads of converting numbers to and from residue system. We present a new simple and uniform