---
res:
  bibo_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. @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
  dct_date: 2001^xs_gYear
  dct_publisher: CSREA Press@
  dct_subject:
  - minimum covering
  - accelerator
  - funding-sundance
  dct_title: Instance-Specific Accelerators for Minimum Covering@
...