Search Results - (( basic optimization path algorithm ) OR ( using permutation parallel algorithm ))

Search alternatives:

Refine Results
  1. 1
    The division free parallel algorithm for finding determinant

    The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2013
    “…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    A new parallel model for starter sets generation via exchanging two elements

    A new parallel model for starter sets generation via exchanging two elements by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2019
    “…In this study, a technique of parallelization across the method was employed to develop new parallel algorithm for finding all permutations under exchanged restrictions. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network

    Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network by Othman, Mohamed, Abdullah, Monir, Johari, Rozita

    Published 2008
    “…In this paper, a new parallel algorithm of the window method is developed called the Balanced Parallel Window Method (BPWM) algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network

    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
    Save to List
    Saved in:
  6. 6
    Particle swarm optimization (PSO) for CNC route problem

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  7. 7
    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm

    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

    Published 2021
    “…To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm

    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah A., Parman S., Abbasi A., Solihin M.I., Manan T.S.A., Beddu S., Ahmad A., Rasdi N.W.

    Published 2023
    Article
    Save to List
    Saved in:
  9. 9
    New Sequential and Parallel Division Free Methods for Determinant of Matrices

    New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

    Published 2013
    “…The computation times in the newly developed sequential methods were dominated by generating starter sets. Therefore, two parallel strategies were developed to parallelise this algorithm so as to reduce the computation times. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…It makes use of three basic operations in order to optimize this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Path planning algorithm for a car like robot based on MILP method

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…This study shows that Basic Theta* is able to produce the true shortest path compared to A* which produced slightly longer path. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Genetic algorithm optimization for coefficient of FFT processor

    Genetic algorithm optimization for coefficient of FFT processor by Pang, Jia Hong, Sulaiman, Nasri

    Published 2010
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Robotic path planning using rapidly-exploring random trees

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    Published 2013
    “…However, the planned path by using basic RRT structure might not always be optimal in terms of path length. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network

    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

    Published 2007
    “…Under the constraint of avoiding crosstalk, the interests of these algorithms are to find a permutation that uses a minimum number of passes and minimum execution time. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Embedding Malaysian House Red Ant Behavior into an Ant Colony System

    Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2008
    “…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  18. 18
    Ant system with heuristics for capacitated vehicle routing problem

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…As a route improvement strategy, two heuristics which are the swap among routes procedure and 3-opt algorithm are also employed within the ASH algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…The proposed algorithm has been better than basic ABC in all tested problems with average of 0.570%.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network

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

    Published 2005
    “…In Zero algorithms, there are three types of algorithms namely; The Zero X, Zero Y and zeroXY algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: