Search Results - (( integer improving generalization algorithm ) OR ( java implementation path 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

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

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

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

    New Representation Method For Integers And Its Application On Elliptic Curve Cryptography by Eghdamian, Arash

    Published 2020
    “…This study proposes a new Radix-r representation for integers which is known as Modified Generalized Non-Adjacent Form (MGNAF).…”
    Get full text
    Get full text
    Thesis
  7. 7

    Taguchi's T-method with nearest integer-based binary bat algorithm for prediction by Marlan Z.M., Jamaludin K.R., Ramlie F., Harudin N.

    Published 2023
    “…In this paper, a swarm-based binary bat optimization algorithm with a nearest integer discretization approach is integrated with the Taguchi�s T-method. …”
    Article
  8. 8

    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
    “…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…The thesis emphasizes mainly on the improvement of the original SIP/DRIP algorithm in term of performance. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

    Published 2008
    “…Future research includes exploring the use of separator Database in PrefixSpan with pseudoprojection to improve mining generalized sequential patterns, particularly in handling mining constrained sequential patterns.…”
    Get full text
    Thesis
  18. 18

    Development of two matheuristics for production-inventory-distribution routing problem / Dicky Lim Teik Kyee by Dicky Lim , Teik Kyee

    Published 2018
    “…We propose an optimization algorithm designed by the interpolation of metaheuristics and mathematical programming techniques, known as MatHeuristics algorithm, to solve the model. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    “…Future research includes exploring the use of separator Database in PrefixSpan with pseudoprojection to improve mining generalized sequential patterns, particularly in handling mining constrained sequential patterns.…”
    Get full text
    Get full text
    Thesis
  20. 20

    Optimize class time tabling by using genetic algorithm technique in UTHM by Ahmad, Izah Rafidah

    Published 2019
    “…In existing research, many problems involving scheduling have been solved by using genetic algorithm method. There are many other methods that were also being used such as linear programming, integer linear programming, tabu search, ant colony optimization (ACO) algorithm and goal programming. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis