Showing 81 - 100 results of 126 for search '(( algorithm harding function ) OR ( algorithm python function ))*', query time: 0.23s Refine Results
  1. 81
  2. 82

    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>.…”
  3. 83
  4. 84
  5. 85
  6. 86

    Dataset of networks used in assessing the Troika algorithm for clique partitioning and community detection by Samin Aref (4683934)

    Published 2025
    “…Each network is provided in .gml format or .pkl format which can be read into a networkX graph object using standard functions from the networkX library in Python. For accessing other networks used in the study, please refer to the article for references to the primary sources of those network data.…”
  7. 87

    Overnight technician routing and scheduling problem with time windows and balanced workloads: a bi-objective zebra optimization algorithm by Abolfazl Gharaei (21803416)

    Published 2025
    “…The performance evaluation and validation results revealed that the proposed ML-based BOZOA provides very good performance in solving TRSPTWs at a variety of scales with respect to the optimality criteria, including, number of taken iterations, infeasibility, optimality error and complementarity compared with both an exact solver and two inspired algorithms from ZOA.</p> <p><b>Highlights</b></p><p>An ML-based bi-objective zebra optimisation algorithm to treat large-scale TRSPs</p><p>Centroid-based clustering on the population of zebras to avoid bias towards a specific search space</p><p>Making a trade-off between exploration and exploitation of the feasible region in the developed algorithm</p><p>A new MINLP model of a weighted bi-objective TRSP with limited capacity depots</p><p>Workload function, penalty function for lateness, subcontracts, time windows for tasks and breaks</p><p>Experiments using real data to show the performance of the model and solution method</p><p></p> <p>An ML-based bi-objective zebra optimisation algorithm to treat large-scale TRSPs</p> <p>Centroid-based clustering on the population of zebras to avoid bias towards a specific search space</p> <p>Making a trade-off between exploration and exploitation of the feasible region in the developed algorithm</p> <p>A new MINLP model of a weighted bi-objective TRSP with limited capacity depots</p> <p>Workload function, penalty function for lateness, subcontracts, time windows for tasks and breaks</p> <p>Experiments using real data to show the performance of the model and solution method</p>…”
  8. 88

    Summary of related works. by Yiming Kuang (22120458)

    Published 2025
    “…PiCCL is simple and light weight, it does not use asymmetric networks, intricate pretext tasks, hard to compute loss functions or multimodal data, which are common for multiview contrastive learning frameworks and could hinder performance, simplicity, generalizability and explainability. …”
  9. 89

    Results on STL-10 at 500 epoch. by Yiming Kuang (22120458)

    Published 2025
    “…PiCCL is simple and light weight, it does not use asymmetric networks, intricate pretext tasks, hard to compute loss functions or multimodal data, which are common for multiview contrastive learning frameworks and could hinder performance, simplicity, generalizability and explainability. …”
  10. 90

    Results on CIFAR-10 & CIFAR-100. by Yiming Kuang (22120458)

    Published 2025
    “…PiCCL is simple and light weight, it does not use asymmetric networks, intricate pretext tasks, hard to compute loss functions or multimodal data, which are common for multiview contrastive learning frameworks and could hinder performance, simplicity, generalizability and explainability. …”
  11. 91

    Speed and Memory Metrics. by Yiming Kuang (22120458)

    Published 2025
    “…PiCCL is simple and light weight, it does not use asymmetric networks, intricate pretext tasks, hard to compute loss functions or multimodal data, which are common for multiview contrastive learning frameworks and could hinder performance, simplicity, generalizability and explainability. …”
  12. 92

    Image augmentation methods. by Yiming Kuang (22120458)

    Published 2025
    “…PiCCL is simple and light weight, it does not use asymmetric networks, intricate pretext tasks, hard to compute loss functions or multimodal data, which are common for multiview contrastive learning frameworks and could hinder performance, simplicity, generalizability and explainability. …”
  13. 93

    Results on STL-10 with batch size = 256. by Yiming Kuang (22120458)

    Published 2025
    “…PiCCL is simple and light weight, it does not use asymmetric networks, intricate pretext tasks, hard to compute loss functions or multimodal data, which are common for multiview contrastive learning frameworks and could hinder performance, simplicity, generalizability and explainability. …”
  14. 94

    Supervised Predictive Modeling of High-dimensional Data with Group l0-norm Constrained Neural Networks by Zhihuang Yang (22530437)

    Published 2025
    “…Moreover, two iterative greedy selection algorithms, which iterate between a standard gradient descent step and a hard thresholding step with or without debiasing, are presented to implement the computation. …”
  15. 95

    Supplementary file 1_Hamiltonian formulations of centroid-based clustering.pdf by Myeonghwan Seong (21159605)

    Published 2025
    “…However, defining similarity is often ambiguous, making it challenging to determine the most appropriate objective function for a given dataset. Traditional clustering methods, such as the k-means algorithm and weighted maximum k-cut, focus on specific objectives—typically relying on average or pairwise characteristics of the data—leading to performance that is highly data-dependent. …”
  16. 96
  17. 97

    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). …”
  18. 98
  19. 99
  20. 100

    Hippocampal and cortical activity reflect early hyperexcitability in an Alzheimer's mouse model by Marina Diachenko (19739092)

    Published 2025
    “…</p><p dir="ltr">All data are available upon request. The standalone Python implementation of the fE/I algorithm is available under a CC-BY-NC-SA license at <a href="https://github.com/arthur-ervin/crosci" target="_blank">https://github.com/arthur-ervin/crosci</a>. …”