Search Results - (( develop processing problems algorithm ) OR ( java application new algorithm ))

Search alternatives:

Refine Results
  1. 1
    Application of genetic algorithm and JFugue in an evolutionary music generator

    Application of genetic algorithm and JFugue in an evolutionary music generator by Tang, Jia Rou

    Published 2025
    “…This project explores the application of Genetic Algorithms (GA) with JFugue, which is a Java-based music programming library to develop an Evolutionary Music Generator. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  2. 2
    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…Efforts are made to develop a new tool or method for extracting information from XML data directly without any preprocessing or post processing of the XML documents. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Classification System for Heart Disease Using Bayesian Classifier

    Classification System for Heart Disease Using Bayesian Classifier by Magendram, Anusha

    Published 2007
    “…This system was developing base on to three main part which is data processing, testing and implementation of the algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Ant colony optimization algorithm for load balancing in grid computing

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job. …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  6. 6
    Face recognition and identification system (FaceRec) / Khew Jye Huei

    Face recognition and identification system (FaceRec) / Khew Jye Huei by Khew , Jye Huei

    Published 2004
    “…The project approaches the research and development process as a two dimensional recognition problem, capturing the face image by using the web camera. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Resource management in grid computing using ant colony optimization

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
    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
    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem

    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem by M., Muziana, Kamal Z., Zamli

    Published 2015
    “…Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    DEVELOPMENT OF A MULTI-OBJECTIVE OPTIMZATION FRAMEWORK FOR INDUSTRIAL PROCESSES

    DEVELOPMENT OF A MULTI-OBJECTIVE OPTIMZATION FRAMEWORK FOR INDUSTRIAL PROCESSES by GANESAN, TIMOTHY

    Published 2014
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach

    Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach by N. M., Razali

    Published 2014
    “…The process sequencing problem can be modeled as the travelling salesman problem with precedence constraints (TSPPC). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Quantum Processing Framework And Hybrid Algorithms For Routing Problems

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…A typical component in QPU is a quantum device that runs quantum algorithms; namely Quantum Algorithm Processing Unit (QAPU). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Fitness value based evolution algorithm approach for text steganalysis model

    Fitness value based evolution algorithm approach for text steganalysis model by Din, Roshidi, Samsudin, Azman, Tuan Muda, Tuan Zalizam, Lertkrai, P., Amphawan, Angela, Omar, Mohd Nizam

    Published 2013
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Genetic Algorithm for vehicle routing problem / W.Nurfahizul Ifwah W.Alias, Mohd Shaiful Sharipudin and Shamsunarnie Mohamed Zukri.

    Genetic Algorithm for vehicle routing problem / W.Nurfahizul Ifwah W.Alias, Mohd Shaiful Sharipudin and Shamsunarnie Mohamed Zukri. by W.Alias, W.Nurfahizul Ifwah, Sharipudin, Mohd Shaiful, Mohamed Zukri, Shamsunarnie

    Published 2012
    “…Among these early applications of GA were those developed by Bagley for a game-playing program, by Rosenberg in simulating biological processes, and by Cavicchio for solving pattern-recognition problems. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  15. 15
    A refined differential evolution algorithm for improving the performance of optimization process

    A refined differential evolution algorithm for improving the performance of optimization process by A. R., Yusoff, Nafrizuan, Mat Yahya

    Published 2011
    “…Various Artificial Intelligent (AI) algorithms can be applied in solving optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Implication of image processing algorithm in remote sensing and GIS applications

    Implication of image processing algorithm in remote sensing and GIS applications by Pathan, Mubeena, Jusoff, Kamaruzaman, Mohd Sood, Alias, Razali, Yaakob, Qureshi, Barkatullah

    Published 2011
    “…One problem can be solved in more than one way; in this regards many alternative algorithms are developed with computational proficiency. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Text steganalysis using evolution algorithm approach

    Text steganalysis using evolution algorithm approach by Din, Roshidi, Tuan Muda, Tuan Zalizam, Lertkrai, Puriwat, Omar, Mohd Nizam, Amphawan, Angela, Aziz, Fakhrul Anuar

    Published 2012
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    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:

Search Tools: