بدائل البحث:
design optimization » bayesian optimization (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
image design » images designed (توسيع البحث), simple design (توسيع البحث), space design (توسيع البحث)
binary some » binary isomers (توسيع البحث)
some based » home based (توسيع البحث), score based (توسيع البحث), slope based (توسيع البحث)
design optimization » bayesian optimization (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
image design » images designed (توسيع البحث), simple design (توسيع البحث), space design (توسيع البحث)
binary some » binary isomers (توسيع البحث)
some based » home based (توسيع البحث), score based (توسيع البحث), slope based (توسيع البحث)
-
1
-
2
-
3
-
4
-
5
-
6
Data_Sheet_1_A Global Optimizer for Nanoclusters.PDF
منشور في 2019"…This method is implemented in PyAR (https://github.com/anooplab/pyar) program. The global optimization in PyAR involves two parts, generation of several trial geometries and gradient-based local optimization of the trial geometries. …"
-
7
Sample image for illustration.
منشور في 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
Quadratic polynomial in 2D image plane.
منشور في 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
Comparison analysis of computation time.
منشور في 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. …"
-
10
Process flow diagram of CBFD.
منشور في 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. …"
-
11
Precision recall curve.
منشور في 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. …"
-
12
-
13
Fortran & C++: design fractal-type optical diffractive element
منشور في 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. …"
-
14
Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf
منشور في 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. …"
-
15
Thesis-RAMIS-Figs_Slides
منشور في 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.…"
-
16
Seed mix selection model
منشور في 2022"…On some extensions to GA package: hybrid optimization, parallelization and islands evolution. …"