A number of synthesis applications are made possible by automated tools for synthesis. Recent work has shown that SMT solvers, instead of just acting as subroutines for automated software synthesis tasks, can be instrumented to perform synthesis themselves. This paper focuses on some of the current challenges for developing fast and useful procedures in SMT solvers for the benefit of synthesis ...

Square-root is a function for which numerous numerical methods have been developed. In most math packages for microprocessors, simple iterative methods have been used, as no special demands for speed — nor even for accuracy in some cases are expected: e.g. in [ l ] and [2] the execution time of square-rooting is approx. 2-5 times longer than that of multiplication, and in [3] a quintuple error ...

Variational quantum algorithms are augmented by an additional subroutine that efficiently detects signatures of barren plateaus -- unfavorable parameter regions prevent optimization due to vanishing gradients.

VTMOP is a Fortran 2008 software package containing two modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. implements the algorithm of [ 32 ], which handles or more objectives, does not require any derivatives, and produces well-distributed points over Pareto front. The first module contains general framework problems by combining resp...

A constitutive model for isotropic, semi-crystalline polymers is proposed. The Eulerian in the sense that it independent of measures total deformation and plastic/inelastic deformations. It able to account such essential phenomena as strain-rate dependence, work hardening, stress relaxation, volumetric inelastic deformations, damage. was applied uniaxial tension tests performed on polyoxymethyl...

This paper analyses Rosca's ARL as a general framework for automatic subroutine discovery. We review and compare a number of heuristics for code selection, and experimentally test their e ectiveness in the ARL framework. We also propose and analyse a new heuristic, the Saliency, and two extensions to ARL: di usion of the new subroutines through mutation and the MaxFit technique to adaptively ch...

We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n logn) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Williamson. This improves the previous best algorithms in both performance guarantee and running time. A previous algorithm of Goemans and Kleinberg for the minimum latency problem requires an approximation algorithm for the ...