Summary of the contrasts obtained from the normalized images for both inclusions as a function of the host type and the wavelength. حسب María Victoria Waks-Serra (21578611)

Summary of greedy algorithms presented in this section. Details of approximation factors for FastGreedy and UnitGreedy may be found in [26] and [25], respectively. حسب Jeffrey Keithley (14626551)

الموضوعات:

The image of the Aekley function. حسب Zhengyu Xu (8550660)

Evolution of the rescaled hydraulic diameter () and complexity () in both simulations and seal tomograms as a function of simulation timestep and relative age (). حسب Jonathan E Kings (20818367)

The ALO algorithm optimization flowchart. حسب Wenjing Wang (181404)

"…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …"

The IALO algorithm solution flowchart. حسب Wenjing Wang (181404)

"…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …"

Percentage totBurden and percentage maxBurden reduced by UnitGreedy, SingletonGreedy, FastGreedy and baselines for = 0.535 in Iowa for FRED (first column) and SafeGraph (second col... حسب Jeffrey Keithley (14626551)

الموضوعات:

Metapopulation model notation. حسب Jeffrey Keithley (14626551)

الموضوعات:

Estimates of for each problem instance. حسب Jeffrey Keithley (14626551)

الموضوعات:

The instance of MaxCasesAverted and MaxPeaksReduced is a graph <i>G</i> constructed from the given instance of Max k-SI. حسب Jeffrey Keithley (14626551)

الموضوعات:

Percentage totBurden and percentage maxBurden reduced by UnitGreedy, FastGreedy and baselines for = 0.525 in Texas for FRED (first column) and SafeGraph (second column). حسب Jeffrey Keithley (14626551)

الموضوعات:

Approximation factors for each problem instance. حسب Jeffrey Keithley (14626551)

الموضوعات:

Percentage totBurden and percentage maxBurden reduced by all approaches for = 0.5345 in New Hampshire for FRED (first column) and SafeGraph (second column). حسب Jeffrey Keithley (14626551)

الموضوعات:

FastGreedy, UnitGreedy, SingletonGreedy, 3-EnumGreedy, and POMS comparison with respect to practical running time (estimated for POMS) to achieve approximation guarantee for New Ha... حسب Jeffrey Keithley (14626551)

الموضوعات:

The parameters of algorithms. حسب Le Huu Binh (18340233)

"…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. …"

The impact of extrinsic noise sources on the measured SNR is plotted for both CW and TG against varying optical filter magnitudes. حسب Nicholas H. Vitale (20469289)

Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional حسب Ryan Stocks (16867476)

"…Kohn–Sham density functional theory (KS-DFT) has become a cornerstone for studying the electronic structure of molecules and materials. …"

Optimization process of fitness function . حسب Yuehong Zhang (82779)

Cost function calculated by QA with different hyperparameters. حسب Takuro Matsuta (21608505)

الموضوعات: "…currently available algorithms…"

Cost function calculated by SA with different hyperparameters. حسب Takuro Matsuta (21608505)

الموضوعات: "…currently available algorithms…"