Search Results - (( java implementation modified algorithm ) OR ( using simple path 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

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

    Published 2021
    “…Further, it focuses on the development of various forms of local risk prediction models and simple heart risk scores using non-laboratory features and machine learning (ML) algorithms. …”
    Get full text
    Get full text
    Thesis
  3. 3

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

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.…”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2012
    “…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
    Get full text
    Get full text
    Student Project
  7. 7

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

    Published 2012
    “…back system for Smith-Waterman Algorithm using Structural Modelling Technique. The objectives for this paper are to optimize the best trace back scanning performance and also to design the simple architecture in order to reduce the runtime. …”
    Get full text
    Get full text
    Article
  8. 8

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

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

    Published 2022
    “…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
    Get full text
    Thesis
  10. 10

    Computer algorithm for playing checkers by Chua Shin Lee

    Published 2023
    “…The Checkers game uses heuristics algorithm, a simple depth-first procedure, for searching trees.…”
    text::Thesis
  11. 11

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

    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
    “…K-shortest paths algorithm discovers a set of paths ordered in the most optimal, optimal, and suboptimal, has a very wide application is integrated into SDN controller to handle routing functionality. …”
    Get full text
    Get full text
    Article
  13. 13

    Multi-Robot Path-Planning algorithm for automated parcel sorting centre with ring road layout by Jong, Qian Biao

    Published 2023
    “…Since the automated warehouses and sorting centres are usually large and contain hundreds of robots, the recent algorithms with the simple grid layout assumption are doubted to be efficient in the real world. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  14. 14

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    Published 2013
    “…However, the planned path by using basic RRT structure might not always be optimal in terms of path length. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

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

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Collision free control of variable length hyper redundant robot manipulator by Jamali, Annisa, Khan, Md. Raisuddin, Osman, M. Shahril, Rahman, Md. Mozasser, Ashari, Muhd Fadzli, Jamaludin, Mohd Syahmi, Junaidi, Ervina

    Published 2014
    “…Hyper-redundant robot (HRR) manipulators are useful at navigating convoluted paths, but conventionally complicated to control. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Laser and vision sensing for obstacle avoidance and target seeking for a simple mobile robot by Akmeliawati, Rini, Demidenko, Serge, Menon, Anuradha

    Published 2009
    “…The system is implemented using inexpensive commodity hardware and employs simple but effective data processing software and control algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Maze solving balbot by Soon, Chi Wei

    Published 2010
    “…The path control algorithm will be coded in ATMEGA 32 microcontroller. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  20. 20

    Collision Free Control of Variable Length Hyper Redundant Robot Manipulator by Annisa, Jamali, M. Raisuddin, Khan, M. Shahril, Osman, M. Mozasser, Rahman, Muhamad Fadzli, Ashari, Mohd Syahmi, Jamaludin, Ervina, Junaidi

    Published 2014
    “…Hyper-redundant robot (HRR) manipulators are useful at navigating convoluted paths, but conventionally complicated to control. …”
    Get full text
    Get full text
    Get full text
    Article