Search Results - (( java implementation drops algorithm ) OR ( using second path algorithm ))

Refine Results
  1. 1

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…The simulations conducted using MATLAB demonstrate the superiority of the MPSO algorithm over the PSO algorithm in terms of average path length and execution time of all robots in all three proposed scenarios: 16 meter shorter and 7.1 seconds faster in the first scenario, 17.89 meters shorter and 6.14 seconds faster in scenario 2, and 6.18 meters shorter and 8.47 seconds faster in scenario 3. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  2. 2

    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

    Published 2012
    “…Therefore, the second design is the best approach in optimizing the optimal path trace back for Smith Waterman algorithm. …”
    Get full text
    Get full text
    Student Project
  3. 3

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

    Published 2016
    “…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
    Get full text
    Get full text
    Thesis
  5. 5

    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 algorithm which consider the error value, e to increment pixels is the crucial part of the line generation applies the same concept in the second approach, where the error value, e is used as indicator to determine the heuristic cost of the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION by Nor Akmal, Abdul Aziz

    Published 2005
    “…Besides, this thesis also aimed to compare both algorithms used in the system, based on their speed to generate the shortest path. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  7. 7

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…Second, both the constructive procedure (CP) and the complementary procedure (CCP) heuristic algorithms computed the optimization considering only the execution path that has been predicted by the runtime path prediction method for criteria selection, eight QoS characteristics are suggested after investigating related works on the area of web service and web service composition. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Modification of dijkstra's algorithm for safest and shortest path during emergency evacuation by Khyrina Airin Fariza, Abu Samah, Burairah, Hussin, Abd Samad, Hasan Basari

    Published 2015
    “…Therefore, this paper presents the methodology used for the modification of Dijkstra's algorithm to find the safest and shortest path. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Modeling dynamic weight for 3D navigation routing by Musliman, Ivin Amri, Abdul Rahman, Alias, Coors, Volker

    Published 2007
    “…In this paper, an approach for finding shortest path or route in a dynamic situation for indoors and outdoors using Single Sink Shortest Path (SSSP) routing algorithm is proposed. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path by Linsheng, R., Derahman, M. N., Kadir, M. F. A., Mohamed, M. A., Kamarudin, S.

    Published 2022
    “…However, constraints such as the need to bypass the node which has a high rate of failure exist to prevent the Dijkstra algorithm from meeting this demand. In practice, we need not only consider the shortest path but also consider the second short path, the third short path, and so on. …”
    Get full text
    Get full text
    Article
  11. 11

    Collision avoidance algorithm design for UAV base on parametric theorem and circle overlapping method / Nur Fadzilah Mohamad Radzi by Nur Fadzilah, Mohamad Radzi

    Published 2013
    “…The collision potential will determine whether the avoidance mode needs to be activated or not and collision data (such as collision point, overlap time range, and collision time) will be used in conflict resolution. Secondly, a collision avoidance algorithm is designed to propose a new flight path in order to perform an avoidance maneuver for hosting UAV. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak by Abdul Razak, Noorfadzli

    Published 2018
    “…The second stage focuses on using the vector to generate an admissible cubic path via Hermite interpolation technique integrated with time and tangent transformation scheme. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime by Ahmad, Noor Azlan

    Published 2008
    “…The second proposed algorithm is focused on the AODV route discovery. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Hybrid optimal path traceback system development for optimization DNA sequences alignment by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…As a result, the second design required three times design area as compare to the first design for determine the optimal path for the same matrix size. …”
    Get full text
    Get full text
    Student Project
  16. 16

    Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…As a result, the second design required three times design area as compare to the first design for determine the optimal path for the same matrix size. …”
    Get full text
    Get full text
    Article
  17. 17

    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

    Published 2021
    “…The methodology is proposed as stacking ensemble ML and the best ML algorithms are used as a base learner to compute relative feature weights. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Design and analysis multiple paths trace back and reconstruction module for DNA sequence alignment accelerator using ASIC design flow: article / Nurul Ain Husaini by Husaini, Nurul Ain

    Published 2010
    “…Second objective is to perform the timing analysis and third objective to implement the design using ASIC flow. …”
    Get full text
    Get full text
    Article
  19. 19

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…First scenario uses static consideration, the second scenario uses dynamic consideration with machine failure recovery. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…A model-driven approach was used for generating abstract test cases from the feasible paths. …”
    Get full text
    Get full text
    Get full text
    Thesis