The discoverability of the web
Proceedings of the 16th international conference on World Wide Web
The Set Connector Problem in Graphs
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Universal Attribute Reduction Problem
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
On Construction of Partial Association Rules
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
On partial covers, reducts and decision rules with weights
Transactions on rough sets VI
Approximating corridors and tours via restriction and relaxation techniques
ACM Transactions on Algorithms (TALG)
On partial covers, reducts and decision rules
Transactions on rough sets VIII
Greedy Algorithm with Weights for Decision Tree Construction
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Lower bounds on minimal weight of partial reducts and partial decision rules
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Covering analysis of the greedy algorithm for partial cover
Algorithms and Applications
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Hi-index | 0.00 |