𝔖 Bobbio Scriptorium
✦   LIBER   ✦

SIMD Machines and Cellular d-Graph Automata

✍ Scribed by Wu, A.Y.; Rosenfeld, A.

Book ID
114606462
Publisher
IEEE
Year
1981
Tongue
English
Weight
565 KB
Volume
C-30
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sequential and cellular graph automata
Sequential and cellular graph automata
✍ Angela Wu; Azriel Rosenfeld πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 786 KB
3D surface cellular automata and their a
3D surface cellular automata and their applications
✍ Gobron, StΓ©phane (author);Chiba, Norishige (author) πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons Ltd 🌐 English βš– 570 KB

## This paper describes the generation and rendering of three-dimensional (3D) surface cellular automata (CA). Our model's main advantage is that it gives direct texturing simulation based on the actual shape of any triangulated input object. We first introduce general CA concepts and summarize work

On the potential use of cellular automat
On the potential use of cellular automata machines for electromagnetic field solution
✍ Neil R. S. Simons; Michel Cuhaci; Nikhil Adnani; Greg E. Bridges πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 918 KB

In this paper, the potential use of cellular automata machines for electromagnetic field solution is investigated. Cellular automata are computational models that operate on a discrete spatial lattice, evolve in discrete time, and employ simple discrete variables. We specifically examine the lattice