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...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|