Search Results - (( java implementation plan algorithm ) OR ( basic selection modified algorithm ))

Refine Results
  1. 1

    A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

    Published 2018
    “…Significant modifications to the basic Jaya algorithm are done to create a modified Jaya (MJaya) algorithm that can handle the MOOPF problem. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

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

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

    Published 2019
    “…This methodology consist of Requirement and Planning, Design, Construction, Testing and Implementation. …”
    Get full text
    Get full text
    Thesis
  5. 5

    System identification using Extended Kalman Filter by Alias, Ahmad Hafizi

    Published 2017
    “…Besides, Extended Kalman Filter (EKF) algorithm was selected in this project as an algorithm for offline estimation data purposes. …”
    Get full text
    Get full text
    Student Project
  6. 6

    Progress in various TCP variants (February 2009) by Qureshi, Barkatullah, Othman, Mohamed, Abdul Hamid, Nor Asilah Wati

    Published 2009
    “…TCP Vegas algorithm is explained with new structure mechanism and new congestion avoidance and modified slow start mechanisms. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

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

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

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

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

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…We demonstrate our framework; the integration of enhanced Jump Point Search algorithm with modified Bresenham for heuristic computation in virtual grid-based environment. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction by Abasi, Ammar Kamal Mousa

    Published 2021
    “…Second, three multi-verse optimizer algorithm (MVOs), namely, basic MVO, modified MVO, hybrid MVO is proposed to solve the TDC problem; these algorithms are incremental improvements of the preceding versions. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems by Din, Fakhrud, Khalid, Shah, Fayaz, Muhammad, Gwak, Jeonghwan, Kamal Z., Zamli, Mashwani, Wali Khan

    Published 2022
    “…As the 50-50 probabilities for exploitation and exploration in the basic teaching learning-based optimization algorithm may be counterproductive, the Mamdani-type fuzzy inference system of the new algorithm takes these measures as a crisp inputs and generates selection as crisp output to choose either exploitation or exploration based on the current search requirement. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Robust correlation feature selection based support vector machine approach for high dimensional datasets by Baba, Ishaq Abdullahi, Mohammed, Mohammed Bappah, Jillahi, Kamal Bakari, Umar, Aliyu, Hendi, Hasan Talib

    Published 2025
    “…Our method consists of three basic steps. In the first step, a weights-based modified reweighted fast, consistent, and high break-down point is computed. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Classification of herbs plant diseases via hierarchical dynamic artificial neural network by Abdullah, Lili Nurliyana, Khalid, Fatimah, Borhan, N.M.

    Published 2010
    “…This paper is to propose an unsupervised diseases pattern recognition and classification algorithm that is based on a modified Hierarchical Dynamic Artificial Neural Network which provides an adjustable sensitivity-specificity herbs diseases detection and classification from the analysis of noise-free colored herbs images. …”
    Get full text
    Get full text
    Article
  17. 17

    Classification of herbs plant diseases via hierachical dynamic artificial neural network after image removal using kernel regression framework by Abdullah, Lili Nurliyana, Khalid, Fatimah, Borhan, N.M.

    Published 2011
    “…This paper is to propose an unsupervised diseases pattern recognition and classification algorithm that is based on a modified Hierarchical Dynamic Artificial Neural Network which provides an adjustable sensitivity-specificity herbs diseases detection and classification from the analysis of noise-free colored herbs images. …”
    Get full text
    Get full text
    Article
  18. 18

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

    Power line faults classification by neural network train by Ant Colony Optimization by Nasirudin, Mohd Syafiq

    Published 2017
    “…The execution of this Ant Colony Optimization (ACO) usage was contrasted and that nonpartisan system and discovered it is more compelling than neural system. Metaheuristic algorithms are algorithms which, in order to escape from local optima, drive some basic heuristic: either a constructive heuristic starting from a null solution and adding elements to build a good complete one, or a local search heuristic starting from a complete solution and iteratively modifying some of its elements in order to achieve a better one. …”
    Get full text
    Get full text
    Student Project
  20. 20