✦ LIBER ✦

A memory-economic frontwidth reduction algorithm

✍ Scribed by Peter P. Silvester; Hesham A. Auda; Geoffrey D. Stone

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 679 KB
Volume: 20
Category: Article
ISSN: 0029-5981
DOI: 10.1002/nme.1620200411

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for frontwidth reduction

✍ Heitor L. G. Pina 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 557 KB

A time—memory trade-off frontwidth reduc

A time—memory trade-off frontwidth reduction algorithm for finite element analysis

✍ J. P. Webb; A. Froncioni 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 649 KB

A fixed point algorithm with economic ap

A fixed point algorithm with economic applications

✍ Arvind Khilnani; Edison Tse 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 460 KB

A Distributed Memory Algorithm for Lexic

A Distributed Memory Algorithm for Lexicon Building

✍ David Hawking 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 206 KB

A parallel algorithm for preparing word frequency concordances over two specified sets of documents from a collection is presented. Good parallel efficiency is demonstrated on a 128-node distributed memory machine using sets whose combined size exceeds one gigabyte. It is demonstrated that efficienc

A Fine-Grained Parallel Memory Compactio

A Fine-Grained Parallel Memory Compaction Algorithm

✍ P. Weemeeuw; B. Demoen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 942 KB

Memory compaction is a technique for reclaiming cells containing garbage that are scattered over the memory space. More specifcally, the memory cells are rearranged, so that all usable cells appear in one compact mass at one end of the area, and the remaining space at the other end can be recycled b

Noisy sort, a memory-intensive sorting a

Noisy sort, a memory-intensive sorting algorithm

✍ Susumu Horiguchi; Williard L. Miranker 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 859 KB