Sciweavers

2889 search results - page 228 / 578
» An empirical study of
Sort
View
COR
2006
122views more  COR 2006»
15 years 6 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
JAR
2000
90views more  JAR 2000»
15 years 6 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
ML
2007
ACM
153views Machine Learning» more  ML 2007»
15 years 6 months ago
Multi-Class Learning by Smoothed Boosting
AdaBoost.OC has been shown to be an effective method in boosting “weak” binary classifiers for multi-class learning. It employs the Error-Correcting Output Code (ECOC) method ...
Rong Jin, Jian Zhang 0003
CVPR
2011
IEEE
14 years 10 months ago
Multi-label Learning with Incomplete Class Assignments
We consider a special type of multi-label learning where class assignments of training examples are incomplete. As an example, an instance whose true class assignment is (c1, c2, ...
Serhat Bucak, Rong Jin, Anil Jain
ISSTA
2004
ACM
16 years 2 days ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...