@inproceedings{2428,
  abstract     = {{ In this paper we present instance-specific accelerators for minimum-cost covering problems. We first define the covering problem and discuss a branch&bound algorithm to solve it. Then we describe an instance-specific hardware architecture that implements branch&bound in 3-valued logic and uses reduction techniques usually found in software solvers. Results for small unate covering problems reveal significant raw speedups. }},
  author       = {{Plessl, Christian and Platzner, Marco}},
  booktitle    = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}},
  keywords     = {{minimum covering, accelerator, funding-sundance}},
  pages        = {{85--91}},
  publisher    = {{CSREA Press}},
  title        = {{{Instance-Specific Accelerators for Minimum Covering}}},
  year         = {{2001}},
}