Results 41 to 50 of about 850,072 (303)
Convex model predictive control for collision avoidance
This manuscript proposes a model predictive control for collision avoidance for the regulation problem of deterministic linear systems, which provides a priori guarantees of strong system theoretic properties, such as positive invariance and asymptotic ...
Saša V. Raković +4 more
doaj +1 more source
Cylindrical Algebraic Sub-Decompositions [PDF]
Cylindrical algebraic decompositions (CADs) are a key tool in real algebraic geometry, used primarily for eliminating quantifiers over the reals and studying semi-algebraic sets.
Bradford, R. J. +3 more
core +4 more sources
The multiple-attribute decision-making (MADM) problem is resolved through the q-rung complex diophantine neutrosophic normal set (q-rung CDNNS). An important way to express uncertain information is using q-rung orthopair fuzzy sets (q-ROFs).
Murugan Palanikumar +4 more
doaj +1 more source
New MCDM Algorithms with Linear Diophantine Fuzzy Soft TOPSIS, VIKOR and Aggregation Operators
In this paper, we focus on several ideas associated with linear Diophantine fuzzy soft sets (LDFSSs) along with its algebraic structure. We provide operations on LDFSSs and their specific features, elaborating them with real-world examples and ...
Ibtesam Alshammari +4 more
doaj +1 more source
Fixed points of the EM algorithm and nonnegative rank boundaries [PDF]
Mixtures of $r$ independent distributions for two discrete random variables can be represented by matrices of nonnegative rank $r$. Likelihood inference for the model of such joint distributions leads to problems in real algebraic geometry that are ...
Kubjas, Kaie +2 more
core +3 more sources
Using a new matrix analysis tool, called semi-tensor product of matrices (STP) developed in recent years, this paper investigates the problem of finding control sets (or dominating sets) of graphs mathematically.
Yongyi Yan +3 more
doaj +1 more source
Adapting Real Quantifier Elimination Methods for Conflict Set Computation [PDF]
The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance.
A. Dolzmann +17 more
core +5 more sources
Novel methods for multiple attribute decision-making problems are presented in this paper using Type-Ⅱ Fermatean normal numbers. Type-Ⅱ Fermatean fuzzy sets are developed by further generalizing Fermatean fuzzy sets and neutrosophic sets.
Murugan Palanikumar +4 more
doaj +1 more source
Compactness criteria for real algebraic sets and Newton polyhedra [PDF]
Abstract Let f : ℝ n
Phu Phat Pham, Tien Son Pham
openaire +3 more sources
Algebraic Methods for Achieving Super-Resolution by Digital Antenna Arrays
The actual modern problem of developing and improving measurement and observation systems (including robotic ones) is to increase the volume and quality of the information received.
Boris A. Lagovsky, Evgeny Ya. Rubinovich
doaj +1 more source

