Search Results - (( using addressing problem algorithm ) OR ( java application path algorithm ))

Refine Results
  1. 1

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

    Published 2009
    “…In creating this application, NetBeans IDE 6.5and Java Micro Edition (Java ME) are used. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

    Published 2025
    “…The system architecture integrates ROS 2 on a Raspberry Pi, with TCP/IP connectivity enabling remote operation. An Android mobile application, developed using Java and the java.net.Socket library, provides an intuitive and accessible user interface for seamless interaction with the robot. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

    Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem by Anniza, Hamdan, San Nah, Sze, Say Leng, Goh, Kang Leng, Chiew, Wei King, Tiong

    Published 2023
    “…The mechanisms and strategies used in evolutionary algorithms to address different types of combinatorial optimization problems are discovered. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Hybrid harmony search algorithm for continuous optimization problems by Ala’a Atallah, Hamad Alomoush

    Published 2020
    “…Taken together, the proposed hybrid algorithm, called IHS-GWO, aims to address continuous optimization problems. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Comparison of anonymous tracker algorithms / Nur Shafikah Mat Daud by Mat Daud, Nur Shafikah

    Published 2014
    “…The outcomes of the end results of the IP Address are presented. By using the IP Address, can help easily to track location of anonymous. …”
    Get full text
    Get full text
    Thesis
  6. 6

    New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems by Nor Shuhada, Ibrahim

    Published 2024
    “…This PhD thesis introduces an extended version of MABSA aimed at addressing constrained multi objective optimization problems by incorporating innovative random approaches, focusing to solves reservoir optimization problems. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
    Get full text
    Get full text
    Thesis
  8. 8

    An improved self organizing map using jaccard new measure for textual bugs data clustering by Ahmed, Attika

    Published 2018
    “…Thus, the research introduced the improved SOM algorithm by using a Jaccard NM (SOM-JNM). The SOM-JNM produced significantly better results therefore; it can be consider a challenging approach to address the sparse data problems.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    An improved self organizing map using jaccard new measure for textual bugs data clustering by Ahmed, Attika

    Published 2018
    “…Thus, the research introduced the improved SOM algorithm by using a Jaccard NM (SOM-JNM). The SOM-JNM produced significantly better results therefore; it can be consider a challenging approach to address the sparse data problems.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Solving the optimal power flow problems using the superiority of feasible solutions-moth flame optimizer by Alam, Mohammad Khurshed

    Published 2024
    “…The main goal of this study is to use a cuttingedge version of recent metaheuristic algorithm, namely Moth-Flame Optimizer (MFO) algorithm for solving the mentioned OPF problems. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

    Published 2018
    “…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Multi-objective clustering algorithm using particle swarm optimization with crowding distance (MCPSO-CD) by Rashed, Alwatben Batoul, Hamdan, Hazlina, Mohd Sharef, Nurfadhlina, Sulaiman, Md Nasir, Yaakob, Razali, Abubakar, Mansir

    Published 2020
    “…Generally, clustering is difficult and complex phenomenon, where the appropriate numbers of clusters are always unknown, comes with a large number of potential solutions, and as well the datasets are unsupervised. These problems can be addressed by the Multi-Objective Particle Swarm Optimization (MOPSO) approach, which is commonly used in addressing optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    A Modified Giffler and Thompson Genetic Algorithm on the Job Shop Scheduling Problem by Lee, Hui Peng, Salim, Sutinah

    Published 2006
    “…This algorithm is modified to produce better results than the existing algorithm by using Visual Prolog programming language.…”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Bees algorithm for Forest transportation planning optimization in Malaysia by Jamaluddin, Jamhuri, Kamarudin, Norizah, Ismail, Mohd Hasmadi, Ahmad, Siti Azfanizam

    Published 2021
    “…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
    Get full text
    Get full text
    Article
  15. 15

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Zakaria, M.N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
  16. 16

    Comparative analysis of line search methods in the Steepest Descent algorithm for unconstrained optimization problems / Ahmad Zikri Shukeri, Puteri Qurratu Ain Megat Sulzamzamendi... by Shukeri, Ahmad Zikri, Megat Sulzamzamendi, Puteri Qurratu Ain, Ibrahim, Suhaida

    Published 2024
    “…The result from this study is choosing FMRI algorithm using exact line search to get faster convergence rate which means that the algorithm achieves a high level of accuracy in fewer iterations compared to using other algorithms and inexact line search.…”
    Get full text
    Get full text
    Student Project
  17. 17

    Optimizing decentralized exam timetabling with a discrete whale optimization algorithm by Emily Sing Kiang Siew, San nah sze, Say leng goh

    Published 2025
    “…This problem remains an active area of research and, to the authors' knowledge, has not been adequately addressed by the WOA algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Optimizing Decentralized Exam Timetabling with a Discrete Whale Optimization Algorithm by Emily Siew, Sing Kiang, Sze, San Nah, Goh, Say Leng

    Published 2025
    “…This problem remains an active area of research and, to the authors’ knowledge, has not been adequately addressed by the WOA algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Optimization of multi-holes drilling toolpath using tiki-taka algorithm by Norazlina, Abdul Rahman

    Published 2024
    “…Therefore, this research introduces the TikiTaka Algorithm (TTA) to address these challenges and optimize the toolpath for MDMT problems. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Modified Parameters of Harmony Search Algorithm for Better Searching by Nur Farraliza, Mansor, Abas, Z.A, Shibghatullah, A.S., Rahman, A.F.N.A

    Published 2017
    “…The latest approaches still unable to address the fairness problem that has emerged, thus this research proposes a strategy to adopt an amendment of a harmony search algorithm in order to address the fairness issue and thus the level of fairness will be escalate. …”
    Get full text
    Get full text
    Conference or Workshop Item