Search Results - (( java applications based algorithm ) OR ( using solving problems algorithm ))

Search alternatives:

Refine Results
  1. 1
    Parallel distributed genetic algorithm development based on microcontrollers framework

    Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

    Published 2023
    “…Genetic algorithms are powerful optimizing techniques that are used successfully to solve problems in many different disciplines. …”
    Conference paper
    Save to List
    Saved in:
  2. 2
    Group formation using genetic algorithm

    Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

    Published 2009
    “…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to industry because by working in group, it can reduce the individual workload,improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  3. 3
    Developing an intelligent system to acquire meeting knowledge in problem-based learning environments

    Developing an intelligent system to acquire meeting knowledge in problem-based learning environments by Chiang, A., Baba, M.S.

    Published 2006
    “…Similarly, the algorithm proposed in MALESAbrain can, be used to deal, the problem of conducting a meeting among learners to solve problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    A method for group formation using genetic algorithm

    A method for group formation using genetic algorithm by Che Ani, Zhamri, Yasin, Azman, Husin, Mohd Zabidin, Abdul Hamid, Zauridah

    Published 2010
    “…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to enter industry because by working in group, it can reduce the individual workload, improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language, most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in programming.This paper presents a method for group formation using genetic algorithm, where the members for each group will be generated based on the students’ programming skill.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Batch mode heuristic approaches for efficient task scheduling in grid computing system

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Automated time series forecasting

    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
    Save to List
    Saved in:
  7. 7
    Tacit knowledge for business intelligence framework using cognitive-based approach

    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
    Save to List
    Saved in:
  8. 8
    Development of mobile application of event assistant and booking sport facilities for UiTM Seremban 3 Campus using wofkflow management system / Ahmad Haiqal Abd Halim, Ahmad Yusuf Che Hassan and Mohd Norhafizi Hambari

    Development of mobile application of event assistant and booking sport facilities for UiTM Seremban 3 Campus using wofkflow management system / Ahmad Haiqal Abd Halim, Ahmad Yusuf... by Abd Halim, Ahmad Haiqal, Che Hassan, Ahmad Yusuf, Hambari, Mohd Norhafizi

    Published 2019
    “…In this research, its content of the step on how to apply the method of WfMS in a mobile application with the use of an android studio. The algorithm for the WfMS is written using Java script in this research. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  9. 9
    Application of genetic algorithm methods to optimize flowshop sequencing problem

    Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

    Published 2008
    “…This project will focusing on the method used to solve an optimization problem, the limitation of the method used and the results of solving flow shop sequencing problem using genetic algorithm method. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  10. 10
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    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
    Save to List
    Saved in:
  11. 11
    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms

    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2018
    “…The results obtained are competitive to previous HS variants that used to solve Knapsack problem.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

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

    Published 2022
    “…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Bats echolocation-inspired algorithms for global optimisation problems

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

    Published 2016
    “…An adaptive bats sonar algorithm is proposed for solving single objective optimisation problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    RSA Encryption & Decryption using JAVA

    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
    Save to List
    Saved in:
  15. 15
    Simulated Kalman Filter algorithms for solving optimization problems

    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
    Save to List
    Saved in:
  16. 16
    Levy slime mould algorithm for solving numerical and engineering optimization problems

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

    Published 2022
    “…One classical engineering problem known as the welded beam structure problem is used to test the proposed LSMA algorithm's efficacy. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee

    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
    Save to List
    Saved in:
  19. 19
    Solving transcendental equation using genetic algorithm / Masitah Hambari

    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
    Save to List
    Saved in:
  20. 20
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: