Search alternatives:
algorithm steps » algorithm shows (Expand Search), algorithm models (Expand Search)
steps function » step function (Expand Search), its function (Expand Search), cep function (Expand Search)
algorithm i » algorithm _ (Expand Search), algorithm b (Expand Search), algorithm a (Expand Search)
algorithm steps » algorithm shows (Expand Search), algorithm models (Expand Search)
steps function » step function (Expand Search), its function (Expand Search), cep function (Expand Search)
algorithm i » algorithm _ (Expand Search), algorithm b (Expand Search), algorithm a (Expand Search)
-
1
-
2
-
3
-
4
Curve of step response signal of 6 algorithms.
Published 2023“…Secondly, the nonlinear convergence factor is constructed to replace the original random factor <i>c</i><sub>1</sub> to coordinate the algorithm’s local exploitation and global exploration performance, which effectively improves the ability of the algorithm to escape extreme values and fast convergence. …”
-
5
-
6
-
7
-
8
Flowchart of the specific incarnation of the BO algorithm used in the experiments.
Published 2020“…To choose the next pipeline configuration to evaluate, the BO algorithm uses an Expected Improvement function to trade off maximisation of QS with the need to fully learn the GP. …”
-
9
-
10
-
11
-
12
Swarm intelligence algorithms for multi-objective IMP: Step-by-step improvement
Published 2022“…</div><div><br></div><div>positional arguments: </div><div> file </div><div><br></div><div>optional arguments: </div><div> -h, --help: show this help message and exit </div><div> -a: read file input contents as an Adjacency Matrix </div><div> -r: reverse nodes order, reads (b,a,w) instead of (a,b,w) </div><div> -d D: line separator to use on file parsing </div><div> -t T: number of times to execute this solver </div><div> -i I: number of metaheuristic iterations per execution </div><div> -q Q: fixed quota, use 0 = floor(n/2)+1 </div><div> --shape SHAPE: shape functions for binarization - list of implemented shape functions: s2, s2_neg, v2, v4 </div><div> --sym: consider graph as symmetric instead of directed </div><div> --folder FOLDER: output folder </div><div> --seed SEED: use custom seed for metaheuristic pseudo RNG </div><div> --spread SPREAD: use specific influence spread model funcion - list of implemented models: LT, IC </div><div> --sum SUM: adds an extra value to all edge's weight --mh MH: metaheuristic to use - list of implemented metaheuristics: 1 (Swarm3) </div><div> --tagsfile TAGSFILE: use first row as node tags instead of using plurality criteria </div><div> --notags: do not use first row as node tags, instead tags will be calculated </div><div> --prune: nodes with (1) outdegree = 0 and indegree > 0, and (2) with outdegree = 1 and neighbor's outdegree > 0 will be excluded </div><div> --prunelowdeg: nodes with low outdegree or degree will be excluded </div><div> --excludenodes EXCLUDENODES: nodes to skip, must be comma separated </div><div> --includeindegzero: forces to include nodes with indegree = 0 on all executions </div><div> --nodepthcriteria: particles will not tie off with spread depth in case of having same fitness and spread </div>…”
-
13
-
14
-
15
Algorithm of the brightness scale calibration experiment.
Published 2024“…<p>In the algorithm, the following variables were used: “I” denotes the current luminous intensity of the reference diode, “inc” denotes the current difference between reference and target diode luminous intensity; “cnt” is the current number of performed trials, while “correct” is a counter of correct answers in cnt trials, both of them are counted separately for every settings of I and inc. …”
-
16
-
17
-
18
Flowchart outlining the spectral analysis reconstruction algorithm for quantitative phase imaging using non-telecentric DHM systems.
Published 2023Subjects: “…developed computational algorithm…”
-
19
-
20