Showing 1 - 20 results of 149 for search '(( present each algorithm ) OR ((( element data algorithm ) OR ( neural coding algorithm ))))', query time: 0.13s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6

    Bird’s Eye View feature selection for high-dimensional data by Samir Brahim Belhaouari (16855434)

    Published 2023
    “…This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. …”
  7. 7
  8. 8

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

    Automatic image quality evaluation in digital radiography using for‐processing and for‐presentation images by Ioannis A. Tsalafoutas (14776939)

    Published 2024
    “…Images with various exposure parameters were acquired with a digital radiography unit, which for each acquisition produces two images: one for‐processing (raw) and one for‐presentation (clinical). …”
  12. 12

    Improvement Algorithm for Limited Space Scheduling by Zouein, Pierrette

    Published 2001
    “…An example illustrates the presented algorithm that generates a feasible space schedule.…”
    Get full text
    Get full text
    article
  13. 13

    A discrete-time learning control algorithm by Saab, Samer S.

    Published 1994
    “…Necessary and sufficient conditions for uniform convergence of the proposed learning algorithm is presented. Then, the author proves that the same condition is sufficient for the global robustness of the proposed learning algorithm to state disturbances, measurement noise at the output and reinitialization error are present at each iteration.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  14. 14

    Learning control algorithms for tracking "slowly" varying trajectories by Saab, Samer S.

    Published 1997
    “…For applications where the desired outputs are assumed to change "slowly", we present a D-type, PD-type, and PID-type learning algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  15. 15

    An exact algorithm for connected red–blue dominating set by Abu-Khzam, Faisal N.

    Published 2011
    “…Combining exhaustive enumeration when |B| is small with the Weighted Steiner Tree approach when |B| is large, solves the problem in O⁎(n1.4143). In this paper we present a first non-trivial exact algorithm whose running time is in O⁎(n1.3645). …”
    Get full text
    Get full text
    Get full text
    article
  16. 16

    A simulated annealing algorithm for the capacitated vehicle routing problem by Azar, Danielle

    Published 2017
    “…The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a fleet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  17. 17

    A simulated annealing algorithm for the capacitated vehicle routing problem by Azar, Danielle

    Published 2011
    “…The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a eet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  18. 18

    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

    Published 2002
    “…This paper presents a parallel algorithm to solve the Clique Partitioning Problem, an NP-complete problem. …”
    Get full text
    Get full text
    article
  19. 19
  20. 20

    Concurrent BIST Synthesis and Test Scheduling Using Genetic Algorithms by Harmanani, H. M.

    Published 2007
    “…The method is based on a genetic algorithm that efficiently explores the testable design space and finds a sub-optimal test registers assignment for each k-test session. …”
    Get full text
    Get full text
    Get full text
    article