يعرض 141 - 160 نتائج من 219 نتيجة بحث عن '(( binary based design optimization algorithm ) OR ( binary based based optimization algorithm ))*', وقت الاستعلام: 0.44s تنقيح النتائج
  1. 141

    A new fast filtering algorithm for a 3D point cloud based on RGB-D information حسب Chaochuan Jia (7256237)

    منشور في 2019
    "…This method aligns the color image to the depth image, and the color mapping image is converted to an HSV image. Then, the optimal segmentation threshold of the V image that is calculated by using the Otsu algorithm is applied to segment the color mapping image into a binary image, which is used to extract the valid point cloud from the original point cloud with outliers. …"
  2. 142

    Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment حسب Jianfang Cao (1881379)

    منشور في 2019
    "…<div><p>An image classification algorithm based on adaptive feature weight updating is proposed to address the low classification accuracy of the current single-feature classification algorithms and simple multifeature fusion algorithms. …"
  3. 143

    Secure MANET routing with blockchain-enhanced latent encoder coupled GANs and BEPO optimization حسب Sandeep Jagonda Patil (22048337)

    منشور في 2025
    "…To tackle these challenges, this paper proposes the Blockchain Based Trusted Distributed Routing Scheme for MANET using Latent Encoder Coupled Generative Adversarial Network Optimized with Binary Emperor Penguin Optimizer (LEGAN-BEPO-BCMANET). …"
  4. 144

    Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf حسب Cecilia Lindig-León (7889777)

    منشور في 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. …"
  5. 145
  6. 146

    A* Path-Finding Algorithm to Determine Cell Connections حسب Max Weng (22327159)

    منشور في 2025
    "…Pixel paths were classified using a z-score brightness threshold of 1.21, optimized for noise reduction and accuracy. The A* algorithm then evaluated connectivity by minimizing Euclidean distance and heuristic cost between cells. …"
  7. 147
  8. 148

    SHAP bar plot. حسب Meng Cao (105914)

    منشور في 2025
    الموضوعات:
  9. 149

    ROC curves for the test set of four models. حسب Meng Cao (105914)

    منشور في 2025
    الموضوعات:
  10. 150

    Display of the web prediction interface. حسب Meng Cao (105914)

    منشور في 2025
    الموضوعات:
  11. 151

    Sample screening flowchart. حسب Meng Cao (105914)

    منشور في 2025
    الموضوعات:
  12. 152

    Descriptive statistics for variables. حسب Meng Cao (105914)

    منشور في 2025
    الموضوعات:
  13. 153

    SHAP summary plot. حسب Meng Cao (105914)

    منشور في 2025
    الموضوعات:
  14. 154
  15. 155

    Data_Sheet_1_A Global Optimizer for Nanoclusters.PDF حسب Maya Khatun (7437011)

    منشور في 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. …"
  16. 156

    Data_Sheet_1_Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer.pdf حسب Maliheh Aramon (6557906)

    منشور في 2019
    "…<p>The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained binary optimization (QUBO) problems. …"
  17. 157

    Identification and quantitation of clinically relevant microbes in patient samples: Comparison of three k-mer based classifiers for speed, accuracy, and sensitivity حسب George S. Watts (7962206)

    منشور في 2019
    "…We tested the accuracy, sensitivity, and resource requirements of three top metagenomic taxonomic classifiers that use fast k-mer based algorithms: Centrifuge, CLARK, and KrakenUniq. …"
  18. 158
  19. 159

    <i>hi</i>PRS algorithm process flow. حسب Michela C. Massi (14599915)

    منشور في 2023
    "…From this dataset we can compute the MI between each interaction and the outcome and <b>(D)</b> obtain a ranked list (<i>I</i><sub><i>δ</i></sub>) based on this metric. <b>(E)</b> Starting from the interaction at the top of <i>I</i><sub><i>δ</i></sub>, <i>hi</i>PRS constructs <i>I</i><sub><i>K</i></sub>, selecting <i>K</i> (where <i>K</i> is user-specified) terms through the greedy optimization of the ratio between MI (<i>relevance</i>) and a suitable measure of similarity for interactions (<i>redundancy)</i> (cf. …"
  20. 160

    Summary of LITNET-2020 dataset. حسب Asmaa Ahmed Awad (16726315)

    منشور في 2023
    "…In this paper, a novel, and improved version of the Long Short-Term Memory (ILSTM) algorithm was proposed. The ILSTM is based on the novel integration of the chaotic butterfly optimization algorithm (CBOA) and particle swarm optimization (PSO) to improve the accuracy of the LSTM algorithm. …"