{"abstract":[{"text":" 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. ","lang":"eng"}],"publisher":"IEEE Computer Society","author":[{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","full_name":"Plessl, Christian"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"year":"2002","status":"public","date_created":"2018-04-17T15:15:44Z","user_id":"24135","citation":{"ieee":"C. Plessl and M. Platzner, “Custom Computing Machines for the Set Covering Problem,” in <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>, 2002, pp. 163–172.","ama":"Plessl C, Platzner M. Custom Computing Machines for the Set Covering Problem. In: <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. IEEE Computer Society; 2002:163-172. doi:<a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">10.1109/FPGA.2002.1106671</a>","bibtex":"@inproceedings{Plessl_Platzner_2002, title={Custom Computing Machines for the Set Covering Problem}, DOI={<a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">10.1109/FPGA.2002.1106671</a>}, booktitle={Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)}, publisher={IEEE Computer Society}, author={Plessl, Christian and Platzner, Marco}, year={2002}, pages={163–172} }","mla":"Plessl, Christian, and Marco Platzner. “Custom Computing Machines for the Set Covering Problem.” <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>, IEEE Computer Society, 2002, pp. 163–72, doi:<a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">10.1109/FPGA.2002.1106671</a>.","chicago":"Plessl, Christian, and Marco Platzner. “Custom Computing Machines for the Set Covering Problem.” In <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>, 163–72. IEEE Computer Society, 2002. <a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">https://doi.org/10.1109/FPGA.2002.1106671</a>.","apa":"Plessl, C., &#38; Platzner, M. (2002). Custom Computing Machines for the Set Covering Problem. In <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i> (pp. 163–172). IEEE Computer Society. <a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">https://doi.org/10.1109/FPGA.2002.1106671</a>","short":"C. Plessl, M. Platzner, in: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM), IEEE Computer Society, 2002, pp. 163–172."},"_id":"2425","title":"Custom Computing Machines for the Set Covering Problem","department":[{"_id":"518"},{"_id":"78"}],"type":"conference","date_updated":"2022-01-06T06:56:13Z","publication":"Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)","page":"163-172","doi":"10.1109/FPGA.2002.1106671"}