✦ LIBER ✦

A Minimization Technique for Tant Networks

✍ Scribed by Kyung Shik Koh

Book ID: 114587762
Publisher: IEEE
Year: 1971
Tongue: English
Weight: 529 KB
Volume: C-20
Category: Article
ISSN: 0018-9340
DOI: 10.1109/t-c.1971.223090

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on "A Minimization Technique fo

Comments on "A Minimization Technique for TANT Networks

✍ Lee, Hsiao P.; Davidson, Edward S. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 152 KB

An Algorithm for Minimal TANT Network Ge

An Algorithm for Minimal TANT Network Generation

✍ Lee, H.-P.S. 📂 Article 📅 1978 🏛 IEEE 🌐 English ⚖ 942 KB

A programming technique for generating m

A programming technique for generating minimal paths a general network

✍ Amjed M. Al-Ghanim; Neil R. Aukland 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 324 KB

A Minimization Technique for Multiple-Va

A Minimization Technique for Multiple-Valued Logic Systems

✍ Allen, C.M.; Givone, D.D. 📂 Article 📅 1968 🏛 IEEE 🌐 English ⚖ 535 KB

A heuristic technique for generating min

A heuristic technique for generating minimal path and cutsets of a general network

✍ Amjed M Al-Ghanim 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Reliability evaluation techniques employ a variety of tools for system modeling and calculation of reliability indices. Amongst the most popular tools are network-based algorithms founded on the concept of minimal paths and minimal cutsets. This paper presents a heuristic programming technique for d

A technique for the global minimization

A technique for the global minimization of a polynomial

✍ C. Sutti 📂 Article 📅 1976 🏛 Springer Milan 🌐 English ⚖ 239 KB