Representation of binary trees on associative memories☆
References (4)
Multi-route access on cylinder memories
Proc. Sixth Ann. Princeton Conf. of Inform. Sciences and Systems
(1972)Rotating storage devices as partially associative memories
Proc. FJCC
(1972)
There are more references available in the full text version of this article.
Cited by (3)
FPGA acceleration of semantic tree reasoning algorithms
2015, Journal of Systems ArchitectureCitation Excerpt :Relationships between nodes are translated into table entries, qualified by the relationship type and the direction of such relation (i.e. A-node or B-node using Scone terminology). Fig. 5 graphically represents the method [25] that computes the parents or children of a given node, as explained below. In the RHC, the Semantic Tree CAM (STC) stores the flat representation as described above.
A reasoning hardware platform for real-time common-sense inference
2012, Sensors (Switzerland)The Architecture of Lisp Machines
1987, Computer
- ☆
Technical Report 72-14.
Copyright © 1973 Published by Elsevier B.V.