✦ LIBER ✦

Correction theory and algorithm for reachability matrix model

✍ Scribed by Satoshi Kase; Azuma Ohuchi; Ikuo Kaji

Book ID: 112079126
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 389 KB
Volume: 72
Category: Article
ISSN: 1042-0967
DOI: 10.1002/ecjc.4430720501

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for updating skeleton matri

An algorithm for updating skeleton matrix of a reachability matrix model

✍ Satoshi Kase; Azuma Ohuchi; Ikuo Kaji 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

A constructive algorithm for computing t

A constructive algorithm for computing the reachability matrix

✍ R. S. H. Mah 📂 Article 📅 1974 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 222 KB 👁 1 views

Gravitational corrections for supersymme

Gravitational corrections for supersymmetric gauge theories with flavors via matrix models

✍ Hiroyuki Fuji; Shun'ya Mizoguchi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 465 KB

An Arithmetic for Matrix Pencils: Theory

An Arithmetic for Matrix Pencils: Theory and New Algorithms

✍ Peter Benner; Ralph Byers 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 486 KB

Parallelism, Preprocessing, and Reachabi

Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs

✍ P.N. Klein 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 602 KB

The problem of reachability in a directed graph has resisted attempts at efficient parallelization. Only for fairly dense graphs can we efficiently achieve significant parallel speedups, using known methods. We describe a technique allowing significant parallel speedup even for moderately sparse gra

A sparse matrix model-based optical prox

A sparse matrix model-based optical proximity correction algorithm with model-based mapping between segments and control sites

✍ Bin Lin; Xiao-lang Yan; Zheng Shi; Yi-wei Yang 📂 Article 📅 2011 🏛 SP Zhejiang University Press 🌐 English ⚖ 886 KB