|
Degree
|
Graduate Student of National Research University of Electronic Technology
|
|
E-mail
|
gaminot@gmail.com
|
|
Location
|
Moscow
|
|
Articles
|
The paper is devoted to analysis of algorithm to create functional approximation for the target Lipschitz-bounded surjective function via a composition of functions from a given set. The direct search algorithm is introduced at first, then the possibilities of optimization are discussed. After that an optimized algorithm is built. Obtained algorithms are compared on the problem of approximating Mesh network node degree distribution.
Read more...
|
