Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
algorithm pre » algorithm pca (Expand Search), algorithm where (Expand Search), algorithm used (Expand Search)
pre function » spread function (Expand Search), sphere function (Expand Search), phase function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
algorithm pre » algorithm pca (Expand Search), algorithm where (Expand Search), algorithm used (Expand Search)
pre function » spread function (Expand Search), sphere function (Expand Search), phase function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
-
21
-
22
-
23
-
24
-
25
-
26
-
27
-
28
-
29
-
30
-
31
Dataset of networks used in assessing the Troika algorithm for clique partitioning and community detection
Published 2025“…</p><p dir="ltr"><br></p><p dir="ltr">For more information about the data, one may refer to the article below:</p><p dir="ltr">Aref S, Ng B (2025) Troika algorithm: Approximate optimization for accurate clique partitioning and clustering of weighted networks. …”
-
32
-
33
Flowchart of proposed algorithm.
Published 2025“…Moreover, the proposed algorithm significantly extends network lifetime, with a <b>3.5%</b> and <b>7.5%</b> improvement over EAPS-AODV and AODV. …”
-
34
-
35
-
36
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. …”
-
37
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. …”
-
38
-
39
-
40