Cargando…
Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits
Approximate circuits that trade the chip area or power consumption for the precision of the computation play a key role in development of energy-aware systems. Designing complex approximate circuits is, however, very difficult, especially, when a given approximation error has to be guaranteed. Evolu...
Autores principales: | Češka, Milan, Matyáš, Jiří, Mrazek, Vojtech, Vojnar, Tomáš |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326535/ http://dx.doi.org/10.1007/978-3-030-51825-7_33 |
Ejemplares similares
-
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
por: Berman, Paul R, et al.
Publicado: (2003) -
Solving network design problems via decomposition, aggregation and approximation
por: Bärmann, Andreas
Publicado: (2016) -
An evolutionary algorithm based on approximation method and related techniques for solving bilevel programming problems
por: Liu, Yuhui, et al.
Publicado: (2022) -
Algebraic iterative method to solve boundary problems of arbitrary electrostatic systems satisfying the Laplace equation
por: Shafranov, M D
Publicado: (1998) -
Approximate Dynamic Programming: Solving the Curses of Dimensionality
por: Powell, Warren B
Publicado: (2011)