Abstract Analog photonic solutions offer unique opportunities to address complex computational tasks with unprecedented performance in terms of energy dissipation and speeds, overcoming current limitations modern computing architectures based on electron flows digital approaches. The lack modularization lumped element reconfigurability photonics has prevented the transition an all-optical analo...

In recent years, many design automation methods have been developed to routinely create approximate implementations of circuits and programs that show excellent trade-offs between the quality output required resources. This paper deals with evolutionary approximation as one popular methods. The provides first survey algorithm (EA)-based approaches applied in context computing. reveals EAs are p...

The most widely accepted models of diagnostic reasoning are all phrased in terms of the logical consequence relations. In work in recent years, Schaerf and Cadoli have proposed e cient approximations of the classical consequence relation. The central idea of this paper is to parameterise the notion of diagnosis over di erent approximations of the consequence relation. This yields a number of di...

The efficiency–accuracy trade-off of approximate computing spans a diverse array of techniques at both the hardware and software levels. While this diversity is key to the success of approximation research, it also entails considerable complexity in developing and validating new approximation techniques. Researchers must relate their ideas to a vast body of work on approximate computing and inv...

We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error. The main ingredient is an exact factorization algorithm when the rows and columns of the factors are constrained to lie in a general polyhedron. This strictly...