Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
An efficient population-based simulated annealing algorithm for 0–1 knapsack problem
1 knapsack problem (KP01) is one of the classic variants of knapsack problems in which the
aim is to select the items with the total profit to be in the knapsack. In contrast, the constraint …
aim is to select the items with the total profit to be in the knapsack. In contrast, the constraint …
Optimal solving of a binary knapsack problem on a D-Wave quantum machine and its implementation in production systems
The efficient management of complex production systems is a challenge in today's logistics.
In the field of intelligent and sustainable logistics, the optimization of production batches …
In the field of intelligent and sustainable logistics, the optimization of production batches …
A compression-based memory-efficient optimization for out-of-core GPU stencil computation
A code for out-of-core stencil computation manages data that exceeds the memory capacity
of a GPU. However, such a code necessitates frequent data transfers between the CPU and …
of a GPU. However, such a code necessitates frequent data transfers between the CPU and …
Energy-efficient deployment and resource allocation for O-RAN-enabled UAV-assisted communication
Open Radio Access Network (O-RAN) has brought a significant transformation in the field of
communication networks. Its openness propels communication networks towards a more …
communication networks. Its openness propels communication networks towards a more …
Reducing the amount of out‐of‐core data access for GPU‐accelerated randomized SVD
We propose two acceleration methods, namely, Fused and Gram, for reducing out‐of‐core
data access when performing randomized singular value decomposition (RSVD) on …
data access when performing randomized singular value decomposition (RSVD) on …
Accelerating GPU-based out-of-core stencil computation with on-the-fly compression
Stencil computation is an important class of scientific applications that can be efficiently
executed by graphics processing units (GPUs). Out-of-core approaches help run large scale …
executed by graphics processing units (GPUs). Out-of-core approaches help run large scale …
[HTML][HTML] Novel route planning system for machinery selection. Case: slurry application
The problem of finding an optimal solution for the slurry application process is casted as a
capacitated vehicle routing problem (CVRP) in which by considering the vehicle's capacity, it …
capacitated vehicle routing problem (CVRP) in which by considering the vehicle's capacity, it …
A data-centric directive-based framework to accelerate out-of-core stencil computation on a GPU
Graphics processing units (GPUs) are highly efficient architectures for parallel stencil code;
however, the small device (ie, GPU) memory capacity (several tens of GBs) necessitates the …
however, the small device (ie, GPU) memory capacity (several tens of GBs) necessitates the …
[HTML][HTML] An arable field for benchmarking of metaheuristic algorithms for capacitated coverage path planning problems
This study specifies an agricultural field (Latitude= 56° 30′ 0.8 ″N, Longitude= 9° 35′
27.88 ″E) and provides the absolute optimal route for covering that field. The calculated …
27.88 ″E) and provides the absolute optimal route for covering that field. The calculated …
Prf: A fast parallel relaxed flooding algorithm for voronoi diagram generation on gpu
This paper introduces a novel parallel relaxed flooding (PRF) algorithm for Voronoi diagram
generation. The algorithm takes a set of reference points extracted from an image as input …
generation. The algorithm takes a set of reference points extracted from an image as input …