Search Results - (( java implementation path algorithm ) OR ( using computer can algorithm ))

Search alternatives:

Refine Results
  1. 1
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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 development tools used in developing this project is NetBeans by using Java for the implementation of the coding. 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:
  3. 3
    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
    “…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:
  4. 4
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm

    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm by Muhammad Syahril Mohamad Sainal

    Published 2022
    “…Genetic algorithm was widely used because of its accuracy and simplicity. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
    Save to List
    Saved in:
  7. 7
    Task scheduling in cloud computing using hybrid genetic algorithm and bald eagle search (GA-BES)

    Task scheduling in cloud computing using hybrid genetic algorithm and bald eagle search (GA-BES) by Kamal Khairi Supaprhman

    Published 2022
    “…Cloud computing one of the fastest growing technologies and now managing file and services on the local storage devices is no longer use because of the cloud computing that can do the same things over the internet where anyone and everyone can access to it. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
    Save to List
    Saved in:
  8. 8
    Locust- inspired meta-heuristic algorithm for optimising cloud computing performance

    Locust- inspired meta-heuristic algorithm for optimising cloud computing performance by Fadhil, Mohammed Alaa

    Published 2023
    “…This algorithm can also be used for task scheduling. The proposed algorithm efficiently maps and achieves the objective function for server consolidation, optimising energy consumption, VM migrations, and server utilisation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Adaptive DNA computing algorithm by using PCR and restriction enzyme

    Adaptive DNA computing algorithm by using PCR and restriction enzyme by Watanabe, Shinpei, Tsuboi, Yusei, Ibrahim, Zuwairie, Yamamoto, Tsuneto, Ono, Osamu

    Published 2004
    “…The adaptive algorithm is designed based on Adleman-Lipton [3I paradigm of DNA computing, However, unlike the Adleman- Lipton architecture, a cutting operation has been introduced to the algorithm and the mechanism in which the molecules used by computation were feedback to the next cyclc was devised. …”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  10. 10
    The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi

    The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi by Mohd Radzi, Mohamad Khairul Ikhwan

    Published 2017
    “…However, for optimum distance, dijkstra algorithm has been used. This algorithm is one of the algorithms used for getting the lowest cost search path. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    “…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Quantum Processing Framework And Hybrid Algorithms For Routing Problems

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Phishing attack detection using machine learning method

    Phishing attack detection using machine learning method by Jupin, John Arthur

    Published 2019
    “…However, in this wide use of this computer network, the privacy of computer users is in danger. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  14. 14
    Loop-based RSA Key Generation Algorithm using String Identity

    Loop-based RSA Key Generation Algorithm using String Identity by Norhidayah, Muhammad, Jasni, Mohamad Zain, Md Yazid, Mohd Saman

    Published 2013
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Optimizing BOINC scheduling using genetic algorithm based on thermal profile

    Optimizing BOINC scheduling using genetic algorithm based on thermal profile by Binti, N.N., Zakaria, M.N.B., Aziz, I.B.A., Binti, N.S.

    Published 2014
    “…Universiti Teknologi Petronas (UTP) campus grid used BOINC as middleware in computer labs. However, computer can only process jobs during weekday and office hour because they want to reduce energy used for cooling power. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…Further optimization can be made to reduce the computation time.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Overview of metaheuristic: classification of population and trajectory

    Overview of metaheuristic: classification of population and trajectory by Zainul Rashid, Zarina

    Published 2010
    “…Algorithms are used to find the solutions through the computer program. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  18. 18
    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…Dijkstra’s algorithm is the technique that can solve the problem by itself. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad

    Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad by Saima Gulzar, Ahmad

    Published 2017
    “…However, the bottle neck is efficient scheduling algorithms. Such complex applications can be expressed in the form of workflows. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Fast recursive computation of Krawtchouk polynomials

    Fast recursive computation of Krawtchouk polynomials by Abdulhussain, Sadiq H., Ramli, Abd Rahman, Sy Mohamed, Sy Abd Rahman Al-haddad, Mahmmod, Basheera M., Jassim, Wissam A.

    Published 2018
    “…Therefore, only N / 4 recursion times are required. The proposed algorithm can also be used to compute polynomial coefficients for different values of the parameter p in interval (0, 1). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: