Search Results - (( integer implementation case algorithm ) OR ( java implementation path algorithm ))

  • Showing 1 - 19 results of 19
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

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…Case Slicing Technique (CST) helps in identifying the subset of features used in computing the similarity measures needed by classification algorithms. …”
    Get full text
    Get full text
    Thesis
  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

    Development of symbolic algorithms for certain algebraic processes by Abd. Rahman, Ali, Aris, Nor'Aini

    Published 2007
    “…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
    Get full text
    Get full text
    Get full text
    Monograph
  7. 7

    Development of symbolic algorithms for certain algebraic processes by Abd. Rahman, Ali, Aris, Nor'aini

    Published 2007
    “…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
    Get full text
    Get full text
    Get full text
    Monograph
  8. 8

    Reverse logistics network optimizing by genetic algorithm: a case study of automotive wiring harnesses by Sadrnia, Abdolhossein, Ismail, Napsiah, Mohd Ariffin, Mohd Khairol Anuar, Zulkifli, Norzima, Boyer, Omid

    Published 2014
    “…With regards to the complexity of the reverse logistics network, traditional method cannot be implemented for solving them. Thus, an evolutionary algorithm based genetic algorithm (GA) is applied as a solution methodology to solve mixed integer linear programming model and find the optimum solution. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13
  14. 14

    A study on the significance of backlash width values to the performance of the MIQP-based design of MPC by H., Zabiri, Y., Samyudia

    Published 2005
    “…Simulation results via an industrial Fluidized Catalytic Cracking Unit (FCCU) case study are presented to show the significance of precise estimation of the backlash width in ensuring successful implementation of the MIQP-based design of MPC.…”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15
  16. 16

    Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

    Published 2002
    “…Two models, Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) to represent the minimal reduct computation problem were proposed. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Energy-aware task scheduling for streaming applications on NoC-based MPSoCs by Abd Ishak, Suhaimi Abd Ishak, Wu, Hui, Tariq, Umair Ullah

    Published 2024
    “…Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    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