Search alternatives:
method algorithm » mould algorithm (Expand Search)
data scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
Showing 1 - 20 results of 421 for search '(( elements method algorithm ) OR ((( net present algorithm ) OR ( data scheduling algorithm ))))', query time: 0.14s Refine Results
  1. 1
  2. 2

    Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing by Al Sadawi, Alia

    Published 2016
    “…A Master of Science thesis in Engineering Systems Management by Alia Al Sadawi entitled, "Efficient Dynamic Cost Scheduling Algorithm for Data Batch Process," submitted in May 2016. …”
    Get full text
    doctoralThesis
  3. 3

    Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain by Al Sadawi, Alia

    Published 2021
    “…An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …”
    Get full text
    article
  4. 4
  5. 5

    Stochastic Search Algorithms for Exam Scheduling by Mansour, Nashat

    Published 2007
    “…Then, we empirically compare the three proposed algorithms and FESP using realistic data. Our experimental results show that SA and GA produce good exam schedules that are better than those of FESP heuristic procedure. …”
    Get full text
    Get full text
    article
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    Three-phase simulated annealing algorithms for exam scheduling by Mansour, Nashat

    Published 2003
    “…We empirically compare 3PSA with a 4-phase clustering-based heuristic algorithm using realistic data. Our experimental results show that 3PSA produces good exam schedules, which are better than those of the clustering heuristic procedure.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  11. 11

    Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

    Published 1998
    “…It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm with its two major components: the convex-elastic net (CEN) algorithm and the nondeterministic iterative improvement (NII) algorithm. …”
    Get full text
    Get full text
    article
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17

    A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

    Published 2010
    “…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …”
    Get full text
    Get full text
    Get full text
    article
  18. 18
  19. 19
  20. 20