بدائل البحث:
algorithm python » algorithm within (توسيع البحث), algorithms within (توسيع البحث)
algorithm both » algorithm blood (توسيع البحث), algorithm b (توسيع البحث), algorithm co (توسيع البحث)
algorithm etc » algorithm _ (توسيع البحث), algorithm b (توسيع البحث), algorithm a (توسيع البحث)
etc function » fc function (توسيع البحث), spc function (توسيع البحث), npc function (توسيع البحث)
algorithm python » algorithm within (توسيع البحث), algorithms within (توسيع البحث)
algorithm both » algorithm blood (توسيع البحث), algorithm b (توسيع البحث), algorithm co (توسيع البحث)
algorithm etc » algorithm _ (توسيع البحث), algorithm b (توسيع البحث), algorithm a (توسيع البحث)
etc function » fc function (توسيع البحث), spc function (توسيع البحث), npc function (توسيع البحث)
-
61
-
62
-
63
-
64
The ALO algorithm optimization flowchart.
منشور في 2024"…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …"
-
65
The IALO algorithm solution flowchart.
منشور في 2024"…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …"
-
66
Comparison of scores obtained by our interpenetration and scoring algorithm (ISA) and ROSETTA for a subset of structures.
منشور في 2023"…However, our algorithm was 1000 times faster than pyROSETTA (both algorithms have been parallelized on a per-structure basis using the Python package joblib [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1010531#pcbi.1010531.ref069" target="_blank">69</a>]).…"
-
67
Comparison of UACI among different algorithms.
منشور في 2025"…Based on the 2D-SQSM, this paper further designs a highly robust color image encryption algorithm. First, by introducing different hash functions multiple times, the correlation between the key and plaintext is enhanced, significantly improving resistance against brute-force attacks; second, cyclic shifting and segmentation-recombination operations are applied separately to the three RGB channels to effectively disrupt pixel distribution and significantly reduce spatial correlation between pixels; finally, the chaotic sequence generated by the 2D-SQSM is utilized for XOR diffusion, further enhancing the randomness and diffusion capability of the ciphertext. …"
-
68
Comparison of NPCR among different algorithms.
منشور في 2025"…Based on the 2D-SQSM, this paper further designs a highly robust color image encryption algorithm. First, by introducing different hash functions multiple times, the correlation between the key and plaintext is enhanced, significantly improving resistance against brute-force attacks; second, cyclic shifting and segmentation-recombination operations are applied separately to the three RGB channels to effectively disrupt pixel distribution and significantly reduce spatial correlation between pixels; finally, the chaotic sequence generated by the 2D-SQSM is utilized for XOR diffusion, further enhancing the randomness and diffusion capability of the ciphertext. …"
-
69
-
70
-
71
-
72
Continuous Probability Distributions generated by the PIPE Algorithm
منشور في 2022"…The PIPE algorithm can generate several candidate functions to fit the empirical distribution of data. …"
-
73
Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional
منشور في 2025"…Kohn–Sham density functional theory (KS-DFT) has become a cornerstone for studying the electronic structure of molecules and materials. …"
-
74
-
75
-
76
-
77
The pseudocode for the NAFPSO algorithm.
منشور في 2025"…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …"
-
78
PSO algorithm flowchart.
منشور في 2025"…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …"
-
79
Parselmouth for bioacoustics: automated acoustic analysis in Python
منشور في 2023"…Five years ago, the Python package Parselmouth was released to provide easy and intuitive access to all functionality in the Praat software. …"
-
80
Multi-functional liquid crystal devices based on random binary matrix algorithm
منشور في 2023"…<p>Multi-functional diffraction gratings have found broad applications in laser processing, medicine, beam manipulation, etc. …"