Results 191 to 200 of about 4,538 (226)

The Intelligent Evolution of Radar Signal Deinterleaving: A Systematic Review from Foundational Algorithms to Cognitive AI Frontiers. [PDF]

Sensors (Basel)
Qu Z, Zhang J, Zhou Y, Ni L.
europepmc   +1 more source

Adaptive consensus optimization in blockchain using reinforcement learning and validation in adversarial environments. [PDF]

Front Artif Intell
Gutierrez R, Villegas-Ch W, Govea J.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On fault-tolerant partition dimension of graphs

Journal of Intelligent and Fuzzy Systems, 2021
Fault-tolerant resolving partition is natural extension of resolving partitions which have many applications in different areas of computer sciences for example sensor networking, intelligent systems, optimization and robot navigation. For a nontrivial connected graph G (V (G) , E (G)), the partition representation of vertex v with respect to an ...
Kamran Azhar, Sohail Zafar, Agha Kashif   +2 more
exaly   +3 more sources

Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension

Applied Mathematics and Computation, 2023
In network theory, distance parameters are crucial in analyzing structural aspects of the networks under investigation, including their symmetry, connectedness, and tendency to form clusters.
M Arulperumjothi, Sandi Klavžar, S Prabhu   +2 more
exaly   +2 more sources

Exploring the fault-tolerant metric dimension (FTMD) of the M-polynomial for zigzag edge coronoids fused with starphene

Modern physics letters B
Graph invariants are valuable tools for exploring the complex structures of molecular graphs, which have attracted significant interest from researchers across multiple disciplines.
Umar Farooq, Faryal Chaudhry, M. Babar, Wasim Abbas, T. Sulaiman, Mustafa Bayram   +5 more
semanticscholar   +2 more sources

Fault-tolerant metric dimension of circulant graphs C(1,2,3)

Theoretical Computer Science, 2020
For a connected graph G = ( V , E ) , an ordered set R = { r 1 , r 2 , … , r k } ⊂ V ( G ) is said to be a resolving set if c ( u | R ) ≠ c ( v | R ) for every distinct pair of vertices u , v of G, where c ( w | R ) = ( d ( w , r 1 ) , d ( w , r 2 ) , … ,
Laxman Saha, Kalishankar Tiwary
exaly   +2 more sources

Fault-Tolerant Metric Dimension and Applications: Zero-Divisor Graph of Upper Triangular Matrices

Mathematics
Graph invariants play a crucial role in understanding the structural and combinatorial characteristics of graphs. The fault-tolerant metric dimension, as a significant graph invariant, finds applications in diverse areas such as robust network ...
Vijay Kumar Bhat
exaly   +2 more sources

On the fault-tolerant metric dimension of convex polytopes

Applied Mathematics and Computation, 2018
A convex polytopes is a polytope that is also a convex set of points in the n-dimensional Euclidean space R n . By preserving the same adjacency relation between vertices of a convex polytope, its graph is constructed.
Hassan Raza, Sakander Hayat, Xiang-Feng Pan   +2 more
exaly   +2 more sources

On the fault-tolerant metric dimension of certain interconnection networks

Journal of Applied Mathematics and Computing, 2018
Sakander Hayat, Xiang-Feng Pan, Raza Hassan   +2 more
exaly   +2 more sources