In this paper we present a study on the problem of NP hardness and their applications in computer science. In addition, our study sheds light on the most important applications present in our daily life and how the problem of NP stiffness is an important primary focus in it. Moreover, the aim was to search for further modifications in order to obtain optimal methods for their adoption. Finally, the aim of this study is to seek to solve the decision problem of NP hardness to achieve the desired goals with the optimal result.
1 March 2021 in Journal of Physics: Conference Series
The aim of this paper is to clarify several important points, including a brief and adequate explanation of loving improvement, as well as laying out a number of important mathematical formulas that we need, supported with graphs.
This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually, This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually,
8 April 2022 in International journal of health sciences
The goal of this paper is to find a better method for integrating the optimization problem faster, and we did so by using a relaxation of the solution area, which is one of the methodologies in the correlation between the penalty method and the Augmented Lagrange method, and we also built default properties for combining these two methods.
30 June 2025 in Journal of Al-Qadisiyah for Computer Science and Mathematics
This research aims to develop computational models to improve resource allocation and increase the reliability of a ROSS (Relay-based Opportunistic Spectrum Sharing) network. The focus is on using two intelligent algorithms, the genetic algorithm (GA) and the particle swarm algorithm (PSO), to achieve efficient optimization. A mathematical model is constructed that determines relay locations and spectrum sharing methods to reduce the probability of failure and increase reliability. The algorithms are based on evaluating an objective function that takes into account spectrum efficiency, network delay, and connection reliability. The results show that using GA and PSO leads to significant performance improvements compared to traditional methods. The impact of the number of relays and secondary users on allocation efficiency is also analyzed. Combining the two algorithms contributes to accelerating the achievement of near-optimal solutions. Finally, the proposed model provides a general framework that can be applied to various types of dynamic spectrum networks.