Results 201 to 210 of about 4,538 (226)
Some of the next articles are maybe not open access.
IEEE transactions on fuzzy systems, 2023
Fuzzy C-means (FCM) is a clustering algorithm based on partition of the universe. However, the partition generated by an equivalence relation is strict in practical application and exhibits relatively poor fault-tolerant mechanism.
Wentao Li +6 more
semanticscholar +1 more source
Fuzzy C-means (FCM) is a clustering algorithm based on partition of the universe. However, the partition generated by an equivalence relation is strict in practical application and exhibits relatively poor fault-tolerant mechanism.
Wentao Li +6 more
semanticscholar +1 more source
Fault-Tolerant Partition Resolvability in Chemical Graphs
Polycyclic aromatic compounds (Print), 2022Apart from many branches in mathematical sciences, the main share of applications of graph theory nowadays is in chemistry. The graph-theoretical ideas have been used by many chemists for more than two centuries but over the last 30 years, the great ...
Kamran Azhar +3 more
semanticscholar +1 more source
Fault-tolerant communication with partitioned dimension-order routers with complex faults
Proceedings 15th International Conference on Information Networking, 2002In this paper we propose a routing algorithm to handle complex faults in multicomputer networks with dimension-order routers. Simple changes to router structure and routing logic are proposed. Our technique can be applied to current implementations in which a router is partitioned into multiple modules. While assuming local knowledge of faults, the new
H.M.A. Fahmy, S.A. Ghoneim, A. Pacha
openaire +1 more source
Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
Discret. Math. Algorithms Appl., 2021The problem of characterizing the classes of plane graphs with the bounded metric dimension, edge metric dimension, and fault-tolerant metric dimension is of great interest nowadays. In this paper, we study the metric dimension, the fault-tolerant metric
S. Sharma, V. K. Bhat
semanticscholar +1 more source
On Metric Dimension and Fault Tolerant Metric Dimension of Some Chemical Structures
Polycyclic aromatic compounds (Print), 2021In chemistry, customary depiction for the structure of chemical compounds are graphs where the vertices and edges represents the atoms and bonds types, respectively.
M. Nadeem +2 more
semanticscholar +1 more source
Improving ARINC 653 System Reliability by Using Fault-Tolerant Partition Scheduling
2018 5th International Conference on Advanced Informatics: Concept Theory and Applications (ICAICTA), 2018The ARINC 653 specifies multiple operating system components to provide isolation between partitions. This means failure on one partition does not affect any other partition.
A. I. Kistijantoro, Aufar Gilbran
semanticscholar +1 more source
Fault-tolerant metric dimension of P(n, 2)ʘK 1 graph
, 2021An ordered set W of vertices in a graph G is said to resolve G if every vertex in G is uniquely determined by its vector of distances to the vertices in W.
Z. Ahmad +3 more
semanticscholar +1 more source
Research on Static Fault-tolerant Control Method of UUV Based on MPC in Two Dimension
Chinese Control and Decision Conference, 2020In this paper, the motion control of unmanned underwater vehicle (UUV) in two-dimensional state is studied, and a new control method, model prediction algorithm (MPC), is proposed.
Xuelian Ding, Da-qi Zhu
semanticscholar +1 more source
IEEE Transactions on Transportation Electrification
This article proposes a fault-tolerant control strategy suitable for the asymmetric six-phase permanent magnet synchronous motor (AS-PMSM) to improve its fault-tolerant performance and capability.
Haoyue Tang +5 more
semanticscholar +1 more source
This article proposes a fault-tolerant control strategy suitable for the asymmetric six-phase permanent magnet synchronous motor (AS-PMSM) to improve its fault-tolerant performance and capability.
Haoyue Tang +5 more
semanticscholar +1 more source
The Fault-Tolerant Metric Dimension of Cographs
International Symposium on Fundamentals of Computation Theory, 2019A vertex set $U \subseteq V$ of an undirected graph $G=(V,E)$ is a \textit{resolving set} for $G$ if for every two distinct vertices $u,v \in V$ there is a vertex $w \in U$ such that the distance between $u$ and $w$ and the distance between $v$ and $w ...
Duygu Vietz, Egon Wanke
semanticscholar +1 more source