Search Results - (( simulation computer window algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3
  4. 4
  5. 5

    Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

    Published 2014
    “…Hence, the numerical simulations take unacceptably more execution time on sequential computers to run the simulation packages. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7
  8. 8

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  10. 10

    Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

    Published 2019
    “…Second, an Optimized time sliding window packet marker (OTSWTCM) algorithm. This algorithm depends on the adaptability of the concept in the ITSWTCM, I2TSWTCM and M2I2TSWTCM algorithms for affecting the fairness and multiple protocols. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  14. 14

    On-chip communication system modeling approach for reability analysis focusing on functional failures by Forooshani, Arash Abtahi

    Published 2012
    “…Two algorithms are proposed to control the crosstalk simulation error while minimizing the required computational cost.An adaptive modeling window sizing method, along with an upper bound on the sampling error were applied to guarantee a high order of precision in simulating the crosstalk noise for an RLC interconnect model. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Block Motion Estimation Using Directional Adaptive Search Window by Fadly Chew, Nor Farhana, Badruddin, Nasreen

    Published 2006
    “…This classification and the direction of the motion vectors, are used to dynamically adjust the search window size and general orientation. Simulation results show that execution time could be reduced by 42%-60% with a small degradation in PSNR value, to that of non-adaptive ME.…”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16
  17. 17
  18. 18
  19. 19

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  20. 20