Search Results - (( parallel implementation best 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
    “…The efficient combination of simulated annealing algorithm with the best heuristic algorithms gave much better result in a very minimal time. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Parallel batch self-organizing map on graphics processing unit using CUDA by Daneshpajouh, H., Delisle, P., Boisson, J.-C., Krajecki, M., Zakaria, N.

    Published 2018
    “…The proposed implementation shown significant speedups of 11Ã� and 5Ã� compared to the sequential and parallel CPU implementations respectively. …”
    Get full text
    Get full text
    Article
  4. 4

    Parallel batch self-organizing map on graphics processing unit using CUDA by Daneshpajouh, H., Delisle, P., Boisson, J.-C., Krajecki, M., Zakaria, N.

    Published 2018
    “…The proposed implementation shown significant speedups of 11Ã� and 5Ã� compared to the sequential and parallel CPU implementations respectively. …”
    Get full text
    Get full text
    Article
  5. 5

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

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

    Accelerating DNA sequence alignment based on smith waterman algorithm using recursive variable expansion / Muhamad Faiz Ismail by Ismail, Muhamad Faiz

    Published 2014
    “…We show that our implementation yields a two times speedup at the cost of almost three times more area as compared to the conventional dataflow traditional array implementation.…”
    Get full text
    Get full text
    Thesis
  9. 9

    Design and analysis of high performance and low power matrix filling for DNA sequence allignment accelerator using ASIC design flow / Nurul Farhana Abd Razak by Abd Razak, Nurul Farhana

    Published 2010
    “…The objective of this paper is to improve the performance of the DNA sequence alignment and to optimize power reduction of the existing technique by using Smith Waterman (SW) algorithm. The scope of study is by using the matrix filling method which is in parallel implementation of the SmithWaterman algorithm. …”
    Get full text
    Get full text
    Student Project
  10. 10

    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM by Zain Ali, Noohul Basheer, Noras, James

    Published 2001
    “…An 8-bit parallel data-path gives the best performance, mapping into 4 independent 8-bit modules, with a throughput at least 4 times greater than with 32-bit hardware. …”
    Get full text
    Get full text
    Article
  11. 11

    Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm by Khoo, Thau Soon

    Published 2022
    “…Our algorithm uses non-fitness evolutionary distributed parallelized adaptive large neighbourhood search (NEDPALNS). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  12. 12

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

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

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion 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 other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  16. 16

    Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance. by Mohammad Alkhatib, Jaafar, Azmi, Md Said, Mohamad Rushdan, Ahmad Zukarnain, Zuriati

    Published 2012
    “…The best performance level was achieved when parallelizing Montgomery ECC computations to eight parallel multipliers (PM) using homogeneous coordinates. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance. by Alkhatib, Mohammad, Jaafar, Azmi, Md Said, Mohamad Rushdan, Ahmad Zulkarnain, Zuriati

    Published 2013
    “…The best performance level was achieved when parallelizing Montgomery ECC computations to eight parallel multipliers (PM) using homogeneous coordinates. …”
    Get full text
    Get full text
    Book Section
  18. 18

    BinDCT Design and Implementation on FPGA with Low Power Architecture by Jabbar, Mohamad Hairol

    Published 2008
    “…Its performances in term of Peak Signal-to-Noise (PSNR), compression ratio and coding gain is proved to be best approximation to the DCT algorithm. In this work, the design and implementation of 8 x 8 block 2-D forward BinDCT algorithm on a Field Programmable Gate Array (FPGA) is presented. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Customised fitness function of evolutionary algorithm for optimization of car park space / Ahmad Syahir Ab. Aziz by Ab. Aziz, Ahmad Syahir

    Published 2017
    “…Therefore, framework development methodology is used to make sure the system successful and can be developed according to the schedule. Genetic algorithm is chosen for the development of the prototype to prove that genetic algorithm is the best technique to implement for optimization. …”
    Get full text
    Get full text
    Thesis