4903 search results - page 46 / 981 » The Set Covering Machine |
96
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
98
Voted
FMCAD
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, a new heuristic-based approach is introduced to extract minimally unsatisfiable subformulas (in short, MUSes) of SAT instances. It is shown that it often outperforms...
123
Voted
CDES
2006
15 years 4 months ago
2006
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
138
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
130
Voted
ICML
2000
IEEE
16 years 3 months ago
2000
IEEE
This essay gives advice to authors of papers on machine learning, although much of it carries over to other computational disciplines. The issues covered include the material that...