In several papers Awojobi has used an approximation technique to solve the problems of the forced oscillations of a body on an elastic stratum. The present paper compares his approximate solution for axially symmetric torsion with numerical results derived from an integral equation developed by ...
An 'Approximation Technique' in Computer Science refers to methods that trade small losses in the quality of results for significant gains in performance and efficiency. These techniques are used in applications where some variation in output is acceptable and degradation in output quality is tolerable...
One of those applications is the initialization of Radial Basis Functions (RBF) centers composing a Neural Network, designed to solve functional approximation problems. The Clustering for Function Approximation (CFA) algorithm was presented as a new clustering technique that provides better results than ...
These problems have origin in typical industrial production processes, where, to obtain a final product, partially ordered operations must be processed in workstations connected by a transportation equipment. Each version determines a different objective to be optimized: SALBP-1 focuses on minimizing t...
We use a Null Space algorithm approach to solve augmented systems produced by the mixed finite element approximation of saddle point problems. We compare the use of an orthogonal factorization technique for sparse matrices with the use o... GM M. Arioli - 《Jpier Org》 被引量: 0发表: 2014...
Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365–374, 1987. ? 17. D. B. Shmoys, E. Tardos, and K. I. Aardal. Approximation algorithms for facility location problems. In Proceedings of the 29th Annual ACM Symposium on Theory of ...
1.Capacitor self-calibration technique used in time-interleavedsuccessive approximationADC;时间交叉存取逐次逼近型ADC中的电容自校准技术(英文) 2.SDP withsuccessive approximationand its application in the operation of multireservoir system;逐次逼近随机动态规划及库群优化调度 ...
Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain discordance between two phylogenetic trees is a hard computational problem. Even for binary trees, exact solvers struggle to solve instances with reticu...
For the probabilistic coverage problem, the most popular technique is linear programming. Many combinatorial optimization problems can be transformed into integer linear programs. For all integer linear programming methods, the general approach to finding an approximation solution has two steps. In the ...
This technique for choosing points to minimize the interpolation error can be extended to a general closed interval [a, b] by choosing the change of variable (8.22)x¯n=12b−1xN+1,n+1*+a+b,x¯n∈ab, to transform the numbers xn = xN + 1,n + 1* in the interval [− 1,...