Maximum 2-satisfiability in radial basis function neural network
Maximum k-Satisfiability (MAX-kSAT) is the logic to determine the maximum number of satisfied clauses. Correctly, this logic plays a prominent role in numerous applications as a combinatorial optimization logic. MAX2SAT is a case of MAX-kSAT and is written in Conjunctive Normal Form (CNF) with two v...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit Universiti Kebangsaan Malaysia
2020
|
| Online Access: | http://journalarticle.ukm.my/15097/1/jqma-16-1-paper11.pdf http://journalarticle.ukm.my/15097/ http://www.ukm.my/jqma/current.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Kebangsaan Malaysia |
| Language: | English |