Showing 1 - 20 results of 28 for search '(((( complement i algorithm ) OR ( elements monte algorithm ))) OR ( neural coding algorithm ))', query time: 0.12s 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
  10. 10
  11. 11
  12. 12

    Analysis of Multi-User-Based UAV System With Outdated CSI by Parvez Shaik (21633041)

    Published 2024
    “…Optimization of UAV location and altitude is performed through a limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) algorithm to attain minimum OP (MOP). Results illustrate optimal performance dependent on the channel correlation parameters, antenna elements, and fading conditions. …”
  13. 13
  14. 14

    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
  15. 15
  16. 16

    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
  17. 17

    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
  18. 18
  19. 19

    The maximum common subgraph problem by Abu-Khzam, Faisal N.

    Published 2017
    “…We transform an essential part of the search process into the task of enumerating maximal independent sets in only a part of only one of the input graphs. This is made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  20. 20

    A Literature Review on System Dynamics Modeling for Sustainable Management of Water Supply and Demand by Khawar Naeem (17984062)

    Published 2023
    “…Although the scenario analysis is supported by simulation models, they further require the optimization models to yield optimal key parameter values. One noticeable finding is that only 12% of the articles used quantitative models to complement SDM for the decision-making process. …”