✦ LIBER ✦

Covering conditions and algorithms for the synthesis of speed-independent circuits

✍ Scribed by Beerel, P.A.; Myers, C.J.; Meng, T.H.

Book ID: 119778309
Publisher: IEEE
Year: 1998
Tongue: English
Weight: 450 KB
Volume: 17
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.700719

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Structural methods for the synthesis of

Structural methods for the synthesis of speed-independent circuits

✍ Pastor, E.; Cortadella, J.; Kondratyev, A.; Roig, O. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 744 KB

Synthesis of recognition and classificat

Synthesis of recognition and classification algorithms by the covering method

✍ I.V. Isaev 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 587 KB

Algorithms for the Count of Linearly Ind

Algorithms for the Count of Linearly Independent and Minimal Conjugated Circuits in Benzenoid Hydrocarbons

✍ Lin, C.; Fan, G. 📂 Article 📅 1999 🏛 American Chemical Society 🌐 English ⚖ 227 KB

Genetic algorithms for the automatic syn

Genetic algorithms for the automatic synthesis of equivalent lumped-element circuits

✍ Stefano Selleri 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

## Abstract The derivation of a lumped‐element equivalent circuit of a device is a fundamental topic in electronic and electromagnetic analysis. Here, a fully automatic genetic algorithm is devised and implemented to perform this task. The proposed method not only recovers the values of the lumped

ChemInform Abstract: Algorithms for the

ChemInform Abstract: Algorithms for the Count of Linearly Independent and Minimal Conjugated Circuits in Benzenoid Hydrocarbons.

✍ Cheng-de Lin; Gui-Qing Fan 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 25 KB 👁 2 views

Algorithms for Minimum Coloring, Maximum

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

✍ Gavril, Fănică 📂 Article 📅 1972 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 813 KB