Showing 1 - 8 results of 8 for search '(((( elemental per algorithm ) OR ( complement best algorithm ))) OR ( self scheduling algorithm ))', query time: 0.07s Refine Results
  1. 1

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

    Published 2007
    “…This paper presents an efficient method for concurrent built-in self-test synthesis and test scheduling in high-level synthesis. …”
    Get full text
    Get full text
    Get full text
    article
  2. 2

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

    Correlation Clustering with Overlaps by Fakhereldine, Amin

    Published 2020
    “…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  4. 4
  5. 5

    On the complexity of multi-parameterized cluster editing by Abu-Khzam, Faisal

    Published 2017
    “…In other words, Cluster Editing can be solved efficiently when the number of false positives/negatives per single data element is expected to be small compared to the minimum cluster size. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  6. 6
  7. 7

    Multidimensional Gains for Stochastic Approximation by Saab, Samer S.

    Published 2019
    “…The proposed algorithms here aim for per-iteration minimization of the mean square estimate error. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  8. 8

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

    Published 2017
    “…As such, it is exact and it preserves the generality of the solution scheme while reducing the size of its corresponding model and, consequently, the associated computational overhead. The technique is complemented with a splitting algorithm to alleviate the hurdle of solving an arising semidense matrix system. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article