Search Results - (( developing solving problems algorithm ) OR ( java application based algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

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

    Tacit knowledge for business intelligence framework using cognitive-based approach by Surbakti, Herison

    Published 2022
    “…The framework was tested on 23 librarians from several university libraries in West Java and Yogyakarta, Indonesia. The algorithm starts with a content targeted interview to identify the list of problems faced by librarians. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    CSC126 - Fundamentals of Algorithms and Computer Problem Solving / Faculty of Computer And Mathematical Sciences by UiTM, Faculty of Computer And Mathematical Sciences

    Published 2023
    “…In the end they are expected to develop the ability to analyze simple problems, organize effective algorithmic solutions for the problems and write computer programs to solve them.…”
    Get full text
    Get full text
    Get full text
    Teaching Resource
  9. 9

    Solving transcendental equation using genetic algorithm / Masitah Hambari by Masitah , Hambari

    Published 2004
    “…This project studies the potential of using Genetic Algorithm and develops a program in order to solve Transcendental Equation in optimizing problem domain. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee by Ezanee, Mohammad Ariffin Aizat

    Published 2015
    “…Shuffled Frog Leaping Algorithm (SFLA) is proposed to solve Economic Load Dispatch (ELD) problem. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
    Get full text
    Get full text
    Thesis
  12. 12

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
  13. 13

    Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review by See, Phen Chiak, Wong, Kuan Yew

    Published 2008
    “…This paper is aimed to provide a comprehensive review of the concepts of ACO and its application in solving QAPs. In addition, the various ACO algorithms or variants developed to solve them are critically analysed and discussed. …”
    Get full text
    Get full text
    Article
  14. 14

    Genetic-local hybrid optimizer for solving advance layout problem by Taha, Imad, Ibrahim Habra, Hind Saleem

    Published 2006
    “…Results show the potentiality of the proposed algorithm in solving the problem and outperforming previous algorithms.…”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    CSC118: Fundamentals of Algorithm Development / College of Computing, Informatics and Media by UiTM, College of Computing, Informatics and Media

    Published 2023
    “…This course will focus on algorithm development in problem solving. It will also introduce the students to the techniques of problem solving using modular approach. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
  16. 16

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…In the last few decades, significant research effort has been spent on the development of numerical algorithms, particularly for solving combinatorial problems. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Review on bio-inspired algorithms approach to solve assembly line balancing problem by Noorazliza, Sulaiman, Junita, Mohamad Saleh, Nor Rokiah Hanum, Md. Haron, Z. A., Kamaruzzaman

    Published 2019
    “…Bio-inspired algorithms that have been developed by mimicking the biological phenomenon of nature have been widely applied to solve many real-world problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…Existing method, known as FDTD needs a very long processing time to solve this problem. The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Solving single machine scheduling problem with maximum lateness using a genetic algorithm by Nazif, Habibeh, Lee, Lai Soon

    Published 2010
    “…We develop an optimised crossover operator designed by an undirected bipartite graph within a genetic algorithm for solving a single machine family scheduling problem, where jobs are partitioned into families and setup time is required between these families. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item