|
|
|
|
|
Konstantin Gaipov, Daniil Tausnev, Sergey Khodenkov, Natalya Shepeta, Dmitry Malyshev, Aleksey Popov and Lev Kazakovtsev
Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies. With limited radio frequency resources, optimal routing problems arise, both at the network de...
ver más
|
|
|
|
|
|
|
|
|
|
|
Igor Masich, Natalya Rezova, Guzel Shkaberina, Sergei Mironov, Mariya Bartosh and Lev Kazakovtsev
A number of real-world problems of automatic grouping of objects or clustering require a reasonable solution and the possibility of interpreting the result. More specific is the problem of identifying homogeneous subgroups of objects. The number of group...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vladimir Krutikov, Elena Tovbis, Anatoly Bykov, Predrag Stanimirovic, Ekaterina Chernova and Lev Kazakovtsev
We investigate a solution of a convex programming problem with a strongly convex objective function based on the dual approach. A dual optimization problem has constraints on the positivity of variables. We study the methods and properties of transformat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vladimir Stanovov, Lev Kazakovtsev and Eugene Semenkin
Differential evolution (DE) is a popular and efficient heuristic numerical optimization algorithm that has found many applications in various fields. One of the main disadvantages of DE is its sensitivity to parameter values. In this study, we investigat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Guzel Shkaberina, Natalia Rezova, Elena Tovbis and Lev Kazakovtsev
Finding the cluster structure is essential for analyzing self-organized networking structures, such as social networks. In such problems, a wide variety of distance measures can be used. Common clustering methods often require the number of clusters to b...
ver más
|
|
|
|
|
|
|
|
|
|
|
Guzel Shkaberina, Leonid Verenev, Elena Tovbis, Natalia Rezova and Lev Kazakovtsev
Automatic grouping (clustering) involves dividing a set of objects into subsets (groups) so that the objects from one subset are more similar to each other than to the objects from other subsets according to some criterion. Kohonen neural networks are a ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vuka?in Stanojevic, Lev Kazakovtsev, Predrag S. Stanimirovic, Natalya Rezova and Guzel Shkaberina
In this work, we consider the problem of calculating the generalized Moore?Penrose inverse, which is essential in many applications of graph theory. We propose an algorithm for the massively parallel systems based on the recursive algorithm for the gener...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lev Kazakovtsev, Ivan Rozhnov and Guzel Shkaberina
The continuous p-median problem (CPMP) is one of the most popular and widely used models in location theory that minimizes the sum of distances from known demand points to the sought points called centers or medians. This NP-hard location problem is also...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lev Kazakovtsev, Ivan Rozhnov, Aleksey Popov and Elena Tovbis
The k-means problem is one of the most popular models in cluster analysis that minimizes the sum of the squared distances from clustered objects to the sought cluster centers (centroids). The simplicity of its algorithmic implementation encourages resear...
ver más
|
|
|
|
|
|