Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

138

Voted

FCCM
2002
IEEE

131views VLSI» more FCCM 2002»

Custom Computing Machines for the Set Covering Problem

15 years 10 months ago

Custom Computing Machines for the Set Covering Problem

Download homepages.uni-paderborn.de

Christian Plessl, Marco Platzner

Real-time Traffic

FCCM 2002 | VLSI |

claim paper

Related Content

» Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Pr...

» FPGA Based Custom Computing Machines for Irregular Problems

» Learning with the Set Covering Machine

» Using Generalization Error Bounds to Train the Set Covering Machine

» Fast distributed approximation algorithms for vertex cover and set cover in anonymous netw...

» The MinimumEntropy Set Cover Problem

» Set Covering Problems in RoleBased Access Control

» A Comparison Between ACO Algorithms for the Set Covering Problem

» Learning of personalized security settings

Post Info
More Details (n/a)

Added	14 Jul 2010
Updated	14 Jul 2010
Type	Conference
Year	2002
Where	FCCM
Authors	Christian Plessl, Marco Platzner

Comments (0)