994 search results - page 1 / 199 » Custom Computing Machines for the Set Covering Problem |
FCCM
2002
IEEE
13 years 10 months ago
2002
IEEE
COR
2006
13 years 5 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
HPCA
1998
IEEE
13 years 9 months ago
1998
IEEE
Over the past few years there has been increased interest in building custom computing machines (CCMs) as a way of achieving very high performance on specific problems. The advent...
ICML
2001
IEEE
14 years 5 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
ICONIP
2007
13 years 6 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...