Approximate program transformations such as skipping tasks [29, 30], loop perforation [21,
22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dynamic …

Approximate computing trades off accuracy of results for resources such as energy or
computing time. There is a large and rapidly growing literature on approximate computing …

Despite the fact that approximate computations have come to dominate many areas of
computer science, the field of program transformations has focused almost exclusively on …

Neutral landscapes and mutational robustness are believed to be important enablers of
evolvability in biology. We apply these concepts to software, defining mutational robustness …

The standard approach to program transformation involves the use of discrete logical
reasoning to prove that the transformation does not change the observable semantics of the …

Energy efficiency is a key concern in the design of modern computer systems. One
promising approach to energy-efficient computation, approximate computing, trades off …

Approximate computing has emerged as a new paradigm to reduce the resources (eg,
design area and power) required to realize digital systems at the expense of a negligible or …

We present QuickStep, a novel system for parallelizing sequential programs. Unlike
standard parallelizing compilers (which are designed to preserve the semantics of the …

This paper aims to take stock of recent advances in the field of energy-quality (EQ) scalable
circuits and systems, as promising direction to continue the historical exponential energy …

Abstract As Big Data processing often takes a long time and needs a lot of resources,
sampling and approximate computing techniques may be used to generate a desired …