994 search results - page 29 / 199 » Custom Computing Machines for the Set Covering Problem |
WADS
2007
Springer
14 years 1 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
FPGA
2007
ACM
14 years 1 months ago
2007
ACM
Shrinking time-to-market and high demand for productivity has driven traditional hardware designers to use design methodologies that start from high-level languages. However, meet...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
FCCM
1998
IEEE
14 years 5 hour ago
1998
IEEE
Custom Computing Machines (CCM's) have demonstrated significant performance advantages over general-purpose processors for certain classes of problems. However, problems can ...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...