Showing 1 - 20 results of 24 for search '(((( elements over algorithm ) OR ( complement search algorithm ))) OR ( neural coding algorithm ))', query time: 0.12s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    On the Optimization of Band Gaps in Periodic Waveguides by Jamil Renno (14070771)

    Published 2025
    “…<h3 dir="ltr">Purpose</h3><p dir="ltr">This work applies a computational framework for vibration attenuation in periodic structures by combining the established wave and finite element (WFE) method with nature-inspired optimization algorithms. …”
  6. 6
  7. 7

    Design of adaptive arrays based on element position perturbations by Dawoud, M.M.

    Published 1993
    “…The main advantage of using this technique over the other commonly used methods is that the amplitudes and phases of the array elements can be used mainly to steer the main beam towards the desired signal. …”
    Get full text
    Get full text
    article
  8. 8
  9. 9
  10. 10

    A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

    Published 2010
    “…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …”
    Get full text
    Get full text
    Get full text
    article
  11. 11
  12. 12

    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
  13. 13
  14. 14
  15. 15

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

    A survey and comparison of wormhole routing techniques in a meshnetworks by Al-Tawil, K.M.

    Published 1997
    “…Although an extremely wide number of routing algorithms have been proposed and implemented in hardware and software, it is difficult for the designer of a multicomputer to choose the best routing algorithm given a particular architectural configuration. …”
    Get full text
    Get full text
    article
  18. 18
  19. 19

    Analysis of Multi-User-Based UAV System With Outdated CSI by Parvez Shaik (21633041)

    Published 2024
    “…Optimization of UAV location and altitude is performed through a limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) algorithm to attain minimum OP (MOP). Results illustrate optimal performance dependent on the channel correlation parameters, antenna elements, and fading conditions. …”
  20. 20

    Oversampling techniques for imbalanced data in regression by Samir Brahim Belhaouari (9427347)

    Published 2024
    “…For tabular data, we also present the Auto-Inflater neural network, utilizing an exponential loss function for Autoencoders. …”