يعرض 1 - 20 نتائج من 47 نتيجة بحث عن '(((( elements per algorithm ) OR ( complement _ algorithms ))) OR ( level coding algorithm ))', وقت الاستعلام: 0.11s تنقيح النتائج
  1. 1
  2. 2
  3. 3

    Large language models for code completion: A systematic literature review حسب Rasha Ahmad Husein (19744756)

    منشور في 2024
    "…Different techniques can achieve code completion, and recent research has focused on Deep Learning methods, particularly Large Language Models (LLMs) utilizing Transformer algorithms. …"
  4. 4

    Synthesis of MVL Functions - Part I: The Genetic Algorithm Approach حسب Sarif, Bambang

    منشور في 2006
    "…Multiple-Valued Logic (MVL) has been used in the design of a number of logic systems, including memory, multi-level data communication coding, and a number of special purpose digital processors. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  5. 5

    Optimized FPGA Implementation of PWAM-Based Control of Three—Phase Nine—Level Quasi Impedance Source Inverter حسب Syed Rahman (569240)

    منشور في 2019
    "…Since, PWAM control algorithm is more complex than PSCPWM, FPGA based implementation for PWAM control is discussed. …"
  6. 6

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

    Sensitivity analysis and genetic algorithm-based shear capacity model for basalt FRC one-way slabs reinforced with BFRP bars حسب Abathar Al-Hamrani (16494884)

    منشور في 2023
    "…Finally, a design equation that can predict the shear capacity of one-way BFRC-BFRP slabs was proposed based on genetic algorithm. The proposed model showed the best prediction accuracy compared to the available design codes and guidelines with a mean of predicted to experimental shear capacities (V<sub>pred</sub>/V<sub>exp</sub>) ratio of 0.97 and a coefficient of variation of 17.91%.…"
  9. 9
  10. 10

    Correlation Clustering with Overlaps حسب Fakhereldine, Amin

    منشور في 2020
    "…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  11. 11

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

    منشور في 2022
    "…These requirements have motivated the emergence of fog and edge computing to complement the low-privacy and high-latency cloud. The intention behind Fog computing is to place computational servers closer to the user, typically within the city’s vicinity, to reduce latency. …"
  12. 12
  13. 13
  14. 14

    A novel technique for fast multiplication حسب Sait, Sadiq M.

    منشور في 1995
    "…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  15. 15

    On the complexity of multi-parameterized cluster editing حسب Abu-Khzam, Faisal

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

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

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