Showing 1 - 20 results of 36 for search '(( elements per algorithm ) OR ((( complement _ algorithm ) OR ( neural coding algorithm ))))', query time: 0.11s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing by Abualigah, Laith

    Published 2024
    “…The Jaya algorithm's ability to exploit the current best solutions is complemented by the SSO's collaborative search strategy, resulting in a synergistic optimization framework. …”
    Get full text
  9. 9

    Correlation Clustering with Overlaps by Fakhereldine, Amin

    Published 2020
    “…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  10. 10
  11. 11
  12. 12

    MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments by Hend Gedawy (23275984)

    Published 2022
    “…For MAESTRO, we build an integrated architecture that includes two new scheduling algorithms for assigning computing workloads to FemtoClouds. …”
  13. 13

    Multidimensional Gains for Stochastic Approximation by Saab, Samer S.

    Published 2019
    “…The proposed algorithms here aim for per-iteration minimization of the mean square estimate error. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  14. 14
  15. 15

    A novel technique for fast multiplication by Sait, Sadiq M.

    Published 2020
    “…The algorithm is modelled in a hardware description language and its VLSI chip implemented. …”
    Get full text
    article
  16. 16
  17. 17

    A novel technique for fast multiplication by Sait, Sadiq M.

    Published 1995
    “…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …”
    Get full text
    Get full text
    article
  18. 18

    On the complexity of multi-parameterized cluster editing by Abu-Khzam, Faisal

    Published 2017
    “…In other words, Cluster Editing can be solved efficiently when the number of false positives/negatives per single data element is expected to be small compared to the minimum cluster size. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  19. 19

    A new approach and faster exact methods for the maximum common subgraph problem by Abu-Khzam, Faisal N.

    Published 2017
    “…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  20. 20