Showing 1 - 20 results of 51 for search '(((( complement _ algorithms ) OR ( elements making algorithm ))) OR ( level coding algorithm ))', query time: 0.13s Refine Results
  1. 1
  2. 2
  3. 3

    A Data-Driven Decision-Making Framework for Fleet Management in the Government Sector of Dubai by ALGHANEM, HANI SUBHI MOHD

    Published 2024
    “…The proposed framework comprises key elements: Important Decisions derived from interviews with transportation leaders, Knowledge Management enhanced by AI algorithms, Data Mining/Analysis utilizing historical data, the Fleet Management System employing Oracle ERP, and a Data-Driven Decision Support Framework that leans towards the extended framework approach. …”
    Get full text
  4. 4

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

    Published 2024
    “…Different techniques can achieve code completion, and recent research has focused on Deep Learning methods, particularly Large Language Models (LLMs) utilizing Transformer algorithms. …”
  5. 5

    Adaptive bias simulated evolution algorithm for placement by Youssef, H.

    Published 2001
    “…In this work, we propose an adaptive bias scheme which adjusts automatically to the quality of solution and makes the algorithm independent of the problem class or instance, as well as any user defined value. …”
    Get full text
    Get full text
    article
  6. 6

    Synthesis of MVL Functions - Part I: The Genetic Algorithm Approach by Sarif, Bambang

    Published 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. …”
    Get full text
    Get full text
    article
  7. 7

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

    Published 2019
    “…Since, PWAM control algorithm is more complex than PSCPWM, FPGA based implementation for PWAM control is discussed. …”
  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

    Properties of Unique Degree Sequences of 3-Uniform Hypergraphs by Tarsissi, Lama

    Published 2021
    “…The existence of this hypergraph makes us conjecture an extended generating algorithm for the sequences of Deza et al. to include a much wider class of unique 3-uniform hypergraphs. …”
    Get full text
  11. 11

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

    Published 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%.…”
  12. 12
  13. 13
  14. 14

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

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

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

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