Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Dynamic flying ant colony optimization (DFACO) for solving the traveling salesman problem
This paper presents an adaptation of the flying ant colony optimization (FACO) algorithm to
solve the traveling salesman problem (TSP). This new modification is called dynamic flying …
solve the traveling salesman problem (TSP). This new modification is called dynamic flying …
A novel clustering strategy-based sink path optimization for wireless sensor network
M **e, D Pi, C Dai, Y Xu, B Li - IEEE Sensors Journal, 2022 - ieeexplore.ieee.org
To optimize the path of mobile sinks in the wireless sensor network (WSN) and use of 5G
signals to transmit information, a new clustering strategy is proposed, which not only …
signals to transmit information, a new clustering strategy is proposed, which not only …
[PDF][PDF] Optimal packet routing for wireless body area network using software defined network to handle medical emergency
The packet forwarding node selection is one of the main constraints in the Software Defined
Network (SDN). To improve the network performance, the SDN controller has to choose the …
Network (SDN). To improve the network performance, the SDN controller has to choose the …
[PDF][PDF] Machine Learning for QoS Optimization and Energy-Efficient in Routing Clustering Wireless Sensors.
Wireless sensor network (WSN) technologies have advanced significantly in recent years.
Within WSNs, machine learning algorithms are crucial in selecting cluster heads (CHs) …
Within WSNs, machine learning algorithms are crucial in selecting cluster heads (CHs) …
An O (1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique
P Saikia - 2024 20th International Conference on Distributed …, 2024 - ieeexplore.ieee.org
We study the Traveling Salesman Problem (TSP) in the Congested Clique Model (CCM) of
distributed computing. We present a deterministic distributed algorithm that computes a tour …
distributed computing. We present a deterministic distributed algorithm that computes a tour …
Angle constrained Paths
S Asaeedi, MS Shamaee - 2023 - researchsquare.com
The traveling salesman problem (TSP) is a well-known and most widely studied problem in
combinatorial optimization. The Dubins TSP is a variant of TSP for curvature-constrained …
combinatorial optimization. The Dubins TSP is a variant of TSP for curvature-constrained …
[PDF][PDF] A Massively Parallel Exact TSP Solver for Small Problem Sizes
BV Jerald Xavier - 2022 - digital.library.txstate.edu
The Traveling Salesman Problem (TSP) is a combinatorial optimization problem tasked with
finding the shortest tour for visiting a set of cities such that each city is visited exactly once …
finding the shortest tour for visiting a set of cities such that each city is visited exactly once …