Formation of trees of optimal subsets of random variables of various degrees of detalization
Andrei Mastislavovich Korneev, Tamara Lavrukhina, Tat'yana Andreevna Smetannikova, Faisal Abdo Ali Al-Saeedi · AIP conference proceedings · 2021
The paper describes numerical methods of search engine optimization of combinations of alphabets of random variables and the search for optimal modes of complex processes with the formation of optimal subsets trees. A method for solving discrete optimization problems using optimal subsets of random variables of various degrees of detail is considered. The combinations of alphabets are adjusted at the subsequent stages of the process, depending on the dynamics of its flow at the previous stages with the help of the optimal set tree of complex shape.