Results 71 to 80 of about 44,196 (310)
Structure of Polynomial-Time Approximation [PDF]
Approximation schemes are commonly classified as being either a polynomial-time approximation scheme (ptas) or a fully polynomial-time approximation scheme (fptas).
Leeuwen, Jan van +3 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
Approximation by weighted polynomials
The paper is devoted to the study of approximation by weighted polynomials. The author proves that if \(xQ'(x)\) is increasing on \((0,\infty)\) and \(w(x)= \exp(-Q(x))\) is the corresponding weight on \([0,\infty)\), then every continuous function that vanishes outside.
openaire +1 more source
We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source
Filtering Motion Data Through Piecewise Polynomial Approximation
In this work we propose a system to filter human movement data and store them into a compact representation. We are interested both in noise reduction and in segmentation. The method described in this paper relies on a iterative optimization and guarantee
Ruffaldi Emanuele +2 more
doaj +1 more source
Elevating Variational Quantum Semidefinite Programs for Polynomial Objectives [PDF]
Many practically important NP-hard optimization problems are inherently higher-order polynomial optimizations, which are typically addressed using approximation algorithms.
Iria W. Wang +5 more
doaj +1 more source
Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure
Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari +3 more
wiley +1 more source
On Approximate GCDs of Univariate Polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Narendra Karmarkar, Yagati N. Lakshman
openaire +1 more source
Local RBF approximation for scattered data fitting with bivariate splines [PDF]
In this paper we continue our earlier research [4] aimed at developing effcient methods of local approximation suitable for the first stage of a spline based two-stage scattered data fitting algorithm.
Oleg Davydov +5 more
core +1 more source

