Results 71 to 80 of about 421,634 (286)
Polynomial Time Approximation Schemes [PDF]
Let Π be an NP-hard optimization problem, and let A be an approximation algorithm for Π. For an instance I of Π, let A(I) denote the objective value when running A on I, and let OPT (I) denote the optimal objective value. The approximation ratio of A for the instance I is RA(I) = A(I)/OPT (I), thus, when Π is minimization (maximization) problem RA(I) ≥
Hadas Shachnai, Tami Tamir
openaire +1 more source
It is shown that laser ablation pretreatment under oxygen‐free conditions enables copper–aluminium bonding at significantly lower deformation degrees and improved properties compared to mechanical brushing. Laser ablation further increases interface contact area and induces favourable residual stress states and microstructural compatibility ...
Khemais Barienti +11 more
wiley +1 more source
The paper offers a new method for approximate solution of one type of singular integral equations for elasticity theory which have been studied by other authors.
V. P. Gribkova, S. M. Kozlov
doaj
Image Local Features Description Through Polynomial Approximation
This work introduces a novel local patch descriptor that remains invariant under varying conditions of orientation, viewpoint, scale, and illumination.
Fawad +6 more
doaj +1 more source
Maximum Scatter TSP in Doubling Metrics
We study the problem of finding a tour of $n$ points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly once, maximizing the length of the shortest edge in the tour. The problem is known as Maximum Scatter
Kozma, László, Mömke, Tobias
core +1 more source
Stabilization of L‐PBF Ni50.7Ti49.3 under low‐cycle loading was investigated. Recoverable strain after cycling was dependent on the amount of applied load. Recovery ratio was 53.4% and 35.1% at intermediate and high load, respectively. The maximum total strain reached 10.3% at a high load of 1200 MPa.
Ondřej Červinek +5 more
wiley +1 more source
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
We consider a revenue-maximizing seller with $n$ items facing a single buyer. We introduce the notion of symmetric menu complexity of a mechanism, which counts the number of distinct options the buyer may purchase, up to permutations of the items.
Kothari, Pravesh +4 more
core +1 more source
Additive Gaussian Process Regression for Predictive Design of High‐Performance, Printable Silicones
A chemistry‐aware design framework for tuning printable polydimethylsiloxane (PDMS) for vat photopolymerization (VPP) is developed using additive Gaussian process (GP) modeling. Polymer network mechanics informs variable groupings, feasible formulation constraints, and interaction variables.
Roxana Carbonell +3 more
wiley +1 more source
Surface Tension Measurement of Ti‐6Al‐4V by Falling Droplet Method in Oxygen‐Free Atmosphere
In this article, the temperature‐dependent surface tension of free falling, oscillating Ti‐6Al‐4V droplets is investigated in both argon and monosilane doped, oxygen‐free atmosphere. Droplet temperature and oscillation are captured with one single high‐speed camera, and the surface tension is calculated with Rayleigh's formula.
Johannes May +9 more
wiley +1 more source
A Levinson-Galerkin algorithm for regularized trigonometric approximation
Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$.
Strohmer, Thomas
core +3 more sources

