Showing 1 - 20 results of 134 for search '(( element _ algorithm ) OR ((( experiments when algorithm ) OR ( neural coding algorithm ))))', query time: 0.14s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

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

    Published 1993
    “…The authors report on the design of a digital feedback control system to provide null steering by controlling the array element positions automatically. The array comprises a signal processor, digital control algorithm (PID), stepper motors, shaft encoders, actuators and multiplexers. …”
    Get full text
    Get full text
    article
  9. 9

    Topics in graph algorithms by Abu-Khzam, Faisal Nabih

    Published 2003
    “…Coping with computational intractability has inspired the development of a variety of algorithmic techniques. The main challenge has usually been the design of polynomial time algorithms for NP-complete problems in a way that guarantees some, often worst-case, satisfactory performance when compared to exact (optimal) solutions. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  10. 10

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

    Published 2025
    Subjects: “…Nature-inspired optimization algorithms…”
  11. 11

    Nonlinear analysis of shell structures using image processing and machine learning by M.S. Nashed (16392961)

    Published 2023
    “…The proposed approach can be significantly more efficient than training a machine learning algorithm using the raw numerical data. To evaluate the proposed method, two different structures are assessed where the training data is created using nonlinear finite element analysis. …”
  12. 12
  13. 13
  14. 14
  15. 15

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

    Published 2001
    “…A new solution is evolved from current solution by relocating some of the solution elements. Elements with lower goodnesses have higher probabilities of getting selected for perturbation. …”
    Get full text
    Get full text
    article
  16. 16

    An improved kernelization algorithm for r-Set Packing by Abu-Khzam, Faisal N.

    Published 2010
    “…We present a reduction procedure that takes an arbitrary instance of the r -Set Packing problem and produces an equivalent instance whose number of elements is in O(kr−1), where k is the input parameter. …”
    Get full text
    Get full text
    Get full text
    article
  17. 17

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

    Published 2010
    “…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). …”
    Get full text
    Get full text
    Get full text
    article
  18. 18

    An exact and general model order reduction technique for the finite element solution of elastohydrodynamic lubrication problems by Habchi, W.

    Published 2017
    “…This work presents an exact and general model order reduction (MOR) technique for a fast finite element resolution of elastohydrodynamic lubrication (EHL) problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  19. 19

    A New Hamiltonian Semi-Analytical Approach to Vibration Analysis of Piezoelectric Multi-Layered Plates by Andrianarison, O.

    Published 2024
    “…Within the framework of this Hamiltonian formalism, the in-plane of the piezoelectric multilayered plate is discretized into two-dimensional p-type high-order spectral finite elements while the resulting first-order one dimensional differential system is solved analytically by enforcing the interface continuity constraints. …”
    Get full text
    article
  20. 20

    Timing driven genetic algorithm for standard-cell placement by Sait, Sadiq M.

    Published 1995
    “…In this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. At early generations, the search is biased toward solutions with superior timing characteristics. …”
    Get full text
    Get full text
    article