Search Results - (( developing executable modified algorithm ) OR ( java data control algorithm ))

Refine Results
  1. 1
  2. 2

    Dynamic obstacle handling in multi-robot coverage by Tay, Wing Le

    Published 2024
    “…This report focuses on developing a multi-robot coverage algorithm with dynamic obstacle handling abilities, known as the Modified Lloyd’s algorithm with Velocity Obstacle (VO). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

    Design Of Robot Motion Planning Algorithm For Wall Following Robot by Ali Hassan, Muhamad Khairul

    Published 2006
    “…Computer A will be sent the data to computer B through the internet/LAN using JAVA program. …”
    Get full text
    Get full text
    Monograph
  4. 4
  5. 5

    Café Web Based System Using Priority Scheduling Approach by Fatimah, Ghazali, Rohana, Ismail, Mohamad Hariz, Hasni

    Published 2017
    “…The priority scheduling algorithm is based on Control Processing Unit scheduling algorithm where it has a priority to execute tasks. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks by Moudi, Mehrnaz

    Published 2012
    “…This algorithm has been developed to achieve performance goals in terms of 50% reduction in the number of passes.…”
    Get full text
    Get full text
    Thesis
  7. 7

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  8. 8
  9. 9

    M-Factors Fuzzy Time Series for Forecasting Moving Holiday Electricity Load Demand in Malaysia (S/O 14589) by Mansor, Rosnalini, Mat Kasim, Maznah, Othman, Mahmod, Zaini, Bahtiar Jamili

    “…The modified algorithm, Weighted Subsethood Segmented Fuzzy Time Series (WeSuSFTS) consists of four main phases; data pre-processing, model development, model implementation and model evaluation. …”
    Get full text
    Get full text
    Monograph
  10. 10

    Automated time series forecasting by Ismail, Suzilah, Zakaria, Rohaiza, Tuan Muda, Tuan Zalizam

    Published 2011
    “…Moving Average, Decomposition, Exponential Smoothing, Time Series Regressions and ARIMA) were used.The algorithm was developed in JAVA using up to date forecasting process such as data partition, several error measures and rolling process.Successfully, the results of the algorithm tally with the results of SPSS and Excel.This automatic forecasting will not just benefit forecaster but also end users who do not have in depth knowledge about forecasting techniques.…”
    Get full text
    Get full text
    Get full text
    Monograph
  11. 11

    System identification using Extended Kalman Filter by Alias, Ahmad Hafizi

    Published 2017
    “…System identification is getting more intensive from researcher to develop an algorithm with work efficiently and more accurate. …”
    Get full text
    Get full text
    Student Project
  12. 12

    A cluster-based hybrid replica control protocol for high availability in data grid by Mabni, Zulaile

    Published 2019
    “…Therefore, a replica control protocol must consider the dynamic aspects of the Data Grid. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14
  15. 15
  16. 16

    Weighted subsethood and reasoning based fuzzy time series for moving holiday electricity load demand forecasting by Rosnalini, Mansor

    Published 2021
    “…The modified algorithm, Weighted Subsethood Segmented Fuzzy Time Series (WeSuSFTS) consists of four main phases; data pre-processing, model development, model implementation and model evaluation. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Application of Evolutionary Algorithm for Assisted History Matching by Zahari, Muhammad Izzat

    Published 2014
    “…Today, tremendous efforts are made to develop Automatic History Matching algorithms. While the automatic method focus on optimization which is normally computer based. …”
    Get full text
    Get full text
    Final Year Project
  19. 19

    Parallel Diagonally Implicit Runge-Kutta Methods For Solving Ordinary Differential Equations by Din, Ummul Khair Salma

    Published 2009
    “…Comparisons on numerical results to existing methods show a competitive efficiency when solving small systems of stiff ODEs. A parallel code is developed with the same capability of the modified sequential code to handle stiff ODEs, linear and nonlinear problems. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks by Raja Mohd Auzar, Tengku Dian Shahida

    Published 2009
    “…Extended from the FastZ algorithms, another three new algorithms called the FastRLP, BRLP and FastBRLP algorithms are developed to achieve different performance goals. …”
    Get full text
    Get full text
    Thesis