Search alternatives:
coding algorithm » cosine algorithm (Expand Search), modeling algorithm (Expand Search), finding algorithm (Expand Search)
reference based » reference panel (Expand Search), reference set (Expand Search), differences based (Expand Search)
complement box » complement low (Expand Search), complement _ (Expand Search), complement 5a (Expand Search)
box algorithm » best algorithm (Expand Search), _ algorithm (Expand Search), ii algorithm (Expand Search)
coding algorithm » cosine algorithm (Expand Search), modeling algorithm (Expand Search), finding algorithm (Expand Search)
reference based » reference panel (Expand Search), reference set (Expand Search), differences based (Expand Search)
complement box » complement low (Expand Search), complement _ (Expand Search), complement 5a (Expand Search)
box algorithm » best algorithm (Expand Search), _ algorithm (Expand Search), ii algorithm (Expand Search)
-
81
The source code of LazyAct.
Published 2025“…The inferences reduction significantly decreases the time and FLOPs required by the <i>LazyAct</i> algorithm to complete tasks. Code is available here <a href="https://www.dropbox.com/scl/fo/wyoqo6q9gyt86zobfgbvx/h?…”
-
82
-
83
Flowchart of simple ant colony algorithm.
Published 2025“…These enhancements aim to achieve optimal routing scheduling based on risk information. At the same time, a reconfiguration algorithm for power optical communication networks, based on service priority, is proposed for specific service requests. …”
-
84
-
85
DMTD algorithm.
Published 2025“…The first algorithm, EITO<sub>E</sub>, is based on an expert system containing expert rules and a heuristic expert inference method. …”
-
86
-
87
-
88
-
89
-
90
-
91
-
92
-
93
-
94
-
95
-
96
-
97
-
98
-
99
-
100