Showing 1 - 20 results of 21 for search '(( elements per algorithm ) OR ((( oriented taking algorithm ) OR ( neural coding algorithm ))))', query time: 0.12s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    An ant colony optimization algorithm to improve software quality prediction models by Azar, D.

    Published 2011
    “…We use an ant colony optimization algorithm in the adaptation process. The approach is validated on stability of classes in object-oriented software systems and can easily be used for any other software quality characteristic. …”
    Get full text
    Get full text
    Get full text
    article
  9. 9

    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
  10. 10
  11. 11
  12. 12

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

    Common weaving approach in mainstream languages for software security hardening by Alhadidi, Dima

    Published 2013
    “…In the first approach, we prove them according to the rules and algorithms provided in this paper. In the second approach, we accommodate Kniesel's discipline that ensures that security solutions specified by our approach are applied at all and only the required points in source code, taking into consideration weaving interactions and interferences. …”
    Get full text
    Get full text
    Get full text
    article
  14. 14

    Mapping realistic data sets on parallel computers by Mansour, N.

    Published 1993
    “…The authors propose reducing the problem size by a mapping-oriented graph contraction technique. They present a graph contraction (GC) heuristic algorithm that yields a smaller representation of the problem, to which mapping is then applied. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  15. 15
  16. 16

    Graph Contraction for Mapping Data on Parallel Computers by Mansour, N.

    Published 1994
    “…Then we present a mapping-oriented parallel graph contraction (PGC) heuristic algorithm that yields a smaller representation of the problem to which mapping is then applied. …”
    Get full text
    Get full text
    Get full text
    article
  17. 17

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

    Graph contraction for physical optimization methods by Mansour, Nashat

    Published 1993
    “…Then we present a mapping-oriented Parallel Graph Contraction (PGC) heuristic algorithm that yields a smaller representation of the problem to which mapping is then applied. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  19. 19
  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. …”