Test pattern optimization scheme based on Hybrid Ant Colony Optimization [PDF]
The trend toward device miniaturization has made digital circuit testing both essential and increasingly complex. To achieve complete fault coverage, a large number of test patterns are applied, which leads to increased switching activity due to larger ...
S. Asha Pon, V. Jeyalakshmi
doaj +2 more sources
Optimizing solar farm interconnection networks using graph theory and metaheuristic algorithms with economic and reliability analysis [PDF]
As global energy demand continues to rise and the need to transition from fossil fuels becomes increasingly urgent, integrating solar farms efficiently into power grids presents a significant challenge.
Ali Ghias-Nodoushan +3 more
doaj +2 more sources
Load Restoration in Distribution System using Minimum Spanning Tree - Prim's Algorithm
6432 Published By: Blue Eyes Intelligence Engineering & Sciences Publication Retrieval Number: D5153118419/2019©BEIESP DOI:10.35940/ijrte.D5153.118419 Abstract: Power outage is detrimental to the grid system therefore solving the issue within a short ...
H. Mohamad +4 more
semanticscholar +2 more sources
Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms [PDF]
AbstractWe develop machine-checked verifications of the full functional correctness of C implementations of the eponymous graph algorithms of Dijkstra, Kruskal, and Prim. We extend Wang et al.’s CertiGraph platform to reason about labels on edges, undirected graphs, and common spatial representations of edge-labeled graphs such as adjacency matrices ...
Mohan, Anshuman +2 more
openaire +2 more sources
Local limit of Prim's algorithm [PDF]
We study the local evolution of Prim's algorithm on large finite weighted graphs. When performed for $n$ steps, where $n$ is the size of the graph, Prim's algorithm will construct the minimal spanning tree (MST). We assume that our graphs converge locally in probability to some limiting rooted graph.
Corsini, Benoît +2 more
openaire +3 more sources
Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm [PDF]
. minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network.
Suvajit Dutta +3 more
semanticscholar +2 more sources
A Real-Time Smooth Weighted Data Fusion Algorithm for Greenhouse Sensing Based on Wireless Sensor Networks [PDF]
Wireless sensor networks are widely used to acquire environmental parameters to support agricultural production. However, data variation and noise caused by actuators often produce complex measurement conditions.
Tengyue Zou +3 more
doaj +2 more sources
A network recovery strategy based on boundary nodes and tetrahedral approximation fermat points in three-dimensional wireless sensor networks [PDF]
Wireless Sensor Networks (WSNs) have emerged as a critical research frontier in the Internet of Things (IoT) domain, with widespread applications in three-dimensional environments.
Bin Xu, Hongsheng Chen, Yanxu Cheng
doaj +2 more sources
TAN-FGBMLE: Tree-Augmented Naive Bayes Structure Learning Based on Fast Generative Bootstrap Maximum Likelihood Estimation for Continuous-Variable Classification [PDF]
Tree-Augmented Naive Bayes (TAN) is an interpretable graphical structure model. However, its structure learning for continuous attributes depends on the class-conditional mutual information, which is sensitive to one-dimensional or two-dimensional ...
Chenghao Wei +4 more
doaj +2 more sources
Modification of Prim’s algorithm on complete broadcasting graph
Broadcasting is an information dissemination from one object to another object through communication between two objects in a network. Broadcasting for n objects can be solved by n − 1 communications and minimum time unit defined by ⌈2log n⌉ In this ...
null Dairina +4 more
openaire +2 more sources

