Kuznetsov K. Methods and algorithms of stochastic set partitioning problems solution

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0499U001946

Thesis Registration Form

0499U001946.pdf

Applicant for

Specialization

  • 01.05.01 - Теоретичні основи інформатики та кібернетики

25-06-1999

Specialized Academic Board

K 08.051.09

Essay

Methods for optimal partitionings construction. Developing of the new mathematical models and new solution methods for continuous stochastic set partitioning problems. The methods that based on reduction to stochastic programming problems, determinical and probabilitical teaching problems was elaborated. The new variant of structure setting in order risk minimization method was proposed. The methods of continuous set partitioning problems solution were drawn on. The area of application includes economics and

Read more

Similar theses

0421U102388

Nasirov Emil Mekhdiievych

Parallelization of non-negative huge sparse linguistic matrix and tensors factorization

0420U102355

Dudar Vyacheslav Vyacheslavovych

Training algorithms and invariance to geometric transformations of neural networks

0520U101700

Prytomanova Olga M.

Fuzzy problems of optimal set partitioning: theoretical bases, methods and algorithms for solving

0520U100242

Zavadskyi Ihor O.

Splittable codes and their applications

0520U100209

Rystsov Ihor

Application of algebraic automata theory to analysis of discrete dynamical systems.