Compact classification of optimized Boolean reasoning with particle swarm optimization
Conventional cut selection in Boolean reasoning (BR) based discretization often produces under-optimistic prime cuts. This is due to the linearity of traditional heuristics in tackling high-dimensional space problem. We proposed a flexible yet compact and holistic solution by incorporating Particle...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | 論文 |
| 出版事項: |
2012
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utm.my/id/eprint/46703/ http://dx.doi.org/10.3233/IDA-2012-00559 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|