يعرض 161 - 180 نتائج من 591 نتيجة بحث عن '(( elements method algorithm ) OR ((( data models algorithm ) OR ( solved based algorithm ))))', وقت الاستعلام: 0.13s تنقيح النتائج
  1. 161

    A method for data path synthesis using neural networks حسب Harmanani, H.

    منشور في 2017
    "…Presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  2. 162

    Integration of Artificial Intelligence in E-Procurement of the Hospitality Industry: A Case Study in the UAE حسب Mathew, Elezabeth

    منشور في 2020
    "…The data analytics maturity model is used as the conceptual model for evaluating both data analytics and data governance in this research. …"
    احصل على النص الكامل
  3. 163

    A Simulated Annealing Algorithm For Fuzzy Unit Commitment Problem حسب Mantawy, A. H.

    منشور في 2020
    "…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …"
    احصل على النص الكامل
    article
  4. 164

    A simulated annealing algorithm for fuzzy unit commitment problem حسب Mantawy, A.H.

    منشور في 1999
    "…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  5. 165

    A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units حسب El-Amin, I.

    منشور في 2020
    "…A new heuristic algorithm based on the Tabu search has been proposed for the maintenance schedule (MS) of electric generation units. …"
    احصل على النص الكامل
    article
  6. 166

    A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units حسب Duffuaa, S. O.

    منشور في 2020
    "…A new heuristic algorithm based on the Tabu search has been proposed for the maintenance schedule (MS) of electric generation units. …"
    احصل على النص الكامل
    article
  7. 167
  8. 168

    Multiclass feature selection with metaheuristic optimization algorithms: a review حسب Abu Zitar, Raed

    منشور في 2022
    "…Nevertheless, metaheuristic algorithms attract substantial attention to solving different problems in optimization. …"
    احصل على النص الكامل
  9. 169

    Indexing Arabic texts using association rule data mining حسب Haraty, Ramzi A.

    منشور في 2019
    "…Purpose The purpose of this paper is to propose a new model to enhance auto-indexing Arabic texts. The model denotes extracting new relevant words by relating those chosen by previous classical methods to new words using data mining rules. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  10. 170

    A Survey of cuckoo search algorithm: optimizer and new applications حسب Abualigah, Laith

    منشور في 2024
    "…Cuckoo search (CS) is an efficient swarm intelligence-based algorithm that has come a long way since its start in 2009. …"
    احصل على النص الكامل
  11. 171

    A simulated annealing algorithm for the capacitated vehicle routing problem حسب Azar, Danielle

    منشور في 2017
    "…In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combination of random and deterministic operators that are based on problem knowledge information. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  12. 172

    A simulated annealing algorithm for the capacitated vehicle routing problem حسب Azar, Danielle

    منشور في 2011
    "…In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combination of random and deterministic operators that are based on problem knowledge information. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  13. 173
  14. 174

    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem حسب Harmanani, Haidar M.

    منشور في 2002
    "…This paper presents a parallel algorithm to solve the Clique Partitioning Problem, an NP-complete problem. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  15. 175

    Parameter Estimation Of Wiener-Hammerstein Models Via Genetic Algorithms حسب Emara-Shabaik, Husam

    منشور في 2020
    "…In this paper, a modified genetic algorithm is used as a procedure to solve the parameter identification problem of the nonlinear Wiener-Hammerstein models. …"
    احصل على النص الكامل
    article
  16. 176
  17. 177

    Optimal VAR Dispatch Using a Multiobjective Evolutionary Algorithm حسب Abido, M. A.

    منشور في 2005
    "…A new Strength Pareto Evolutionary Algorithm based approach is proposed to handle the problem as a true multiobjective optimization problem with competing and non-commensurable objectives. …"
    احصل على النص الكامل
    article
  18. 178

    Environmental/economic power dispatch using multiobjective evolutionary algorithms حسب Abido, M.A.

    منشور في 2003
    "…A new strength Pareto evolutionary algorithm (SPEA) based approach is proposed to handle the EED as a true multiobjective optimization problem with competing and noncommensurable objectives. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  19. 179

    Data mining approach to predict student's selection of program majors حسب SIDDARTHA, SHARMILA

    منشور في 2019
    "…The approach includes a methodology to manage data mining projects, sampling techniques to handle imbalanced data and multiclass data, a set of classification algorithms to predict and measures to evaluate performance of models. …"
    احصل على النص الكامل
  20. 180

    A fast exact sequential algorithm for the partial digest problem حسب Mostafa M. Abbas (17058093)

    منشور في 2016
    "…The percentage of improvement is more than 75% over the best known practical algorithm for the worst case. For large numbers of inputs, our algorithm is able to solve the problem in a suitable time, while the best known practical algorithm is unable.…"