يعرض 1 - 20 نتائج من 25 نتيجة بحث عن '(( complement system algorithm ) OR ((( relevant ppo algorithm ) OR ( neural coding algorithm ))))', وقت الاستعلام: 0.13s تنقيح النتائج
  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 حسب Abualigah, Laith

    منشور في 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. …"
    احصل على النص الكامل
  9. 9

    Small-Signal Stability Analysis and Parameters Optimization of Virtual Synchronous Generator for Low-Inertia Power System حسب Alaa Altawallbeh (22565837)

    منشور في 2025
    "…We further propose a hybrid Particle Swarm Optimization (PSO) algorithm with a multi-objective cost function to optimize VSG controller gains. …"
  10. 10

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

    منشور في 2022
    "…Each of our scheduling algorithms is designed to allow the system to operate more efficiently given poor or strong network infrastructures. …"
  11. 11

    Multi-Modal Emotion Aware System Based on Fusion of Speech and Brain Information حسب M. Ghoniem, Rania

    منشور في 2019
    "…Further, EEG is utilized as inner channel complementing speech for more authoritative recognition, by extracting multiple features belonging to time, frequency, and time–frequency. …"
    احصل على النص الكامل
    احصل على النص الكامل
  12. 12

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

    منشور في 2023
    "…WSDM is only effective when tackled from the perspective of a holistic system understanding that considers social, environmental, hydrological, and economic (SEHEc) sub-systems. …"
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17

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

    منشور في 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. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  18. 18
  19. 19
  20. 20