Non-systematic weighted satisfiability in discrete hopfield neural network using binary artificial bee colony optimization

SS Muhammad Sidik, NE Zamri… - Mathematics, 2022 - mdpi.com
Recently, new variants of non-systematic satisfiability logic were proposed to govern
Discrete Hopfield Neural Network. This new variant of satisfiability logical rule will provide …

Quantum hybrid algorithm for solving sat problem

CM Varmantchaonala, JLKE Fendji, JPT Njafa… - … Applications of Artificial …, 2023 - Elsevier
Combinatorial problems usually have a large search space, and almost all classical
algorithms for solving this class of problems are inefficient for real-life input sizes. Quantum …

Efficient qubo transformation for higher degree pseudo boolean functions

A Verma, M Lewis, G Kochenberger - arXiv preprint arXiv:2107.11695, 2021 - arxiv.org
Quadratic Unconstrained Binary Optimization (QUBO) is recognized as a unifying framework
for modeling a wide range of problems. Problems can be solved with commercial solvers …

A Novelty Decision-Making Based on Hybrid Indexing, Clustering, and Classification Methodologies: An Application to Map the Relevant Experts Against the Rural …

M Faisal, TK Abd Rahman, I Mulyadi… - … in Management and …, 2024 - dmame-journal.org
Goals (SDGs) within intricate rural contexts holds paramount significance. Sustainable rural
development holds profound significance for both developed and developing nations. This …

[PDF][PDF] Determining rural development priorities using a hybrid clustering approach: a case study of South Sulawesi, Indonesia

M Faisal, TKA Rahman - International Journal of Advanced …, 2023 - researchgate.net
This study aims to develop village clustering techniques that facilitate the government's
placement of experts in villages identified as development priorities. The clustering process …

Small Ramsey numbers for books, wheels, and generalizations

B Lidický, G McKinley, F Pfender - arXiv preprint arXiv:2407.07285, 2024 - arxiv.org
This brief note gives several new upper and lower bounds on Ramsey numbers for books
and wheels, including tight lower bounds establishing the Ramsey numbers $ R (B_3, B_6) …

Dynamic Initial Weight Assignment for MaxSAT

A Ishtaiwi, Q Abu Al-Haija - Algorithms, 2021 - mdpi.com
The Maximum Satisfiability (Maximum Satisfiability (MaxSAT)) approach is the choice, and
perhaps the only one, to deal with most real-world problems as most of them are …