Search Results - (( java implementation path algorithm ) OR ( pattern string research algorithm ))

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

    GPU-based odd and even hybrid string matching algorithm by Rahbari, Ghazal, Abdul Rashid, Nur’Aini, Husain, Wahidah

    Published 2016
    “…String matching is considered as one of the fundamental problems in computer science.Many computer applications provide the string matching utility for their users, and how fast one or more occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    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
  3. 3

    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
  4. 4

    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
  5. 5

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

    A Web-Based Recommendation System To Predict User Movements Through Web Usage Mining by Jalali, Mehrdad

    Published 2009
    “…The longest common subsequence is a well-known string matching algorithm that we have utilized to find the most similar pattern between a set of navigation patterns and current user activities for creating the recommendations.…”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9

    Meta search engine powered by DBpedia by Chin, Kim On, Patricia Anthony, Boo, Vooi Keong, Rosalam Sarbatly

    Published 2012
    “…Nowadays infonnation on the web has grown to a size at which even a good ranking algorithm could not produce a precise search result. …”
    Get full text
    Get full text
    Research Report
  10. 10

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis