AECAM: An extension matrix algorithm on a cellular automata machine

DOI10.1007/BF02946171zbMath0755.65147OpenAlexW2002182113MaRDI QIDQ1192509

Vincenzo D'Andrea, Carl Uhrik, Yihe Wang, Jiarong Hong

Publication date: 27 September 1992

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02946171

zbMATH Keywords

machine learningintrinsic parallelismcellular automatic machineextension matrix algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• AE1: An extension matrix approximate method for the general covering problem
• Unnamed Item

This page was built for publication: AECAM: An extension matrix algorithm on a cellular automata machine