✦ LIBER ✦

An efficient algorithm for parametric fault simulation of monolithic IC's

✍ Scribed by Strojwas, A.J.; Director, S.W.

Book ID: 119778654
Publisher: IEEE
Year: 1991
Tongue: English
Weight: 839 KB
Volume: 10
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.85741

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fault simulation of parametric bridging

Fault simulation of parametric bridging faults in CMOS IC's

✍ Dalpasso, M.; Favalli, M.; Olivo, P.; Ricco, B. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 854 KB

An efficient DC fault simulation algorit

An efficient DC fault simulation algorithm for nonlinear circuits

✍ Lin Hua; Ling Xieting; Pan Mingde 📂 Article 📅 1986 🏛 SP Science Press 🌐 English ⚖ 334 KB

An Efficient, Parametric Fixpoint Algori

An Efficient, Parametric Fixpoint Algorithm for Analysis of Java Bytecode

✍ Mario Méndez; Jorge Navas; Manuel V. Hermenegildo 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 361 KB

An Efficient Numerical Algorithm for Sim

An Efficient Numerical Algorithm for Simulation of MOS Capacitance

✍ Jaeger, R.C.; Gaensslen, F.H.; Diehl, S.E. 📂 Article 📅 1983 🏛 IEEE 🌐 English ⚖ 849 KB

An efficient algorithm for the brownian

An efficient algorithm for the brownian dynamics simulation of aggregation

✍ Francis Sullivan; Raymond D. Mountain 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 531 KB

Computer simulation techniques have proven to be quite useful for studying the structure of particulates produced by the process of growth through the aggregation of smaller particles. In this paper we introduce an efficient algorithm for use in the computer simulation of the kinetics of the growth

An Efficient Bottom-up Algorithm for Enu

An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees

✍ Nakashima, Kyoichi; Hattori, Yoshio 📂 Article 📅 1979 🏛 IEEE 🌐 English ⚖ 861 KB