Search alternatives:
component » components (Expand Search)
Showing 1 - 20 results of 161 for search '(((( component based algorithm ) OR ( elements _ algorithm ))) OR ( neural scheduling algorithm ))', query time: 0.12s Refine Results
  1. 1

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

    Published 2002
    “…The clique partitioning problem has important applications in many areas including VLSI design automation, scheduling, and resources allocation. In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
    Get full text
    Get full text
    article
  2. 2

    A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† by Harmanani, Haidar

    Published 2010
    “…The proposed algorithm has a time complexity of O(1) for a neural network with n vertices and k colours. …”
    Get full text
    Get full text
    Get full text
    article
  3. 3

    A pragmatic approach for testing robustness on real-time component based systems by Tarhini, Abbas

    Published 2005
    “…In this paper, we suggest a realistic methodology for testing robustness of real-time component-based systems (RTCBS). A RTCBS system is described as a collection of components where each component is specified by a nominal and a degraded specification, modeled as a timed input-output automaton (TIOA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  4. 4
  5. 5

    Improvement of Kernel Principal Component Analysis-Based Approach for Nonlinear Process Monitoring by Data Set Size Reduction Using Class Interval by Mohammed Tahar Habib Kaib (21633176)

    Published 2024
    “…Generally, RKPCA reduces the number of samples in the training data set and then builds the KPCA model based on this data set. In this paper, the proposed algorithm selects relevant observations from the original data set by utilizing a class interval technique (i.e. histogram) to maintain a bunch of representative samples from each bin. …”
  6. 6
  7. 7

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

    Published 2025
    Subjects: “…Nature-inspired optimization algorithms…”
  8. 8
  9. 9
  10. 10

    Deep Reinforcement Learning for Resource Constrained HLS Scheduling by Makhoul, Rim

    Published 2022
    “…The two main steps in HLS are: operations scheduling and data-path allocation. In this work, we present a resource constrained scheduling approach that minimizes latency and subject to resource constraints using a deep Q learning algorithm. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  11. 11
  12. 12

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

    Scalable Nonparametric Supervised Learning for Streaming and Massive Data: Applications in Healthcare Monitoring and Credit Risk by Mohamed Chaouch (17983846)

    Published 2025
    “…Additionally, an online classifier is developed for streaming data, combining online PCA with a kernel-based recursive classifier using a stochastic approximation algorithm. …”
  14. 14

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

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

    Published 2010
    “…Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel. …”
    Get full text
    Get full text
    Get full text
    article
  16. 16

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

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

    Fuzzy simulated evolution algorithm for topology design of campusnetworks by Youssef, H.

    Published 2000
    “…The two main phases of the algorithm, namely, evaluation and allocation, have been fuzzified. …”
    Get full text
    Get full text
    article
  20. 20

    Block constrained pressure residual preconditioning for two-phase flow in porous media by mixed hybrid finite elements by Stefano Nardean (14151900)

    Published 2023
    “…Therefore, we designed a dedicated two-stage strategy, inspired by the CPR algorithm, where a block preconditioner is used for the pressure part with the aim at exploiting the inner $$2\times 2$$ 2 × 2 structure. …”