Abstract: This article mainly addresses the stabilization issue of discrete-time interval type-2 fuzzy (IT-2F) semi-Markov jump systems in the presence of denial-of-service attacks by means of ...
Abstract: Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptotic ...
Big O notation is a powerful tool used in computer science to describe the time complexity or space complexity of algorithms. Big-O is a way to express the upper bound of an algorithm’s time or space ...
Big O notation is a powerful tool used in computer science to describe the time complexity or space complexity of algorithms. Big-O is a way to express the upper bound of an algorithm’s time or space ...
Mathematics is the universal language of science while computer science is the study of the hardware and algorithms that are used in modern computer systems. Since many of the early pioneers of ...
Du, L. Xu and X. M. Yuan, The parameterized integral inequalities involving twice-differentiable generalized n -polynomial convexity under the framework of fractal domains and its applications, ...
A pseudo-spectral method based on Laguerre generalized polynomials was applied to numerically approximate the fractional wave equation by Sweilam et al. 34 Khader 35 solved the fractional-order delay ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback