Search alternatives:
making algorithms » making algorithm (Expand Search), pacing algorithms (Expand Search), tracking algorithms (Expand Search)
method algorithm » network algorithm (Expand Search), means algorithm (Expand Search), mean algorithm (Expand Search)
elements making » elements during (Expand Search), element mapping (Expand Search), elemental mapping (Expand Search)
using algorithm » using algorithms (Expand Search), routing algorithm (Expand Search), fusion algorithm (Expand Search)
Showing 1 - 20 results of 9,939 for search '(((( element method algorithm ) OR ( elements making algorithms ))) OR ( data using algorithm ))', query time: 0.49s Refine Results
  1. 1
    Top-rated mode of transport based on the SEU algorithm (SEU scores from 0 to 40).

    Top-rated mode of transport based on the SEU algorithm (SEU scores from 0 to 40). by Johannes Weyer (13392175)

    Published 2025
    Save to List
    Saved in:
  2. 2
    Algorithmic experimental parameter design.

    Algorithmic experimental parameter design. by Chuanxi Xing (20141665)

    Published 2024
    “…The results of numerical simulations and sea trial experimental data indicate that the use of subarrays comprising 5 and 3 array elements, respectively, is sufficient to effectively estimate 12 source angles. …”
    Save to List
    Saved in:
  3. 3
    Numbers of iterations (#Ite) and eigenvalue calculations (#Eig) in the DC algorithm on the random and chain graph datasets.

    Numbers of iterations (#Ite) and eigenvalue calculations (#Eig) in the DC algorithm on the random and chain graph datasets. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  4. 4
    Spatial spectrum estimation for three algorithms.

    Spatial spectrum estimation for three algorithms. by Chuanxi Xing (20141665)

    Published 2024
    “…The results of numerical simulations and sea trial experimental data indicate that the use of subarrays comprising 5 and 3 array elements, respectively, is sufficient to effectively estimate 12 source angles. …”
    Save to List
    Saved in:
  5. 5
    ML algorithms in cyber security.

    ML algorithms in cyber security. by Abdullah Asım Yılmaz (20715311)

    Published 2025
    Save to List
    Saved in:
  6. 6
    Multi-material topology optimization using scaled boundary finite element method

    Multi-material topology optimization using scaled boundary finite element method by Mohammed Saif Zamiruddin Siddiqui (22384884)

    Published 2025
    “…<p>This work introduces the use of Scaled Boundary Finite Element Method (SBFEM) in Multi-Material Topology Optimization (MMTO) problems, which is new in the literature. …”
    Save to List
    Saved in:
  7. 7
    Computation time as a function of the sample size on the chain graph dataset.

    Computation time as a function of the sample size on the chain graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  8. 8
    Log-likelihood as a function of the number of selected edges on the chain graph dataset (black dashed line: The true number of edges).

    Log-likelihood as a function of the number of selected edges on the chain graph dataset (black dashed line: The true number of edges). by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  9. 9
    Computation time as a function of the sample size on the random graph dataset.

    Computation time as a function of the sample size on the random graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  10. 10
    F1 score of edges selected through cross-validation on the chain graph dataset.

    F1 score of edges selected through cross-validation on the chain graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  11. 11
    Log-likelihood as a function of the number of selected edges on the random graph dataset (black dashed line: The true number of edges).

    Log-likelihood as a function of the number of selected edges on the random graph dataset (black dashed line: The true number of edges). by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  12. 12
    Examples of ground-truth graph structures with (<i>p</i>, <i>n</i><sub>≠0</sub>) = (10, 10).

    Examples of ground-truth graph structures with (<i>p</i>, <i>n</i><sub>≠0</sub>) = (10, 10). by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  13. 13
    Number of edges selected through cross-validation on the chain graph dataset.

    Number of edges selected through cross-validation on the chain graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  14. 14
    Number of edges selected through cross-validation on the random graph dataset.

    Number of edges selected through cross-validation on the random graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  15. 15
    Graphs of the regularization terms.

    Graphs of the regularization terms. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  16. 16
    F1 score of a given number of selected edges on the chain graph dataset.

    F1 score of a given number of selected edges on the chain graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  17. 17
    Computation time as a function of the number of variables on the chain graph dataset.

    Computation time as a function of the number of variables on the chain graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  18. 18
    Computation time as a function of the number of variables on the random graph dataset.

    Computation time as a function of the number of variables on the random graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  19. 19
    F1 score of a given number of selected edges on the random graph dataset.

    F1 score of a given number of selected edges on the random graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  20. 20
    F1 score of edges selected through cross-validation on the random graph dataset.

    F1 score of edges selected through cross-validation on the random graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:

Search Tools: