Search alternatives:
algorithm shows » algorithm allows (Expand Search), algorithm flow (Expand Search)
shows function » loss function (Expand Search)
algorithm time » algorithm i (Expand Search), algorithm ai (Expand Search), algorithm pre (Expand Search)
algorithm wave » algorithm based (Expand Search), algorithm where (Expand Search), algorithm a (Expand Search)
time function » sine function (Expand Search), like function (Expand Search), tissue function (Expand Search)
wave function » rate function (Expand Search), a function (Expand Search), gene function (Expand Search)
algorithm shows » algorithm allows (Expand Search), algorithm flow (Expand Search)
shows function » loss function (Expand Search)
algorithm time » algorithm i (Expand Search), algorithm ai (Expand Search), algorithm pre (Expand Search)
algorithm wave » algorithm based (Expand Search), algorithm where (Expand Search), algorithm a (Expand Search)
time function » sine function (Expand Search), like function (Expand Search), tissue function (Expand Search)
wave function » rate function (Expand Search), a function (Expand Search), gene function (Expand Search)
-
1
-
2
-
3
-
4
-
5
Average function evaluation times of the three optimization algorithms.
Published 2025“…<p>Average function evaluation times of the three optimization algorithms.…”
-
6
-
7
Average CPU time (s) of all the referenced algorithm on benchmark function.
Published 2022“…<p>Average CPU time (s) of all the referenced algorithm on benchmark function.…”
-
8
-
9
-
10
-
11
-
12
-
13
Scheduling time of five algorithms.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
-
14
-
15
-
16
-
17
-
18
Completion times for different algorithms.
Published 2025“…Experimental results show that, compared with other baseline methods, the rMAPPO-based agent scheduling method can reduce robot waiting times more effectively, demonstrate greater adaptability in handling different riveting and welding tasks, and significantly enhance the manufacturing efficiency of stiffened H-beam.…”
-
19
-
20