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

Refine Results
  1. 1

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

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

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

    Published 2016
    “…Thus, a new algorithm known as infection evolution (IE) was developed in this study. …”
    Get full text
    Get full text
    Thesis
  4. 4

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

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

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

    Published 2016
    “…Using this method, the need for the knowledge of the degree of nonlinearity in advance can be avoided. The proposed algorithm models the Wiener-Hammerstein linear and nonlinear components in the secondary path and applies the estimated degree of nonlinearity of the nonlinear secondary path in the control algorithm design.In previous works, SEF-NLFXLMS and THF-NLFXLMS algorithms for Hammerstein and Wiener structures were developed where the acoustic path is assumed to be a unit gain. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

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

    Published 2011
    “…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
    Get full text
    Get full text
    Thesis
  9. 9

    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
    “…There are many algorithms have been designed to find these paths. The algorithms such as Djikstra, Bellman-Ford or Floyd- Warshall are difference from one to another due to the simplicity, effectiveness and duration of processing the nodes. …”
    Get full text
    Get full text
    Monograph
  10. 10

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

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

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

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

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

    Meta-Heuristic Algorithms for Learning Path Recommender at MOOC by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N.

    Published 2021
    “…We have developed Metaheuristic algorithms includes the Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), to solve the proposed model. …”
    Get full text
    Get full text
    Article
  16. 16

    Develpoment of combinatorial optimisation for cutting tool path strategy by Alsultaney, Hazem K., Mohd Ariffin, Mohd Khairol Anuar, Baharudin, B. T. Hang Tuah, Ali, Aidy, Mustapha, Faizal

    Published 2009
    “…To simulate the physical removal of material during machining, a finite element model is designed to represent a thin walled workpiece. The target was to develop models which mimic the actual cutting process using the Finite Element Method (FEM) and to validate the developed tool path strategy algorithm with the actual machining process and to programmer the developed algorithm into software. …”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17
  18. 18

    Dynamic path planning algorithm in mobile robot navigation by Yun, S.C., Parasuraman, S., Ganapathy, V.

    Published 2011
    “…MATLAB simulation is developed to verify and validate the algorithm before they are real time implemented on Team AmigoBotTM robot. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator 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
    Student Project
  20. 20