--- res: bibo_abstract: - ' We present instance-specific custom computing machines for the set covering problem. Four accelerator architectures are developed that implement branch \& bound in 3-valued logic and many of the deduction techniques found in software solvers. We use set covering benchmarks from two-level logic minimization and Steiner triple systems to derive and discuss experimental results. The resulting raw speedups are in the order of four magnitudes on average. Finally, we propose a hybrid solver architecture that combines the raw speed of instance-specific reconfigurable hardware with flexible bounding schemes implemented in software. @eng' bibo_authorlist: - foaf_Person: foaf_givenName: Christian foaf_name: Plessl, Christian foaf_surname: Plessl foaf_workInfoHomepage: http://www.librecat.org/personId=16153 orcid: 0000-0001-5728-9982 - foaf_Person: foaf_givenName: Marco foaf_name: Platzner, Marco foaf_surname: Platzner foaf_workInfoHomepage: http://www.librecat.org/personId=398 bibo_doi: 10.1109/FPGA.2002.1106671 dct_date: 2002^xs_gYear dct_publisher: IEEE Computer Society@ dct_title: Custom Computing Machines for the Set Covering Problem@ ...