Showing 1 - 20 results of 49 for search '(((( element density algorithm ) OR ( complement _ algorithms ))) OR ( level coding algorithm ))', query time: 0.12s Refine Results
  1. 1

    Monitoring Bone Density Using Microwave Tomography of Human Legs: A Numerical Feasibility Study by Alkhodari, Mohanad Ahmed

    Published 2021
    “…This study was performed using an in-house finite-element method contrast source inversion algorithm (FEM-CSI). …”
    Get full text
    article
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6

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

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

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

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

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

    Corona power loss computation in bundled bipolar conductors by Al-Hamouz, Z.M.

    Published 2000
    “…In this paper, a finite element (FE) based algorithm devoted for the computation of the corona current and hence the corona power loss associated with bundled bipolar high voltage direct current (HVDC) conductors is presented. …”
    Get full text
    Get full text
    article
  16. 16

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

    Assessment of static pile design methods and non-linear analysis of pile driving by Abou-Jaoude, Grace G.

    Published 2006
    “…The pile/soil interaction system is described by a mass/spring/dashpot system where the properties of each component are derived from rigorous analytical solutions or finite element analysis. The outcome of this research is an algorithm that can be used to predict pile displacement and driving stresses. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  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
  20. 20

    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