Search Results - (( java implementation path algorithm ) OR ( pattern execution a algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    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
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    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
    Save to List
    Saved in:
  4. 4
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    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
    Save to List
    Saved in:
  5. 5
    Parallel implementation on improved error signal of backpropagation algorithm

    Parallel implementation on improved error signal of backpropagation algorithm by Mohd Aris, Teh Noranis

    Published 2001
    “…Twenty-six patterns consisting of uppercase letters from 'A' to 'Z' are tested in the experiments. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Performance of IF-Postdiffset and R-Eclat Variants in Large Dataset

    Performance of IF-Postdiffset and R-Eclat Variants in Large Dataset by Julaily Aida, Jusoh, Wan Aezwani, Wan Abu Bakar, Mustafa, Man

    Published 2018
    “…The R-Eclat is a novel algorithm that determines infrequent patterns in the transaction database. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    A frequent pattern mining algorithm based on FP-growth without generating tree

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

    Published 2010
    “…For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    A frequent pattern mining algorithm based on FP-growth without generating tree

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohid, Hossein, Ibrahim, Hamidah

    Published 2010
    “…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    VLSI Design of a neurohardware processor implementing the Kohonen Neural Network algorithm

    VLSI Design of a neurohardware processor implementing the Kohonen Neural Network algorithm by Rajah, Avinash

    Published 2005
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun

    Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun by Harun, Hazaruddin

    Published 2015
    “…Motif Discovery (MD) is the process of identifying meaningful patterns in DNA, RNA, or protein sequences. In the field of bioinformatics, a pattern is also known as a motif. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Using unique-prime-factorization theorem to mine frequent patterns without generating tree

    Using unique-prime-factorization theorem to mine frequent patterns without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

    Published 2011
    “…Problem statement: Ffrequent patterns are patterns that appear in a data set frequently. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Ant colony algorithm for text classification in multicore-multithread environment / Ahmad Nazmi Fadzal

    Ant colony algorithm for text classification in multicore-multithread environment / Ahmad Nazmi Fadzal by Fadzal, Ahmad Nazmi

    Published 2017
    “…ACO classification accuracy is compared to Genetic Algorithm classifier which also a wrapper method. On integration of the technique, ACO is proposed to work in a multicore-multithread environment to gain additional execution time advantage. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Artificial immune system based on real valued negative selection algorithms for anomaly detection

    Artificial immune system based on real valued negative selection algorithms for anomaly detection by Khairi, Rihab Salah

    Published 2015
    “…With respect to all the algorithms, V-Detector proved to be superior and surpassed all other algorithms based on performance and execution time.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Grid-Based Classifier as a Replacement for Multiclass Classifier in a Supervised Non-Parametric Approach

    Grid-Based Classifier as a Replacement for Multiclass Classifier in a Supervised Non-Parametric Approach by Moheb Pour, Majid Reza

    Published 2009
    “…Pattern recognition/classification has received a considerable attention in engineering fields. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    The analysis of road traffic fatality pattern for Selangor, Malaysia case study

    The analysis of road traffic fatality pattern for Selangor, Malaysia case study by Radzuan, N. Q., Mohd Hasnun Ariff, Hassan, Abu Kassim, K. A., Ab. Rashid, A. A., Intan Suhana, Mohd Razelan, Nur Aqilah, Othman

    Published 2021
    “…The result of the article can be used by the relevant traffic stakeholders to execute safety intervention in a more focused manner in Selangor to reduce the number of road traffic fatalities.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Dhany, Saputra

    Published 2008
    “…Sequential pattern mining is a new branch of data, mining science that solves inter-transaction pattern mining problems. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Neural Network Based Pattern Recognition in Visual Inspection System for Intergrated Circuit Mark Inspection

    Neural Network Based Pattern Recognition in Visual Inspection System for Intergrated Circuit Mark Inspection by Sevamalai, Venantius Kumar

    Published 1998
    “…Such problem was faced by a multinational semiconductor manufacturer. Therefore a study was conducted to introduce a new algorithm to inspect integrated circuit package markings. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Machine learning predictions of stock market pattern using Econophysics approach

    Machine learning predictions of stock market pattern using Econophysics approach by Roslan, Nur Nadia Hani, Abdullah, Shahino Mah

    Published 2025
    “…A stock market collapse is specifically caused by the panic that hits the market as a result of an excessive number of sell orders executed at once. …”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  19. 19
    A machine learning approach to predict the activity of smart home inhabitant

    A machine learning approach to predict the activity of smart home inhabitant by Marufuzzaman M., Tumbraegel T., Rahman L.F., Sidek L.M.

    Published 2023
    Article
    Save to List
    Saved in:
  20. 20
    Integration of zero and sequential algorithm in shuffle exchange with Minus One Stage

    Integration of zero and sequential algorithm in shuffle exchange with Minus One Stage by Md Yunus, Nur Arzilawati, Othman, Mohamed, Mohd Hanapi, Zurina

    Published 2013
    “…This paper also shows the details of the illustrative examples used to explain each algorithm. At the end of this chapter, the comparative analysis shows the performance of each algorithm with the integration of shuffle exchange connection pattern in terms of the execution time and number of passes.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: