Search Results - parallel using ((graph algorithm) OR (path algorithm))*

Search alternatives:

Refine Results
  1. 1
    Scalable workflow scheduling algorithm for minimizing makespan and failure probability

    Scalable workflow scheduling algorithm for minimizing makespan and failure probability by Abdul Aziz, Maslina, Ninggal, Izuan Hafez

    Published 2019
    “…A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    High-Speed shortest path co-processor design

    High-Speed shortest path co-processor design by Idris, Mohd Yamani Idna, Abu Bakar, Suraya, Tamil, Emran Mohd, Razak, Zaidi, Noor, Noorzaily Mohamed

    Published 2009
    “…Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    A test case generation framework based on UML statechart diagram

    A test case generation framework based on UML statechart diagram by Salman, Yasir Dawood

    Published 2018
    “…They are relation table, relation graph, consistency checking, test path minimization, test path prioritization, path pruning, test path generation, and test case generation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…The graph theory is used to model the network of the system and to determine the reenergizing path. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Quantitative and qualitative analysis of unmanned aerial vehicle's path planning using master-slave parallel vector-evaluated genetic algorithm

    Quantitative and qualitative analysis of unmanned aerial vehicle's path planning using master-slave parallel vector-evaluated genetic algorithm

    Published 2012
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  6. 6
    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Unconstraint assignment problem : a molecular computing approach

    Unconstraint assignment problem : a molecular computing approach by Zuwairie, Ibrahim, Yusei, Tsuboi, Osamu, Ono, Marzuki, Khalid

    Published 2006
    “…Since DNA computing is very suitable for combinatorial problems, in thispaper, an idea on DNA-based computing algorithm for solving unconstraint assignment problem is proposed. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks

    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

    Published 2016
    “…The results of this research are important in developing a routing algorithm for CHR6o3.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Tool path generation of contour parallel based on ant colony optimisation

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

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Development of an automatics parallel parking system for nonholonomic mobile robot

    Development of an automatics parallel parking system for nonholonomic mobile robot by Mohd Fairuz , Abdollah, Syed Najib , Syed Salim, Irma Wani , Jamaludin, Muhammad Nizam , Kamarudin

    Published 2011
    “…A PIC32MX360F512L microcontroller is used in order to generate the algorithm and control the movement of the mobile robot. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Effect of contour interval on minimization of tool path length in pocket milling process

    Effect of contour interval on minimization of tool path length in pocket milling process by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidaqh

    Published 2020
    “…Decreasing machining time in process of milling using contour parallel direction as a strategy of machining can be achieved by increasing the value of tool path interval. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences

    A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences by M. Othman, Razib, Deris, Safaai, Md. IIlias, Rosli

    Published 2008
    “…The genetic similarity algorithm combines semantic similarity measure algorithm with parallel genetic algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Random sampling method of large-scale graph data classification

    Random sampling method of large-scale graph data classification by Rashed Mustafa, Mohammad Sultan Mahmud, Mahir Shadid

    Published 2024
    “…Since the data blocks in this model are much smaller than the entire data set, it is more efficient to analyze them on a standalone small machine, and multiple data blocks can be analyzed on multiple nodes of the cluster in parallel. Finally, we classified the graphs of data blocks using the SVM algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Graphical user interface for surface roughness prediction of CNC milling machine / Muhammad Qayyum Nor Asffan

    Graphical user interface for surface roughness prediction of CNC milling machine / Muhammad Qayyum Nor Asffan by Nor Asffan, Muhammad Qayyum

    Published 2020
    “…On top of that, the types of cutting path chosen to be studied were parallel, morph spiral and true spiral. 10 runs of experiments with different machining parameters for each cutting path were analysed throughout this research. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  15. 15
    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM

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

    Published 2001
    “…BLOWFISH is a fast cryptographic software algorithm, using the operations of addition, XOR and look-up tables. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Partitioning techniques and their parallelization for stiff system of ordinary differential equations

    Partitioning techniques and their parallelization for stiff system of ordinary differential equations by Othman, Khairil Iskandar

    Published 2007
    “…The graphs of its performance and execution time, visualize the advantages of parallelizing.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Agarwood oil grade clustering of aquilaria malaccensis species using Extraction by GC-MS analysis: Efficient KNN algorithm based on patterns visualization of two-dimensional graph

    Agarwood oil grade clustering of aquilaria malaccensis species using Extraction by GC-MS analysis: Efficient KNN algorithm based on patterns visualization of two-dimensional graph by Siti Mariatul Hazwa, Mohd Huzir, Anis Hazirah ‘Izzati H., Al-Hadi, Amir Hussairi, Zaidi, Nurlaila F., Ismail, Zakiah, Mohd Yusoff, Saiful Nizam, Tajuddin, Mohd Nasir, Taib

    Published 2024
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Generic DNA encoding design scheme to solve combinatorial problems

    Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

    Published 2015
    “…This approach was applied successfully to solve four hard combinatorial problems. Using this encoding scheme would enable researchers to solve other hard problems whilst also improving the algorithm.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    A Fast Scheduling Algorithm for WDM Optical Networks

    A Fast Scheduling Algorithm for WDM Optical Networks by Cheah, Cheng Lai

    Published 2000
    “…This time complexity can be improved to O(log3 N) by parallel processing using O(M) processors. Two variations of implementation of the scheduling algorithm have been proposed, namely the Variable Frame Size (VFS) and Limited Frame Size (LFS) schemes. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    DNA Computing Technique to Solve Vertex Coloring Problem

    DNA Computing Technique to Solve Vertex Coloring Problem by Hasudungan, Rofilde, Rohani, Abu Bakar

    Published 2013
    “…In this paper we proposed DNA based computer to solve vertex coloring problem where in this paper we proposed DNA encoding and computational procedure inspired by greedy algorithm to generate all possible solutions to coloring a graph.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: