Sciweavers

4903 search results - page 4 / 981
» The Set Covering Machine
Sort
View
COR
2006
122views more  COR 2006»
13 years 7 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...
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 2 months ago
From Machine Learning to Machine Reasoning
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
Léon Bottou
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 7 months ago
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
Sören Laue
GLVLSI
1999
IEEE
85views VLSI» more  GLVLSI 1999»
13 years 12 months ago
On Applying Set Covering Models to Test Set Compaction
Paulo F. Flores, Horácio C. Neto, Joã...
IPL
2008
135views more  IPL 2008»
13 years 7 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen