Search alternatives:
task optimization » based optimization (Expand Search), phase optimization (Expand Search), path optimization (Expand Search)
binary marked » binary mask (Expand Search)
binary paper » binary pairs (Expand Search)
marked swarm » marked scale (Expand Search)
paper task » paper toss (Expand Search), paper taisei (Expand Search)
Showing 1 - 20 results of 37 for search '(( binary paper task optimization algorithm ) OR ( binary marked swarm optimization algorithm ))*', query time: 0.32s Refine Results
  1. 1
    Sensitivity values of IRBMO vs. other binary algorithms.

    Sensitivity values of IRBMO vs. other binary algorithms. by Chenyi Zhu (9383370)

    Published 2025
    Save to List
    Saved in:
  2. 2
    Specificity values of IRBMO vs. other binary algorithms.

    Specificity values of IRBMO vs. other binary algorithms. by Chenyi Zhu (9383370)

    Published 2025
    Save to List
    Saved in:
  3. 3
    Fitness values of IRBMO vs. other binary algorithms.

    Fitness values of IRBMO vs. other binary algorithms. by Chenyi Zhu (9383370)

    Published 2025
    Save to List
    Saved in:
  4. 4
    Number of features selected for IRBMO vs. other binary algorithms.

    Number of features selected for IRBMO vs. other binary algorithms. by Chenyi Zhu (9383370)

    Published 2025
    Save to List
    Saved in:
  5. 5
    Classification accuracy values of IRBMO vs. other binary algorithms.

    Classification accuracy values of IRBMO vs. other binary algorithms. by Chenyi Zhu (9383370)

    Published 2025
    Save to List
    Saved in:
  6. 6
    F-score values of IRBMO vs. other binary algorithms.

    F-score values of IRBMO vs. other binary algorithms. by Chenyi Zhu (9383370)

    Published 2025
    Save to List
    Saved in:
  7. 7
    Flowchart depicting the structure of the BDMO algorithm.

    Flowchart depicting the structure of the BDMO algorithm. by Olatunji A. Akinola (13919696)

    Published 2022
    Save to List
    Saved in:
  8. 8
    Summary of Notations Used in this paper.

    Summary of Notations Used in this paper. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  9. 9
    The Pseudo-Code of the IRBMO Algorithm.

    The Pseudo-Code of the IRBMO Algorithm. by Chenyi Zhu (9383370)

    Published 2025
    “…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
    Save to List
    Saved in:
  10. 10
    Proposed Algorithm.

    Proposed Algorithm. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  11. 11
    IRBMO vs. meta-heuristic algorithms boxplot.

    IRBMO vs. meta-heuristic algorithms boxplot. by Chenyi Zhu (9383370)

    Published 2025
    “…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
    Save to List
    Saved in:
  12. 12
    IRBMO vs. feature selection algorithm boxplot.

    IRBMO vs. feature selection algorithm boxplot. by Chenyi Zhu (9383370)

    Published 2025
    “…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
    Save to List
    Saved in:
  13. 13
    CDF of task latency, approximated as the inverse of the achieved computation rate.

    CDF of task latency, approximated as the inverse of the achieved computation rate. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  14. 14
    Comparisons between ADAM and NADAM optimizers.

    Comparisons between ADAM and NADAM optimizers. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  15. 15
    Comparisons of computation rate performance for different offloading algorithms.for N = 10, 20, 30.

    Comparisons of computation rate performance for different offloading algorithms.for N = 10, 20, 30. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  16. 16
    Comparison of total time consumed for different offloading algorithms.for N = 10, 20, 30.

    Comparison of total time consumed for different offloading algorithms.for N = 10, 20, 30. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  17. 17
    An Example of a WPT-MEC Network.

    An Example of a WPT-MEC Network. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  18. 18
    Related Work Summary.

    Related Work Summary. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  19. 19
    Simulation parameters.

    Simulation parameters. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  20. 20
    Training losses for N = 10.

    Training losses for N = 10. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:

Search Tools: