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

Search alternatives:

Refine Results
  1. 1
    Modelling of multi-robot system for search and rescue

    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
    Save to List
    Saved in:
  2. 2
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING

    AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING by SALLEH AL-HUMAIKANI, MOHAMMED ABDULQAWI

    Published 2021
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique

    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
    Save to List
    Saved in:
  5. 5
    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    “…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

    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
    Save to List
    Saved in:
  7. 7
    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control

    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
    Save to List
    Saved in:
  8. 8
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    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
    Save to List
    Saved in:
  9. 9
    FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION

    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
    Save to List
    Saved in:
  10. 10
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

    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
    Save to List
    Saved in:
  11. 11
    Modification of dijkstra's algorithm for safest and shortest path during emergency evacuation

    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
    Save to List
    Saved in:
  12. 12
    Modeling dynamic weight for 3D navigation routing

    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
    Save to List
    Saved in:
  13. 13
    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…It does not consider the LACE algorithm implemented in huge number of server in one Cloud datacenter. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path

    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
    Save to List
    Saved in:
  15. 15
    Collision avoidance algorithm design for UAV base on parametric theorem and circle overlapping method / Nur Fadzilah Mohamad Radzi

    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
    Save to List
    Saved in:
  16. 16
    Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak

    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
    Save to List
    Saved in:
  17. 17
    Simulation Of Path Optimisation Algorithms

    Simulation Of Path Optimisation Algorithms by Sim, Choon Yeee

    Published 2017
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  18. 18
    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime

    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
    Save to List
    Saved in:
  19. 19
    Route Optimization System

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…Using that process, we have settled on Java as our development platform as we found it able to both implement DA and the GIS component (map display and manipulation). …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  20. 20
    Study and Implementation of Data Mining in Urban Gardening

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: