Search Results - (( developing using path algorithm ) OR ( java implementation modified algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

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

    Published 2019
    “…The recent trend of software development uses OO paradigm. 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
    Save to List
    Saved in:
  3. 3
    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”
    Review
    Save to List
    Saved in:
  5. 5
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Path planning for unmanned aerial vehicles using visibility line-based methods

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…In addition, a software package using Matlab for 2D and 3D path planning has also been developed. …”
    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
    Automated path testing using the negative selection algorithm

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
    Save to List
    Saved in:
  9. 9
    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…The objective is to design and develop an evacuation route using shortest path algorithm based on the evacuation map of the building. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Adaptive path finding algorithm in dynamic environment for warehouse robot

    Adaptive path finding algorithm in dynamic environment for warehouse robot by Ng, Mun Kit, Chong, Yung Wey, Ko, Kwang man, Park, Young Hoon, Leau, Yu Beng

    Published 2020
    “…For example, A* path finding algorithm is developed to obtain the shortest path, while D* obtains a complete coverage path from source to destination. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Prevention And Detection Mechanism For Security In Passive Rfid System

    Prevention And Detection Mechanism For Security In Passive Rfid System by Khor, Jing Huey

    Published 2013
    “…The proposed protocol is designed with lightweight cryptographic algorithm, including XOR, Hamming distance, rotation and a modified linear congruential generator (MLCG). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Simulation of identifying shortest path walkway in library by using ant colony optimization

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…The system is used to be error free and the algorithm can effectively solve the shortest path problem.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  14. 14
    Comparison of path planning in simulated robot

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  15. 15
    A generalized laser simulator algorithm for optimal path planning in constraints environment

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm

    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

    Published 2021
    “…This paper develops a path planning algorithm of hyper-redundant manipulators to achieve a cyclic property. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space

    Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

    Published 2015
    “…A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Automatic generation of content security policy to mitigate cross site scripting

    Automatic generation of content security policy to mitigate cross site scripting by Mhana, Samer Attallah, Din, Jamilah, Atan, Rodziah

    Published 2016
    “…It can be extended to support generating CSP for contents that are modified by JavaScript after loading. Current approach inspects the static contents of URLs.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia

    Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia by Ahmad, Ab. Rahman, Zenon , Nasaruddin, Hassan, Haswadi

    Published 2005
    “…The system will be developed by using Microsoft Visual Basic and some supporting software. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  20. 20
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: