Showing 1 - 20 results of 35 for search '(((( element mapping 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

    Nonlinear analysis of shell structures using image processing and machine learning by M.S. Nashed (16392961)

    Published 2023
    “…The proposed approach can be significantly more efficient than training a machine learning algorithm using the raw numerical data. To evaluate the proposed method, two different structures are assessed where the training data is created using nonlinear finite element analysis. …”
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11

    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
  12. 12
  13. 13

    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. …”
  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

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

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

    Published 2017
    “…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. The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject