Abstract
In the paper a greedy algorithm for construction of partial tests is considered. Bounds on minimal cardinality of partial reducts are obtained. Results of experiments with software implementation of the greedy algorithm are described. © Springer-Verlag Berlin Heidelberg 2005.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of SPIE - The International Society for Optical Engineering |
| Pages | 149-155 |
| Number of pages | 7 |
| State | Published - May 1 2006 |
| Externally published | Yes |