Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] Enhancing Clustering Efficiency in Heterogeneous Wireless Sensor Network Protocols Using the K-Nearest Neighbours Algorithm
Wireless Sensor Networks are formed by tiny, self-contained, battery-powered computers
with radio links that can sense their surroundings for events of interest and store and …
with radio links that can sense their surroundings for events of interest and store and …
[HTML][HTML] Multi-Agent Reinforcement Learning-Based Routing and Scheduling Models in Time-Sensitive Networking for Internet of Vehicles Communications Between …
S Garcia-Cantón, C Ruiz de Mendoza… - Applied Sciences, 2025 - mdpi.com
Future autonomous vehicles will interact with traffic infrastructure through roadside units
(RSUs) directly connected to transportation field cabinets (TFCs). These TFCs must be …
(RSUs) directly connected to transportation field cabinets (TFCs). These TFCs must be …
[HTML][HTML] An Efficient Multi-Topology Construction Method for Scheduling Mobile Data Flows in Software-Defined Networking
C Zhang, H Deng, R Han - Applied Sciences, 2024 - mdpi.com
In mobile networks, a content server can provide multiple services simultaneously to a
mobile device, generating multiple data flows. As the device moves, the transmission path in …
mobile device, generating multiple data flows. As the device moves, the transmission path in …
A constraint-based local search for edge disjoint rooted distance-constrained minimum spanning tree problem
Many network design problems arising in areas as diverse as VLSI circuit design, QoS
routing, traffic engineering, and computational sustainability require clients to be connected …
routing, traffic engineering, and computational sustainability require clients to be connected …
Constraint based local search for flowshops with sequence-dependent setup times
Permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-
SDST) and makespan minimisation is NP-hard. It has important practical applications, for …
SDST) and makespan minimisation is NP-hard. It has important practical applications, for …
[HTML][HTML] An optimization routing algorithm for green communication in underground mines
With the long-term dependence of humans on ore-based energy, underground mines are
utilized around the world, and underground mining is often dangerous. Therefore, many …
utilized around the world, and underground mining is often dangerous. Therefore, many …