Search Results - (( java implementation path algorithm ) OR ( using simple graph algorithm ))

Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

    Published 2006
    “…Many graph algorithms are organized as simple elaborations of basic graph searching algorithms. …”
    Get full text
    Get full text
    Article
  3. 3

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
    Get full text
    Get full text
    Thesis
  4. 4

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

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Retrieval Of Environmental Parameters Over Water Areas Using MODIS Data by Amin, Abd Rahman Mat

    Published 2012
    “…The presences of cirrus cloud have been detected utilizing gradient technique algorithm. The algorithm is based on the gradient connecting the 1.38 and 1.24 μm lines of the log– log graph of apparent reflectance against the MODIS wavelength. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Image matching using relational graph representation by Lai, Chui Yen

    Published 2005
    “…Hence, image matching is transformed as a relational graph matching problem in this study. Experiments are carried out to evaluate the applicability of incorporating structural information into the image matching algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Evaluation of Visual Network Algorithms on Historical Documents by Khairunnisa, Binti Ibrahim

    Published 2020
    “…The framework has been used to evaluate three graph layout and three graph clustering algorithms on the historical SAGA dataset. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

    Published 2009
    “…In Comparison to other text outlier detection method, this approach managed to capture the semantics of documents through the use of CGs and is convenient to detect outliers through a simple dissimilarity function.Furthermore, our proposed algorithm retains a linear complexity with the increasing number of CGs.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob by Yaacob, Siti Hajar

    Published 2014
    “…The main purpose of this research to test whether Genetic Algorithm can use to predict future sales and be able generates the graph. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Graph-based conflict rectification using stroke gesture approach in timetabling system (CORECTS) by Yong, Tien Fui, Choo, Wou Onn, Chue, Wen Yeen, Kok, Hui Meian

    Published 2010
    “…CORECTS will apply a hybrid method using annealing graph algorithm and the proposed STAR-quadrants to display the conflict detection of the entire timetable.Simple stroke gesture is used to expedite the conflict resolution process. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    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 semantic similarity measure algorithm is used to compute the similitude strength between the Gene Ontology terms. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    MOSDA: A proposal for multiple objective spiral dynamics algorithm by A. R.A., Azwan, Ahmad Nor Kasruddin, Nasir, Sha'akmal, S., A.R.M., Sawal

    Published 2018
    “…It has a good elitism strategy and has a simple structure. A method called “archive method” that is used in multi-objective particle swarm optimization (MOPSO) is adopted into SDA to develop its multiobjective (MO) type algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

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

    Published 2000
    “…The algorithm employs a theory in graph, known as edge colouring of bipartite multigraph to produce the transmission schedule, which is free from collision due to the nature of the edge colouring. …”
    Get full text
    Get full text
    Thesis
  17. 17

    DISCRIMINATING SEDIMENT AND CLEAR WATER OVER CAOSTAL WATER USING GD TECHNIQUE by Mat Amin, Abd Rahman, Ahmad, Fadhli, Abdullah, Khiruddin

    Published 2017
    “…In this paper, a simple algorithm based on empirical technique to detect the sediment-influenced pixels over coastal waters is proposed as an alternative to these two algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    A multi-objective Spiral Dynamic algorithm and its application for PD design by Ahmad Nor Kasruddin, Nasir, Mohd Ashraf, Ahmad, A. R.A., Azwan, Mohd Falfazli, Mat Jusof

    Published 2017
    “…The proposed algorithm is tested with various benchmark functions used to test a newly developed MO algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Fractal dimension methods to determine optimum EEG electrode placement for concentration estimation by Siamaknejad, Hossein, Liew, Wei Shiung, Loo, Chu Kiong

    Published 2019
    “…These were then plotted in a graph, and a simple threshold was applied to best divide the indices of relaxation and concentration. …”
    Get full text
    Get full text
    Article
  20. 20