@unpublished{16853,
  abstract     = {{State-of-the-art frameworks for generating approximate circuits usually rely on information gained through circuit synthesis and/or verification to explore the search space and to find an optimal solution. Throughout the process, a large number of circuits may be subject to processing, leading to considerable runtimes. In this work, we propose a search which takes error bounds and pre-computed impact factors into account to reduce the number of invoked synthesis and verification processes. In our experimental results, we achieved speed-ups of up to 76x while area savings remain comparable to the reference search method, simulated annealing.}},
  author       = {{Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco}},
  booktitle    = {{Fourth Workshop on Approximate Computing (AxC 2019)}},
  keywords     = {{Approximate computing, parameter selection, search space exploration, verification, circuit synthesis}},
  pages        = {{2}},
  title        = {{{Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}}},
  year         = {{2019}},
}