z-logo
open-access-imgOpen Access
Enhanced Hopfield Network for Pattern Satisfiability Optimization
Author(s) -
Mohd. Asyraf Mansor,
Mohd Shareduwan Mohd Kasihmuddin,
Saratha Sathasivam
Publication year - 2016
Publication title -
international journal of intelligent systems and applications
Language(s) - English
Resource type - Journals
eISSN - 2074-9058
pISSN - 2074-904X
DOI - 10.5815/ijisa.2016.11.04
Subject(s) - computer science , hopfield network , satisfiability , boolean satisfiability problem , artificial neural network , function (biology) , algorithm , artificial intelligence , evolutionary biology , biology
Highly-interconnected Hopfield network with Content Addressable Memory (CAM) are shown to be extremely effective in constraint optimizat ion problem. The emergent of the Hopfield network has producing a prolific amount of research. Recently, 3 Sat isfiability (3SAT) has becoming a tool to represent a variety combinatorial problems. Incorporated with 3-SAT, Hopfield neural network (HNN-3SAT) can be used to optimize pattern satisfiability (Pattern-SAT) prob lem. Hence, we proposed the HNN-3SAT with Hyperbolic Tangent activation function and the conventional McCulloch-Pitts function. The aim of this study is to investigate the accuracy of the pattern generated by our proposed algorithms. Microsoft Visual C++ 2013 is used as a platform for training, testing and validating our Pattern-SAT design. The detailed performance of HNN3SAT of our proposed algorithms in doing Pattern-SAT will be discussed based on global pattern-SAT and running time. The result obtained from the simulat ion demonstrate the effectiveness of HNN-3SAT in doing Pattern-SAT.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom