greedy algorithms

Convergent and Hyperconvergent Computing Systems

Authors: Solovyev V. M.

In the work the questions of construction of hyperconvergent computer systems and their functioning on the basis of a program-configurable network are considered. The features of the OpenFlow protocol and technological solutions that transfer control of the software-configurable network to a dedicated controller (server) are presented. A graph model of resource management of a hyperconvergent computer system is proposed that meets the requirements of a given quality of service on the one hand and economic requirements on the other.

On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression

Authors: Gudkov A. A., Mironov S. V., Faizliev A. R.

The paper presents greedy algorithms that use the Frank-Woolf-type approach for finding a sparse monotonic regression. The problem of finding monotonic regression arises in smoothing an empirical data, in problems of dynamic programming, mathematical statistics and in many other applied problems. The problem is to find a non-decreasing sequence of points with the lowest error of approximation to the given set of points on the plane.