يعرض 1 - 20 نتائج من 30 نتيجة بحث عن '(( movement data algorithm ) OR ((( complement search algorithm ) OR ( neural coding algorithm ))))', وقت الاستعلام: 0.13s تنقيح النتائج
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    Bird’s Eye View feature selection for high-dimensional data حسب Samir Brahim Belhaouari (16855434)

    منشور في 2023
    "…BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. …"
  6. 6
  7. 7
  8. 8
  9. 9

    Particle swarm optimization algorithm: review and applications حسب Abualigah, Laith

    منشور في 2024
    "…Particle swarm optimization (PSO) is a heuristic global optimization technique and an optimization algorithm that is swarm intelligence-based. It is based on studies into the movement of bird flocks. …"
    احصل على النص الكامل
  10. 10

    RHEEMix in the data jungle: a cost-based optimizer for cross-platform systems. حسب Sebastian Kruse (18595195)

    منشور في 2020
    "…Our main contributions are: (i) a mechanism based on graph transformations to explore alternative execution strategies; (ii) a novel graph-based approach to determine efficient data movement plans among subtasks and platforms; and (iii) an efficient plan enumeration algorithm, based on a novel enumeration algebra. …"
  11. 11
  12. 12

    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. …"
    احصل على النص الكامل
  13. 13

    Towards Scalable Process Mining Pipelines حسب Mohamed, Belal

    منشور في 2023
    "…Contributions have covered the spectrum of better algorithms, richer comparison metrics, and movement towards online analysis for process data. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
  14. 14
  15. 15
  16. 16
  17. 17

    The maximum common subgraph problem حسب Abu-Khzam, Faisal N.

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