Search alternatives:
design optimization » bayesian optimization (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
image design » images designed (Expand Search), simple design (Expand Search), space design (Expand Search)
binary als » binary values (Expand Search), binary labels (Expand Search), binary pairs (Expand Search)
als model » als models (Expand Search), ols models (Expand Search), jags model (Expand Search)
design optimization » bayesian optimization (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
image design » images designed (Expand Search), simple design (Expand Search), space design (Expand Search)
binary als » binary values (Expand Search), binary labels (Expand Search), binary pairs (Expand Search)
als model » als models (Expand Search), ols models (Expand Search), jags model (Expand Search)
-
1
-
2
-
3
Sample image for illustration.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
4
Quadratic polynomial in 2D image plane.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
5
Analysis and design of algorithms for the manufacturing process of integrated circuits
Published 2023“…Additionally, the results obtained from our new ILP model indicate that our genetic algorithm results are very close to the optimal values.…”
-
6
Comparison analysis of computation time.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
7
Process flow diagram of CBFD.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
8
Precision recall curve.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
9
Fortran & C++: design fractal-type optical diffractive element
Published 2022“…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …”
-
10
Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf
Published 2020“…And we propose two new multilabel uses of the Common Spatial Pattern (CSP) algorithm to optimize the signal-to-noise ratio, namely MC2CMI and MC2SMI approaches. …”
-
11
Seed mix selection model
Published 2022“…</p> <p> </p> <p>We applied the seed mix selection model using a binary genetic algorithm to select seed mixes (R package ‘GA’; Scrucca 2013; Scrucca 2017). …”
-
12
Thesis-RAMIS-Figs_Slides
Published 2024“…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…”
-
13
Active Learning Accelerated Discovery of Stable Iridium Oxide Polymorphs for the Oxygen Evolution Reaction
Published 2020“…We emphasize that the proposed AL algorithm can be easily generalized to search for any binary metal oxide structure with a defined stoichiometry.…”