Search Results - parallel computing ant algorithm*

  • Showing 1 - 13 results of 13
Refine Results
  1. 1

    A GPGPU Approach to Accelerate Ant Swarm Optimization Rough Reducts (ASORR) Algorithm by Udayanti, Erika Devi, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah, Nugroho, Fajar Agung

    Published 2012
    “…This paper proposed an parallel approach to accelerate the execution time of ASORR algorithm which is utilizing GPGPU that supports high speed parallel computing. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2
  3. 3

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…This paper presents the minimisation of machining time of computer numerical control (CNC) by eliminating the uncut region of sharp corner based on contour parallel milling method. …”
    Get full text
    Get full text
    Article
  4. 4
  5. 5

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

    Quantum Particle Swarm Optimization Technique for Load Balancing in Cloud Computing by Elrasheed Ismail, Sultan

    Published 2013
    “…The distributed Cloud Computing technology has been produced as the development of the computer network and distributed computing technology. …”
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11

    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

    Published 2005
    “…This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    A trade-off criterion for bi-objective problem in solving hybrid flow shop scheduling with energy efficient (EE-HFS) using multi-objective dragonfly algorithm (MODA) by Muhammad Ammar, Nik Mu’tasim, Mohd Fadzil Faisae, Ab Rashid

    Published 2024
    “…The (EE-HFS) optimization has been carried out using the Multi-Objective Dragonfly Algorithm (MODA). The optimization result was compared with well-established algorithms, the Pareto Envelope-based Selection Algorithm II (PESA2), Multi-Objective Evolutionary Algorithm Based on Decomposition (MOEA/D), and new algorithms, Multi-Objective Grasshopper Optimization Algorithm (MOGOA) and Multi-Objective Ant Lion Optimizer (MOALO). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item