Search Results - (( developing one method algorithm ) OR ( java implementation plan algorithm ))

Search alternatives:

Refine Results
  1. 1
    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…On the Construction phase, the development of the prototype has been started. All the algorithm for the engine has been developed by using Java script language. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    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 development of this project is based on a framework of 5 main stages: planning, analysis, design, implementation and testing. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Smart student timetable planner

    Smart student timetable planner by Wong, Xin Tong

    Published 2025
    “…To achieve these objectives, the system adopts the Rapid Application Development (RAD) methodology, ensuring iterative design, prototyping, and user feedback integration throughout the process. The system is implemented using Node.js with Express for server-side development, HTML, CSS, and JavaScript for the frontend, and Socket.IO for real-time collaboration. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  5. 5
    A web-based implementation of k-means algorithms

    A web-based implementation of k-means algorithms by Lee, Quan

    Published 2022
    “…The project was planned using the Kanban development methodology, and was built using HTML, CSS, JavaScript, Django, NumPy and pandas. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  6. 6
    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:
  7. 7
    Implementation of RIO in UMJaNetSim / Chan Chin We

    Implementation of RIO in UMJaNetSim / Chan Chin We by Chan, Chin We

    Published 2004
    “…In this project, I will do some research on the recent TCP congestion control and avoidance mechanisms and implement one of the mechanisms into the Java Network Simulator (JaNetSim). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Songs Search Using Human Humming Voice

    Songs Search Using Human Humming Voice by Abdul Rahman, Mohamad Ariff

    Published 2007
    “…The scopes for this project are human humming voice, voice capture in WA V format, songs database, and MIDI file comparing algorithm. Methodologies used in this system are based on system analysis and design methodology comprising planning, analysis, design and implementation. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  9. 9
    New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations

    New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations by Adeyeye, Oluwaseun, Omar, Zurni

    Published 2018
    “…This article presents a new generalized algorithm for developing k-step (m+1) derivative block methods for solving mth order ordinary differential equations. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Overview of metaheuristic: classification of population and trajectory

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

    Published 2010
    “…An algorithm that applies a metaheuristic method is used when there are no specific methods to find a solution. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  11. 11
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan

    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan by Rosselan, Muhammad Zakyizzuddin

    Published 2018
    “…Before incorporating the optimization methods, a sizing algorithm for large-scale GCPV systems was developed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Developing triad design algorithms based on compatible factorization

    Developing triad design algorithms based on compatible factorization by Ibrahim, Haslinda, Omar, Zurni, Abdul Rahim, Rahela

    Published 2011
    “…These processes have helped us develop algorithm for triad design, the objective of this study.A new technique for triad design algorithm, known as Interval Generation Method was employed to construct TD(6n + 1) and TD(6n + 5).This method depends on analyzing the pattern of triples in the design to build starters.We begin by producing starters from Interval Generation Method as the initial block to begin with.Then the algorithm begins by cycling modular v from the initial block and finishes when the process approaches the initial block.The algorithms for TD(6n+1) and TD(6n+5) are presented in Chapter 4 and 5, respectively.As the entire study depends mainly on TD(v) algorithms, new and remarkable theorems and lemmas for TD(v) development are presented and proved.…”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:

Search Tools: