Mutation Tabu Search Using Systematic Probabilistic Two Satisfiability In A Discrete Hopfield Neural Network

Chen, Ju (2025) Mutation Tabu Search Using Systematic Probabilistic Two Satisfiability In A Discrete Hopfield Neural Network. PhD thesis, Universiti Sains Malaysia.

[img] PDF
Download (917kB)

Abstract

Satisfiability logic has been extensively applied in artificial neural network research. However, existing studies have not developed effective strategies for controlling the distribution of literals in the formulations. Therefore, this thesis proposes a Probabilistic 2 Satisfiability model that controls the quantity and position of positive literals through a positive rule applied to variables in second-order clauses.

Item Type: Thesis (PhD)
Subjects: Q Science > QA Mathematics > QA1-939 Mathematics
Divisions: Pusat Pengajian Sains Matematik (School of Mathematical Sciences) > Thesis
Depositing User: Mr Aizat Asmawi Abdul Rahim
Date Deposited: 12 Jun 2026 07:43
Last Modified: 12 Jun 2026 07:43
URI: http://eprints.usm.my/id/eprint/64359

Actions (login required)

View Item View Item
USM Repository is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.
Share