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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/46703/ http://dx.doi.org/10.3233/IDA-2012-00559 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|