Search alternatives:
algorithm spread » algorithm pre (Expand Search), algorithms real (Expand Search), algorithms sorted (Expand Search)
algorithm its » algorithm i (Expand Search), algorithm etc (Expand Search), algorithm iqa (Expand Search)
algorithm npc » algorithm etc (Expand Search), algorithm pca (Expand Search), algorithm _ (Expand Search)
its function » i function (Expand Search), loss function (Expand Search), cost function (Expand Search)
npc function » spc function (Expand Search), gpcr function (Expand Search), fc function (Expand Search)
algorithm spread » algorithm pre (Expand Search), algorithms real (Expand Search), algorithms sorted (Expand Search)
algorithm its » algorithm i (Expand Search), algorithm etc (Expand Search), algorithm iqa (Expand Search)
algorithm npc » algorithm etc (Expand Search), algorithm pca (Expand Search), algorithm _ (Expand Search)
its function » i function (Expand Search), loss function (Expand Search), cost function (Expand Search)
npc function » spc function (Expand Search), gpcr function (Expand Search), fc function (Expand Search)
-
1
-
2
-
3
Algorithm of the main experiment targeted to measure the perceptual point spread function (pPSF) treating patients visual system including its optics, physiology and psychology as an integrated imaging system, and patient’s perceptions as its output signal.
Published 2024“…<p>In the algorithm, the following variables were used: “Ic” denotes the intensity of the central diode (Ic = 40 cd); “DIST(i)” is a randomly sorted list of “D” angular stimuli positions distributed equally as a function of distance from 0.24° to 7.67° from the central point (D = 10), while “i” is an index corresponding to the current distance of a probe diode (“d”); “N” denotes the number of trials for each stimuli position (N = 20); “s” denotes the perceptual brightness value transformed to diode luminous intensity by an array “I(s)” corresponds to the table “scale (level)” determined by the algorithm presented in <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0306331#pone.0306331.g003" target="_blank">Fig 3</a>; “cnt” is a counter of trials for the current probe diode’s distance, array threshold (d), and slope (d), i.e., it denotes the intensity of the single point of the pPSF and its uncertainty. …”
-
4
Flowchart of MOSRS algorithm.
Published 2025“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”
-
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
-
13
-
14
-
15
-
16
-
17
Fitness function over the 50 runs.
Published 2025“…Results reveal that ZOA outperformed other algorithms, supplying electricity at a minimum cost of 0.1285 $/kWh in one configuration, with the LFP battery achieving the lowest NPC of 3.8 M$ in case studies with constrained LPSP. …”
-
18
Fitness function over the 50 runs.
Published 2025“…Results reveal that ZOA outperformed other algorithms, supplying electricity at a minimum cost of 0.1285 $/kWh in one configuration, with the LFP battery achieving the lowest NPC of 3.8 M$ in case studies with constrained LPSP. …”
-
19
Fitness function over the 50 runs.
Published 2025“…Results reveal that ZOA outperformed other algorithms, supplying electricity at a minimum cost of 0.1285 $/kWh in one configuration, with the LFP battery achieving the lowest NPC of 3.8 M$ in case studies with constrained LPSP. …”
-
20