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: | , , , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
Penerbit Universiti Kebangsaan Malaysia
2020
|
| 在線閱讀: | http://journalarticle.ukm.my/15097/1/jqma-16-1-paper11.pdf http://journalarticle.ukm.my/15097/ http://www.ukm.my/jqma/current.html |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!