Search alternatives:
means algorithm » search algorithm (Expand Search)
multi algorithm » multiple algorithms (Expand Search), custom algorithm (Expand Search)
using algorithm » using algorithms (Expand Search), routing algorithm (Expand Search), fusion algorithm (Expand Search)
elements means » elements mges (Expand Search), elements res (Expand Search)
means algorithm » search algorithm (Expand Search)
multi algorithm » multiple algorithms (Expand Search), custom algorithm (Expand Search)
using algorithm » using algorithms (Expand Search), routing algorithm (Expand Search), fusion algorithm (Expand Search)
elements means » elements mges (Expand Search), elements res (Expand Search)
-
1
-
2
Results on solving TSS using different evolutionary and greedy algorithms.
Published 2025“…<p>Results on solving TSS using different evolutionary and greedy algorithms.…”
-
3
-
4
-
5
-
6
Algorithm pseudocode.
Published 2025“…On the basis of the Retinex model, multi-level decomposition of brightness is carried out, and different filtering parameters are set to obtain multiple illumination and reflection images with different scale information; Using exponential function and Sigmoid function to process reflection images and illumination images separately, reducing external interference on images of different scales, and solving the difficulty of enhancing images with uneven illumination, high noise, low illumination, and loss of details. …”
-
7
Compare topologies when using the WOA algorithm to solve the RNP problem by different methods.
Published 2025Subjects: -
8
Compare topologies when using the MVO algorithm to solve the RNP problem by different methods.
Published 2025Subjects: -
9
-
10
Comparison of different algorithms.
Published 2025“…Finally, the model is solved by the multi-objective optimization algorithm to obtain a series of maintenance solutions in the form of Pareto non-inferior solution sets. …”
-
11
-
12
-
13
-
14
-
15
-
16
Pareto frontier solution solving process.
Published 2025“…The improved NSGA-II algorithm is used to solve the Pareto front efficiently, and the search efficiency is improved by the elite reservation strategy and the congestion adaptive adjustment mechanism. …”
-
17
-
18
Present an algorithm to prove P = NP
Published 2025“…NP problem, a long-standing challenge in computer science, we present a novel deterministic algorithm that solves the Hamiltonian path problem, a representative NP-complete problem, in polynomial time. …”
-
19
-
20