يعرض 1 - 20 نتائج من 623 نتيجة بحث عن '(((( case scheduling algorithm ) OR ( problem using algorithm ))) OR ( relevant data algorithm ))', وقت الاستعلام: 0.12s تنقيح النتائج
  1. 1

    Power-constrained system-on-a-chip test scheduling using a genetic algorithm حسب Harmanani, Haidar M.

    منشور في 2006
    "…This paper presents an efficient approach for the test scheduling problem of core-based systems based on a genetic algorithm. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  2. 2
  3. 3
  4. 4

    An efficient method for the open-shop scheduling problem using simulated annealing حسب Harmanani, Haidar M.

    منشور في 2016
    "…This paper presents a simulated annealing algorithm in order to solve the nonpreemptive open-shop scheduling problem with the objective of minimizing the makespan. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  5. 5
  6. 6

    A method for the minimum coloring problem using genetic algorithms حسب Harmanani, Haidar

    منشور في 2006
    "…This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  7. 7

    Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment حسب Sachi Gupta (19560268)

    منشور في 2022
    "…Our findings also suggest that enhanced versions of the HEFT algorithm perform better than the basic HEFT method in terms of lesser schedule length of the workflow problems running on various virtual machines.…"
  8. 8

    A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† حسب Harmanani, Haidar

    منشور في 2010
    "…This paper presents a hardware implementation to solve the graph colouring problem (chromatic number χ(G)) for arbitrary graphs using the Hopfield neural network (HNN) model of computation. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  9. 9

    Incremental Genetic Algorithm حسب Mansour, Nashat

    منشور في 2006
    "…If these problems are not small in size, it becomes costly to use a genetic algorithm to reoptimize them after each modification. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  10. 10
  11. 11
  12. 12
  13. 13

    A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM حسب Selim, S.Z.

    منشور في 2020
    "…The global minimum solution of the problem is found using a simulated annealing-based algorithm. …"
    احصل على النص الكامل
    article
  14. 14

    Scalable parallel algorithms for difficult combinatorial problems حسب Abu-Khzam, Faisal N.

    منشور في 2004
    "…These complementary tools and technologies are used to launch systematic attacks on combinatorial problems of significance. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  15. 15

    A Non-convex Economic Load Dispatch Using Hybrid Salp Swarm Algorithm حسب Abu Zitar, Raed

    منشور في 2021
    "…In this paper, the economic load dispatch (ELD) problem with valve point effect is tackled using a hybridization between salp swarm algorithm (SSA) as a population-based algorithm and β-hill climbing optimizer as a single point-based algorithm. …"
    احصل على النص الكامل
  16. 16
  17. 17

    A GRASP Approach for Solving Large-Scale Electric Bus Scheduling Problems حسب Raka Jovanovic (17947838)

    منشور في 2021
    "…The GRASP algorithm is used for case studies on several public transport systems having various properties and sizes. …"
  18. 18

    Portfolio Selection Problem Using CVaR Risk Measures Equipped with DEA, PSO, and ICA Algorithms حسب Abdelouahed Hamdi (14158899)

    منشور في 2022
    "…Since the search space is vast in actual markets and there are limitations such as the number of assets and their weight, the optimization problem becomes difficult. Evolutionary algorithms are a powerful tool to deal with these difficulties. …"
  19. 19

    An Evolutionary Algorithm for the Allocation Problem in High-Level Synthesis حسب Harmanani, Haidar

    منشور في 2005
    "…This paper presents an evolutionary algorithm to solve the datapath allocation problem in high-level synthesis. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  20. 20

    Algorithmic Study of Online Multi-Facility Location Problems حسب Markarian, Christine

    منشور في 2022
    "…This is known as the Multi-Facility Location problem (MFL) and has been studied in the offline setting, in which the entire input sequence is given to the algorithm at once. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article