Showing 181 - 200 results of 731 for search '(( algorithm within function ) OR ( algorithm python function ))*', query time: 0.25s Refine Results
  1. 181
  2. 182
  3. 183
  4. 184
  5. 185
  6. 186

    Contrast enhancement of digital images using dragonfly algorithm by Soumyajit Saha (19726163)

    Published 2024
    “…Comparisons with state-of-art methods ensure the superiority of the proposed algorithm. The Python implementation of the proposed approach is available in this <a href="https://github.com/somnath796/DA_contrast_enhancement" target="_blank">Github repository</a>.…”
  7. 187
  8. 188
  9. 189

    Variants of weighted methods. by Limin Ma (556873)

    Published 2024
    “…At this point, considering the weights as the probabilities of the contributions of different attributes to the model can enhance the interpretation ability of the algorithm. Specifically, we add an entropy regularization term to the objective function of the problem model and then use the Lagrange multiplier method to solve the weights. …”
  10. 190
  11. 191

    GridScopeRodents: High-Resolution Global Typical Rodents Distribution Projections from 2021 to 2100 under Diverse SSP-RCP Scenarios by Yang Lan (20927512)

    Published 2025
    “…Using occurrence data and environmental variable, we employ the Maximum Entropy (MaxEnt) algorithm within the species distribution modeling (SDM) framework to estimate occurrence probability at a spatial resolution of 1/12° (~10 km). …”
  12. 192

    Accelerated MPC Algorithms and Augmented System Design for Legged Robots by John Ndegwa Nganga (21088838)

    Published 2025
    “…The approach is powered by a newly introduced algorithm, named the modified Recursive Newton Euler Algorithm~(mRNEA), which is inspired by classical RNEA, and computes the dynamics information pre-multiplied with a fixed vector. …”
  13. 193
  14. 194
  15. 195
  16. 196
  17. 197
  18. 198
  19. 199
  20. 200

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

    Published 2024
    “…Our method is particularly advantageous for selecting true edges when cross-validation is used to determine the number of edges. Moreover, our DC algorithm converges within a practical time frame compared to the graphical lasso.…”