994 search results - page 21 / 199 » Custom Computing Machines for the Set Covering Problem |
DSN
2007
IEEE
14 years 2 months ago
2007
IEEE
Testing is a difficult process that becomes more difficult with scaling. With smaller and faster devices, tolerance for errors shrinks and devices may act correctly under certain ...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
ICRA
2000
IEEE
14 years 3 days ago
2000
IEEE
We present an approach for automatically generating complete process plans, including xturing and CNC code, from high level shape feature part descriptions. The demonstration syst...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...