Kibernetika ta kompiuterni tekhnologiyi最新文献

{"title":"Using of Artificial Intelligence Methods in Judicial Proceedings","authors":"Maksym Milev, Violeta Tretynyk","doi":"10.34229/2707-451x.23.3.7","DOIUrl":"https://doi.org/10.34229/2707-451x.23.3.7","url":null,"abstract":"Introduction. The judicial system in today's world is faced with a large number of cases that require efficient and fair resolution. Thanks to the development of information technologies, the automation of the process of conducting court cases and the introduction of intelligent systems have become urgent tasks for improving judicial justice. The justice sector has been slower than other sectors to adopt artificial intelligence and information technology (IT) in general. However, in most countries the amount of digital information resulting from the use of IT in legal proceedings is increasing. In this regard, the possibility of using artificial intelligence (AI) in the work of judicial bodies, prosecutor's offices and other specialized judicial bodies around the world is increasingly being investigated. Jurisprudence includes a wide range of problems and, accordingly, different sources of data for their solution. Using legislation, materials of criminal and administrative cases, concluded contracts and other legal documents, relevant specialists make decisions. In turn, artificial intelligence technologies, according to examples in other domains, can become assistants for specialists or make decisions in an autonomous mode.. The purpose of the article. To review the existing approaches to the application of artificial intelligence in the judicial system, to find out the shortcomings, advantages and limitations of machine learning algorithms in the judicial system. Determine the goals and methodology for further research. Results. In this work, the application of machine learning methods for solving problems arising in the field of jurisprudence is considered, algorithms, data sets and goals for further work are defined. Keywords: recurrent neural networks, machine learning, vectorization, text classification.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135296726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimal by the Order of Accuracy Cubature Formula for the Approximate Calculation of Triple Integrals from Fast Oscillating Functions in General View","authors":"Olesia Nechuiviter, Serhii Ivanov","doi":"10.34229/2707-451x.23.3.5","DOIUrl":"https://doi.org/10.34229/2707-451x.23.3.5","url":null,"abstract":"Introduction. The rapid development of digital technologies encourages scientists to create new or improve existing mathematical models of technical processes. It is time to develop mathematical models with different types of data. In the tasks of digital signal and image processing, the approximate calculation of integrals from rapidly oscillating functions using new information operators makes it possible to build cubature formulas using different types of information: the values of functions on planes, lines and points can be used as data. The purpose is to present and investigate the optimal cubature formula for the approximate calculation of the triple integral from rapidly oscillating functions in the general form on the class of differential functions. Information about functions are traces on systems of mutually perpendicular planes. Results. The study of the problems of digital signal and image processing continued using the example of numerical integration of triple integrals from rapidly oscillating functions in the general form. The values of functions on systems of mutually perpendicular planes are using for constructed cubature formula. The main attention in the research focuses on obtaining the estimations of errors. Proposed cubature formula for the approximate calculation of the triple integral from rapidly oscillating functions in general view is optimal in order of accuracy on the class of differential functions. The conducted numerical experiment confirmed the theoretical results. Conclusions. The obtained results make it possible to build new and improve existing mathematical models of processes with different types of input information. New information operators are a powerful tool in the development of such models. Cubature formulas for the approximate calculation of integrals from rapidly oscillating functions of many variables have been created. Іn the construction of the formulas traces of the function on planes, lines, and points are used. Formulas in their construction use function traces on planes, lines, and points. In this work, a cubature formula for the approximate calculation of the triple integral from a rapidly oscillating function in the general form, which is optimal in order of accuracy, is constructed and investigated on the class of differentiable functions. A feature of the proposed formula is the use of values of functions on systems of mutually perpendicular planes as data. Keywords: integrals of rapidly oscillating functions of many variables, cubature formulas, new information operators, digital signal and image processing.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135296723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Review and Analysis of the Development of Artificial Neural Networks","authors":"Oleksandr Bilokon","doi":"10.34229/2707-451x.23.3.6","DOIUrl":"https://doi.org/10.34229/2707-451x.23.3.6","url":null,"abstract":"Introduction. The creation of intelligent cyber-physical systems is impossible without knowledge of the analysis and process of development of scientific thought regarding artificial neural networks. The main task of this article is research and analysis of the concept of intelligent technologies based on artificial neural networks. Knowledge of the peculiarities of the creation, formation, and development of knowledge about artificial neural networks is of particular importance for scientists, developers, and design engineers. The article consists of the following parts: first, different approaches to the problem of building artificial functions of the brain are highlighted, the views of which are, in turn, divided into monotypic and genotypic models. The next part is the analysis of the development of artificial intelligence systems, some facts of the process of the development of the artificial intelligence system are also introduced and the peculiarities of scientific opinion on the issues of artificial neural networks are clarified. Various concepts and views are considered, with the help of which it is possible to reproduce the calculation process for a more detailed analysis and synthesis of algorithms of intelligent systems. In the part about the state of the theory, attention is focused on the fact that researchers who could not get accurate analytical answers add to the scientific toolkit methods of experimental modeling either on digital machines or on mechanical models. In addition, it is noted that the model is not the result of research, but only a starting point for analyzing its behavior. In the part of artificial neural networks, the author touches on the following concepts: the logic of McCulloch and Pitts calculations in neural networks, the problems of assigning confidence coefficients, the principle of self-organization, which were first illustrated with the help of computer simulations, the principle of competitive learning, the Kohonen Self-Organizing Maps, multilayer networks of direct propagation taking into account the radial basis functions, which became an alternative to the multilayer perceptron, the support vector machine. As conclusions and as a result, the author receives a complete picture of the genesis of intelligent systems and the technology of artificial neural networks. The processes of development of scientific thought give a clear understanding of the features of intellectual technologies built with the help of artificial neural networks, features of functioning and calculation. Keywords: artificial neural networks, perceptron, theories of McCulloch-Pitts, intelligent computer systems, cyber-physical agent, mobile robot, robotics.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135296728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Route Optimization in Mission Planning for Hybrid DRONE+VEHICLE Transport Systems","authors":"Leonid Hulianytskyi, Oleg Rybalchenko","doi":"10.34229/2707-451x.23.3.4","DOIUrl":"https://doi.org/10.34229/2707-451x.23.3.4","url":null,"abstract":"Introduction. In the context of modern technologies and the widespread use of unmanned aerial vehicles (UAVs) in various fields of activity, the study of optimizing their mission planning becomes increasingly relevant. This is particularly true for hybrid systems where UAVs are integrated with ground transportation (\"Drone+Vehicle\"). The article deals with the aspects of optimizing the mission routes of a drone that can be transported by a specialized vehicle, performing reconnaissance or maintenance missions for the presented targets. A mathematical model has been developed that allows integrating various planning stages, including determining the direction of the vehicle based on the data obtained during the drone's mission. The purpose of the paper is development and application of mathematical and software-algorithmic tools, in particular, based on the ideas of swarm intelligence, in planning operations for the inspection or maintenance of a given set of objects using hybrid systems \"Drone+Vehicle\". Results. A mathematical model of the problem of routing hybrid systems of the \"Drone+Vehicle\" type has been formed. Greedy type algorithms, deterministic local search and ant colony optimization (ACO) to solve the problem are proposed, implemented and analyzed. A computational experiment has been conducted to demonstrate the advantages of the AMC algorithm in terms of speed and efficiency, even for problems of high dimensionality. Conclusions. The proposed approach allows to cover several stages of planning the mission of a hybrid \"Drone+Vehicle\" system with an aggregated mathematical model. The developed mathematical model also covers the problem of choosing the direction of further movement of a vehicle located in a certain place, depending on the analysis of the results of the inspection of specified targets that may contain objects for inspection or maintenance. To solve the formulated combinatorial optimization problem, greedy type, deterministic local search, and OMC algorithms have been developed. The results of the computational experiment demonstrate the superiority of the OMC algorithm over the combined \"greedy + deterministic local search\" algorithm. An important future direction of research is the development and application of routing models and algorithms that take into account the obstacles present on the ground. The developed mathematical apparatus allows to move on to consider problems in which the locations of the vehicle's base on the route are not specified but are determined depending on the configuration of the targets. Keywords: unmanned aerial vehicles, hybrid systems, mission planning, route optimization, mathematcal modeling, ant colony optimization, logistics.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135296724","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On Shor's r-Algorithm for Problems with Constraints","authors":"Norkin, Vladimir, Kozyriev, Anton","doi":"10.34229/2707-451x.23.3.2","DOIUrl":"https://doi.org/10.34229/2707-451x.23.3.2","url":null,"abstract":"Shor's r-algorithm (Shor, Zhurbenko (1971), Shor (1979)) with space stretching in the direction of difference of two adjacent subgradients is a competitive method of nonsmooth optimization. However, the original r-algorithm is designed to minimize convex ravine functions without constraints. The standard technique for solving constraint problems with this algorithm is to use exact nonsmooth penalty functions (Eremin (1967), Zangwill (1967)). At the same time, it is necessary to choose the (sufficiently large) penalty coefficient in this method. In Norkin (2020, 2022) and Galvan et al. (2021), the so-called projective exact penalty function method is proposed, which does not formally require an exact definition of the penalty coefficient. In this paper, a nonsmooth optimization problem with convex constraints is first transformed into a constraintfree problem by the projective penalty function method, and then the r-algorithm is applied to solve the transformed problem. We present the results of testing this approach on problems with linear constraints using a program implemented in Matlab.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135297646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimization of a Mealy Automaton Circuit in a Mixed Element Basis","authors":"Alexander Barkalov, Larysa Titarenko, Oleksandr Golovin, Oleksandr Matvienko","doi":"10.34229/2707-451x.23.3.8","DOIUrl":"https://doi.org/10.34229/2707-451x.23.3.8","url":null,"abstract":"Introduction. The control device is one of the most important blocks of any digital system. The main function of the control device is to coordinate the interaction of the remaining units of the system. Therefore, the characteristics of the control device circuit have a significant impact on the quality of the overall system. To represent the law of functioning of the control device, the models of the microprogrammed automaton (MPA) by Moore and Mealy are used. When synthesizing MPA circuits, it is necessary to solve a number of optimization problems: reducing hardware costs, increasing performance, minimizing power consumption, and jointly optimizing hardware-time characteristics. Methods for solving these problems largely depend on the elemental basis used. Currently, one of the main bases in which modern digital systems are implemented is the FPGA. The main blocks in the FPGA are configurable logic blocks, a programmable interconnect matrix, a timing tree, and programmable inputs and outputs. To implement MPA schemes, two types of configurable logic blocks can be used: tabular logic elements (TLE) and built-in memory blocks (VBP), which have the property of reconfiguration. However, VBPs are widely used to implement various operating blocks of digital systems. Therefore, the controller circuit designer can use a limited number of such memory blocks. Purpose of the article. The article deals with the issues of MPA synthesis when there are a limited number of \"free\" blocks of EBP. In this case, the microprogram automaton circuit is represented by a network consisting of VBP and TLE blocks. A method for the synthesis of a microprogram automaton with optimization of the number of TLEs is proposed when only one VBP can be used in the microprogram automaton circuit. The proposed method is based on the use of a built-in memory block that performs the replacement of input variables and the coding of the automaton outputs. Results. Studies of the effectiveness of the proposed method were carried out on standard machines. FPGAs of the Virtex-7 family from Xilinx were used as the elemental basis. To implement the proposed MPA, the Vivado package was used. The results of the research showed that the use of the VBP block made it possible to reduce the number of SLE blocks by an average of 14 % – 18 % compared to schemes consisting only of SLE. For the Virtex-7 family FPGA, the number of TLE inputs Io= 6 was sufficient for a single-level implementation of the output system. Conclusions. The effectiveness of the proposed method makes it possible to recommend it for use in the synthesis of microprogram automata under conditions of an extremely limited number of BVPs. Keywords: Mealy automaton, synthesis, coding of inputs, coding of sets of outputs.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135296722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimized Packing of 3D Objects Bounded by Spherical and Conical Surfaces","authors":"Andrii Chuhai, Tetyana Romanova, Georgiy Yaskov, Mykola Gil, Sergiy Shekhotsov","doi":"10.34229/2707-451x.23.3.1","DOIUrl":"https://doi.org/10.34229/2707-451x.23.3.1","url":null,"abstract":"Introduction. Optimizing the packing of arbitrary geometric objects in additive manufacturing opens up new possibilities for increasing the efficiency of additive manufacturing of parts of a complex configuration due to the saving of energy, material and time resources. Additive manufacturing, a cornerstone in fields such as space engineering, medicine, mechanical engineering, and energy, has its efficiency hinging on the optimization of the 3D printing process. Given its widespread application, refining this process is of utmost importance. The purpose of the paper. The paper aims to develop an approach for packing assembled parts of complex geometry in the working area of a 3D printer, while adhering to the standards of 3D printing. Results. For the analytical description of the complex shaped industrial products, a, so called, “composed spherical cone” is used. This generates a family of such objects as spheres, cylinders, spherical cylinders, cones, truncated cones and spherical discs. Using the normalized quasi-phi-function of composed spherical cones, a mathematical model of the problem is presented in the form of a nonlinear programming problem. A solution strategy is developed, encompassing three primary stages: generation of feasible starting points, search of local minima and search of a better local minimum. Numerical examples of packing various industrial products in a 3D printer chamber is provided. 3D-parts are approximated by composed spherical cones with different metric parameters. Conclusions. The conducted numerical simulation confirms the effectiveness of the proposed optimization approach. This study emphasizes the importance of further research and innovation in the field of 3D printing and its optimization, and also demonstrates the potential of using mathematical models to solve practical problems in a production environment. Keywords: packing, assembled spherical cone, mathematical modeling, optimization, additive manufacturing.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135296725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Using the Ellipsoid Method to Study Relationships in Medical Data","authors":"Petro Stetsyuk, Mykola Budnyk, Ivan Sen’ko, Viktor Stovba, Illia Chaikovsky","doi":"10.34229/2707-451x.23.3.3","DOIUrl":"https://doi.org/10.34229/2707-451x.23.3.3","url":null,"abstract":"Deterioration of moral and psychological state on the background of a full–scale war is observed in many social groups. Timely detection of various types of pre–depressive states and appropriate therapy is a critically important task nowadays. In addition, an equally important task is to identify relationships between physical and psychological indicators of health. Establishing such regularities will allow detecting anxious states, avoiding direct profile testing of a patient. The article is devoted to construction of a mathematical apparatus for predicting psychological conclusions based on cardiological data. For this, a linear regression model and the ellipsoid method are used to determine its parameters with a criterion based on least moduli method (LMM), a feature selection procedure and a metric for assessing consistency of a data set. Material of the article is presented in 5 sections. Section 1 describes the ellipsoid method for finding parameters of linear regression with the least moduli method as a criterion in the power of p. Problem dimensions that can be successfully solved using the ellipsoid method on modern computers are indicated. The 2nd Section is devoted to Octave program emlmp, which implements the ellipsoid method, and the results of two computational experiments with its use. The obtained results demonstrate robustness of the obtained solutions when parameter p values are close to one. The 3rd Section describes mechanism of variable selection for the best prediction of psychological state of patients based on cardiological data. Variable selection was carried out using the Python Sequential Feature Selector procedure for predicting two psychological indicators – Beck's anxiety scale and psychologist's formalized conclusion. The 4th Section contains the results of a computational experiment using the emlmp program with LMM and least square method (LSM) criteria for predicting a psychologist’s formalized conclusion based on 84 selected patients and 22 parameters. Obtained solutions and forecasts for comparing criteria based on LMM and LSM are given. In the 5th Section, a metric for evaluation consistency of a data set is proposed, which allows to evaluate consistency for each parameter separately. A linear connection was found between 4 psychological parameters and the maximum accuracy of regression models with optimal number of parameters in specified models. Keywords: linear regression, convex function, ellipsoid method, least moduli method, data prediction, GNU Octave.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135296727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Mathematical Methods of Natural Language Processing in the System of Operative Determination of the Level of Tension in Society","authors":"Maksym Shchoholiev, O. Andriichuk","doi":"10.34229/2707-451x.23.2.6","DOIUrl":"https://doi.org/10.34229/2707-451x.23.2.6","url":null,"abstract":"Introduction. The most important factors causing an increase in the level of tension in society are crisis phenomena and information operations. Today, sociological surveys are considered the main way to determine the level of tension that arises in some group of people in connection with a certain event. However, this method does not allow obtaining detailed information about the dynamics of changes in tension associated with certain news events and the impact of these news events on the general level of tension in society, which complicates the decision-making process by government officials in crisis situations.\u0000The purpose of the work is to increase the situational awareness of representatives of state institutions regarding the current level of social tension provoked by crisis phenomena, news events or information operations. The information obtained will help government officials to make quick decisions to overcome these crisis phenomena and counter disinformation.\u0000The main task of the research is to develop the architecture and mathematical support of the system of operative determination of the level of tension in society based on data from social networks.\u0000Results. The architecture and mathematical support of the system of operative determination of the level of tension in society were developed. An example of the application of this system to determine the level of tension provoked by one news publication is demonstrated. The main advantages and disadvantages of the developed system, as well as directions for further research, are determined.\u0000Conclusions. The developed system of operative determination of the level of tension in society helps to quickly identify news events and news publications that have the greatest impact on increasing the level of social tension across the country at certain specific moments of time. The use of a system based on social networks makes it possible to build on the basis of current data such assessments, which can be used to study the dynamics of changes in social tension associated with a certain news event or news publication. Keywords: level of tension in society, social networks, sentiment analysis, TF-IDF, Word2vec, neural networks.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48433735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Application of the Global Equilibrium Search Method for Solving Boolean Programming Problems","authors":"I. Sergienko, V. Shylo, V. Roshchyn, P. Shylo","doi":"10.34229/2707-451x.23.2.2","DOIUrl":"https://doi.org/10.34229/2707-451x.23.2.2","url":null,"abstract":"Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse levels and objectives is increasing. Consequently, the efficacy of discrete optimization methods deserves particular attention, as it drives the advancement of techniques capable of solving complex real-world problems. This paper introduces the Global Equilibrium Search (GES) method as a highly effective approach for solving Boolean programming problems, thus contributing to the field's progress and applicability.\u0000Purpose. We describe the successful application of the approximate probabilistic GES method for effectively solving various Boolean programming problems. \u0000Results. This paper explores the application of sequential GES algorithms for solving Boolean linear, Boolean quadratic programming, and other related problems with their specific characteristics. In our study, we conducted a comparative analysis to assess the effectiveness of GES algorithms by evaluating them against state-of-the-art approaches. Additionally, to parallelize the optimization process for discrete programming problems, we introduced algorithm unions, specifically portfolios, and teams. The efficiency of GES algorithm portfolios and teams is investigated by solving the maximum weighted graph cut problem, with subsequent comparisons to identify distinctions between them.\u0000Conclusions. Based on the accumulated experience of applying GES algorithms and their modifications to solve discrete optimization problems, this study establishes the GES method as the leading approximate approach for Boolean programming. The results demonstrate the GES algorithm unions experience a significant boost in the optimization process speed, whereas algorithm teams demonstrate higher efficiency. Keywords: global equilibrium search method, Boolean programming problems, experimental studies, algorithm efficiency, algorithm unions (portfolios and teams).","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41316872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}