Using Binary Decision Diagrams to Efficiently Represent Alpha-Beta Associative Memories
暂无分享,去创建一个
[1] Cornelio Yáñez-Márquez,et al. Memorias Asociativas Basadas en Relaciones de Orden y Operaciones Binarias , 2003, Computación y Sistemas.
[2] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[3] J J Hopfield,et al. Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.
[4] H. Andersen. An Introduction to Binary Decision Diagrams , 1997 .
[5] Juan Humberto Sossa Azuela,et al. Associative Gray Level Pattern Processing using Binary Decomposition and α β Memories , 2005, Neural Processing Letters.
[6] Rolf Drechsler,et al. Implementation of read-k-times BDDs on top of standard BDD packages , 2001, VLSI Design 2001. Fourteenth International Conference on VLSI Design.
[7] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[8] Peter Sussner,et al. Morphological associative memories , 1998, IEEE Trans. Neural Networks.
[9] Anand Srivastav,et al. Ordered binary decision diagrams and the Shannon effect , 2004, Discret. Appl. Math..
[10] Matthias Krause. BDD-Based Cryptanalysis of Keystream Generators , 2002, EUROCRYPT.
[11] Randal E. Bryant,et al. An efficient graph representation for arithmetic circuitverification , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[12] Randal E. Bryant,et al. Symbolic Simulation, Model Checking and Abstraction with Partially Ordered Boolean Functional Vectors , 2004, CAV.
[13] Alberto Flores Rueda,et al. Computación Y Sistemas , 2022 .