Flexibility of S-type random K satisfiability in hopfield neural network
- 1 January 2024
- conference paper
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3158 (1) , 030001
Abstract
Random K Satisfiability has overcome a lack of interpretation by introducing a flexible structure and generating various solutions which eventually reach global Random K Satisfiability has overcome a lack of interpretation by introducing a flexible structure and generating various solutions which eventually reach globalKeywords
This publication has 23 references indexed in Scilit:
- YRAN2SAT: A novel flexible random satisfiability logical rule in discrete hopfield neural networkAdvances in Engineering Software, 2022
- Intelligent computing system based on pattern recognition and data mining algorithmsSustainable Computing: Informatics and Systems, 2018
- Generalized Probabilistic SatisfiabilityElectronic Notes in Theoretical Computer Science, 2017
- Easy Cases of Probabilistic SatisfiabilityAnnals of Mathematics and Artificial Intelligence, 2001
- The logic of neural networksPhysics Letters A, 1993
- Sample Size for Estimating Multinomial ProportionsThe American Statistician, 1987
- Probabilistic logicArtificial Intelligence, 1986
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985
- Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences, 1982
- P.S. Laplace's work on probabilityArchive for History of Exact Sciences, 1976