Showing 121 - 140 results of 652 for search '(( element data algorithm ) OR ((( time using algorithm ) OR ( data mining algorithm ))))', query time: 0.12s Refine Results
  1. 121
  2. 122

    Genetic algorithms applications in load frequency control by Abdel-Magid, Y.L.

    Published 1995
    “…A digital simulation is used in conjunction with the genetic algorithm optimization process. …”
    Get full text
    Get full text
    article
  3. 123

    A New Parallel Genetic Algorithm Model by Al-Somani, Turki F.

    Published 2020
    “…The reduction of the implementation processing time is the basic motivation of genetic algorithms parallelization. …”
    Get full text
    article
  4. 124

    Empirical comparison of regression test selection algorithms by Mansour, Nashat

    Published 2001
    “…The empirical results show that the five algorithms can be used for different requirements of regression testing. …”
    Get full text
    Get full text
    Get full text
    article
  5. 125
  6. 126

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

    A novel approach for real time flows scheduling by Fawaz, W.

    Published 2006
    “…A plethora of packet-scheduling algorithms have been proposed in the literature in order to meet the stringent time constraints of real time flows at an IP router level. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  8. 128
  9. 129

    Algorithms for Pixelwise Shape Deformations Preserving Digital Convexity by Tarsissi, Lama

    Published 2022
    “…In this article, we propose algorithms for pixelwise deformations of digital convex sets preserving their convexity using the combinatorics on words to identify digital convex sets via their boundary words, namely Lyndon and Christoffel words. …”
    Get full text
  10. 130

    An Evolutionary Algorithm for the Allocation Problem in High-Level Synthesis by Harmanani, Haidar

    Published 2005
    “…The proposed method was implemented using C++ on a Linux workstation. We tested our method on a set of high-level synthesis benchmarks, all yielding good solutions in a short time. …”
    Get full text
    Get full text
    Get full text
    article
  11. 131

    Algorithmic Study of Online Multi-Facility Location Problems by Markarian, Christine

    Published 2022
    “…We propose the first online algorithms for these variants and measure their performance using the standard notion of competitive analysis. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  12. 132

    A neural networks algorithm for data path synthesis by Harmanani, Haidar M.

    Published 2003
    “…The algorithm has a running time complexity of O(1) for a circuit with n operations and c shared resources. …”
    Get full text
    Get full text
    Get full text
    article
  13. 133

    Optimizing Document Classification: Unleashing the Power of Genetic Algorithms by Ghulam Mustafa (458105)

    Published 2023
    “…Additionally, our proposed model optimizes the features using a genetic algorithm. Optimal feature selection performances a crucial role in this domain, enhancing the overall accuracy of the document classification system while reducing the time complexity associated with selecting the most relevant features from this large-dimensional space. …”
  14. 134
  15. 135

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

    Published 2011
    “…In this paper we present a first non-trivial exact algorithm whose running time is in O⁎(n1.3645). We use our algorithm to solve the Connected Dominating Set problem in O⁎(n1.8619). …”
    Get full text
    Get full text
    Get full text
    article
  16. 136
  17. 137
  18. 138

    A FAMILY OF NORMALIZED LEAST MEAN FOURTH ALGORITHMS by Zerguine, Azzedine

    Published 2020
    “…The first proposed algorithm uses a simple normalization of the regressor and is called simply the NLMF. …”
    Get full text
    article
  19. 139
  20. 140

    Data reductions and combinatorial bounds for improved approximation algorithms by Abu-Khzam, Faisal N.

    Published 2016
    “…We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximation-preserving reductions, akin to the notion of parameterized reductions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article