✦ LIBER ✦

Time complexity of gate assignment problem in one-dimensional array

✍ Scribed by Takashi Fujii; Tohru Kikuno; Noriyoshi Yoshidas; Hideya Horikawa

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Heuristic Algorithm for Gate Assignmen

✍ Fujii, T.; Horikawa, H.; Kikuno, T.; Yoshida, N. 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 856 KB

Time decay of excitations in the one-dim

✍ B. Movaghar; G. W. Sauer; D. Würtz 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 464 KB

Time decay of excitations in the one dim

✍ B. Movaghar; G.W. Sauer; D. Würtz; D.L. Huber 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Detecting Multiple Faults in One-Dimensi

✍ Xiaojun Ma; Jing Huang; Cecilia Metra; Fabrizio Lombardi 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 627 KB

Uniqueness in a One-Dimensional Problem

✍ G.V. Dyatlov 📂 Article 📅 2001 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 148 KB

New approach for the ordering of gate pe

✍ Lee, J.; Chou, J.-H.; Fu, S.-L. 📂 Article 📅 1995 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 569 KB