Real number approximation by a rational number in the approximating k-ary algorithm was to find the fastest approximation
algorithm that enables to accelerate the convergence of the k -ary
One approach to constructing cutting algorithms with dropping of cutting planes calculate
iteration points by partially embeddimg the admissible set in approximating polyhedral sets. We
Numerical analysis of optimal control for system with nonuniform units iterative algorithm type are often used. However because of usually high dimensionality of real problems
ПАРАЛЛЕЛЬНЫЕ АЛГОРИТМЫ K-MEANS: ОПТИМИЗАЦИЯ КЛАСТЕРИЗАЦИИ similarities between them. This article examines modern approaches to cluster analysis, including
iterative A minimization algorithm with approximation of an epigraph of the objective function and a constraint set iteration points. Since these embedded sets are constructed as polyhedral sets in the
algorithm, then each
A class of combined iterative methods for solving variational inequalitiesA general approach to constructing
iterative methods that solve variational inequalities
Classical and quantum algorithms for constructing text from dictionary problemWe study
algorithms for solving a problem of constructing a text (a long string) from a dictionary
Asynchronous domain decomposition methods for continuous casting problem algorithms) to solve the finite difference schemes approximating dynamic continuous casting problem
Towards total coverage in autonomous exploration for UGV in 2.5D dense clutter environment Recent developments in 3D
reconstruction systems enable to capture an environment in great detail