✦ LIBER ✦

An orthogonal systolic array for the algebraic path problem

✍ Scribed by Y. Robert; D. Trystram

Book ID: 105533135
Publisher: Springer Vienna
Year: 1987
Tongue: English
Weight: 489 KB
Volume: 39
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02309554

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spacetime-minimal systolic arrays for Ga

Spacetime-minimal systolic arrays for Gaussian elimination and the Algebraic path problem

✍ Abdelhamid Benaini; Yves Robert 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 748 KB

A block algorithm and optimal fixed-size

A block algorithm and optimal fixed-size systolic array processor for the algebraic path problem

✍ Núñez, Fernando J. ;Valero, Mateo 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 793 KB

An orthogonal systolic design for the as

An orthogonal systolic design for the assignment problem

✍ G.M Megson; D.J Evans 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 728 KB

A note on an orthogonal systolic design

A note on an orthogonal systolic design for the assignment problem

✍ S. Storøy; T. Sørevik 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 136 KB

In this paper we show, by providing a counterexample, that a heuristic used in [3] is wrong. We also propose an alternative solution, which in addition to being correct, also seems to offer better possibilities for parallelization.

A systolic array for the longest common

A systolic array for the longest common subsequence problem

✍ Yves Robert; Maurice Tchuente 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 474 KB

New systolic arrays for the longest comm

New systolic arrays for the longest common subsequence problem

✍ Yen-Chun Lin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 555 KB