Results 31 to 40 of about 2,095,948 (338)
IEEE Access, 2023 The radial basis function (RBF) neural network is a type of universal approximator, and has been widely used in various fields. Improving the training speed and compactness of RBF networks are critical for promoting their applications.
Lifei Sun +6 more
doaj +1 more source
Climbing the density functional ladder: nonempirical meta-generalized gradient approximation designed for molecules and solids. [PDF]
Physical Review Letters, 2003 The electron density, its gradient, and the Kohn-Sham orbital kinetic energy density are the local ingredients of a meta-generalized gradient approximation (meta-GGA).
Jian-Min Tao +3 more
semanticscholar +1 more source
Information and Computation, 2010 The paper is the full version of the authors' conference paper [Lect. Notes Comput. Sci. 6506, 25--36 (2010; Zbl 1310.68264)]. In the paper, the authors propose an algorithm to determine the approximate period of a string using Hamming and swap distances.
Amihood Amir +2 more
openaire +4 more sources
On approximately monotone and approximately Hölder functions [PDF]
Periodica Mathematica Hungarica, 2020 AbstractA real valued functionfdefined on a real open intervalIis called$$\Phi $$Φ-monotone if, for all$$x,y\in I$$x,y∈Iwith$$x\le y$$x≤yit satisfies$$\begin{aligned} f(x)\le f(y)+\Phi (y-x), \end{aligned}$$f(x)≤f(y)+Φ(y-x),where$$ \Phi :[0,\ell (I) [ \rightarrow \mathbb {R}_+$$Φ:[0,ℓ(I)[→R+is a given nonnegative error function, where$$\ell (I)$$ℓ(I ...
Angshuman R. Goswami, Zsolt Páles
openaire +3 more sources
Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth [PDF]
, 2003 In this paper we present two novel generic schemes for approximation algorithms for optimization to partial k-trees. Our first scheme yields deterministic polynomialtime algorithms achieving typically an approximation factor of k/ log n, where k
Chlebikova, Janka +14 more
core +1 more source
Engineering Transactions, 2019 The article presents and experimentally confirms two approaches to the problem of determining the working area of parallel robots using the example of a planar robot DexTAR with two degrees of freedom.
Dmitry MALYSHEV +3 more
doaj +1 more source
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011 This article considers the problem of computing a minimum weight cycle in weighted undirected graphs. Given a weighted undirected graph G = ( V , E , w ), let C be a minimum weight cycle of G , let
Liam Roditty, Roei Tov
openaire +2 more sources
APPROXIMATION MODELS THE FORMATION PRESSURE ACCORDING TO GAS-DYNAMICS SURVEYS OF WELLS
Вестник Северо-Кавказского федерального университета, 2022 A convenient practical method for approximating of the formation pressure at an arbitrary point inside the reservoir is offered. The method uses measurements in neighboring wells which, unlike the classical methods of Lagrange and Newton, does not ...
Vladimir A. Tolpaev, Roman A. Ryskalenko
doaj
Rational approximation of discrete data with asymptomatic behaviour [PDF]
This thesis is concerned with the least-squares approximation of discrete data that appear to exhibit asymptotic behaviour. In particular, we consider using rational functions as they are able to display a number of types of asymptotic behaviour.
Cooper, Philip
core +4 more sources
On renormalization of the approximate solution of the orbital coordinate system equations of orientation [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. ИнформатикаIn the quaternion formulation, the problem of mathematical modeling of the spacecraft motion in an elliptical orbit is considered. The control is a modulo-limited acceleration vector from the jet thrust, directed orthogonally to the plane of the ...
Pankratov, Ilia Alekseevich
doaj +1 more source