Search alternatives:
using function » using functional (Expand Search), sine function (Expand Search), waning function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
using function » using functional (Expand Search), sine function (Expand Search), waning function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
-
1
-
2
Flowchart of proposed fitness function algorithm.
Published 2025“…The mathematical model was transformed into a fitness function and a solution was provided with the Tabu Search Algorithm and Simulated Annealing. …”
-
3
-
4
-
5
-
6
-
7
Function graph and algorithm iterative graph.
Published 2024“…The wild horse optimizer (WHO) is a new metaheuristic algorithm based on the social behavior of wild horses. …”
-
8
-
9
-
10
-
11
-
12
-
13
The parameters of algorithms.
Published 2025“…However, solving the RNP problem in WMN is difficult because it is NP-hard. As a result, this problem can only be solved using approximate optimization algorithms such as heuristics and meta-heuristics. …”
-
14
-
15
Eight commonly used benchmark functions.
Published 2023“…The proposed algorithm was evaluated on eight standard benchmark functions, CEC2019 benchmark functions, four engineering design problems, and a PID parameter optimization problem. …”
-
16
-
17
Flowchart of DAPF-RRT algorithm.
Published 2025“…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
-
18
Performance comparison of different algorithms.
Published 2025“…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
-
19
Search Algorithms and Loss Functions for Bayesian Clustering
Published 2022“…<p>We propose a randomized greedy search algorithm to find a point estimate for a random partition based on a loss function and posterior Monte Carlo samples. …”
-
20