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

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    Web-based expert system for material selection of natural fiber- reinforced polymer composites

    Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

    Published 2015
    “…Secondly, an expert system using Java programming technology with two tiers of search engine was developed to perform a fast selection of candidate materials in huge volume. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application

    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application by Yana Aditia, Gerhana, Nur, Lukman, Arief Fatchul, Huda, Cecep Nurul, Alam, Undang, Syaripudin, Devi, Novitasari

    Published 2020
    “…This study aims to compare the performance of Boyer-Moore, Knuth morris pratt, and Horspool algorithms in searching for the meaning of words in the Java-Indonesian dictionary search application in terms of accuracy and processing time. …”
    Get full text
    Get full text
    Journal
    Save to List
    Saved in:
  5. 5
    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:
  6. 6
    An Effective Fast Searching Algorithm for Internet Crawling Usage

    An Effective Fast Searching Algorithm for Internet Crawling Usage by Chia, Zhen Hon, Nor Azhar, Ahmad

    Published 2016
    “…The search algorithm is a crucial part in any internet applications. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    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:
  8. 8
    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:
  9. 9
    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:
  10. 10
    Some metaheuristic algorithms for solving multiple cross-functional team selection problems

    Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N.

    Published 2022
    “…The developed method also demonstrated the effectiveness of the multi-criteria decision-making process when compared with the multi-objective evolutionary algorithm (MOEA). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    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:
  12. 12
    Optimization of multi-holes drilling toolpath using tiki-taka algorithm

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

    Published 2024
    “…The research methodology involves problem modeling, algorithm development, and validation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Development of optimization Alghorithm for uncertain non-linear dynamical system

    Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

    Published 2004
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  14. 14
    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:
  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
    “…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…New algorithms, journal papers and computerized system were also developed. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  17. 17
    Generic DNA encoding design scheme to solve combinatorial problems

    Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

    Published 2015
    “…Currently, data encoding in DNA computing is tightly coupled with an algorithm that solves an instance of the problem. Solving another problem requires developing specific encoding and computations anew to prove DNA encoding and form the algorithm which is costly. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    The development of integrated planning and scheduling framework for dynamic and reactive environment of complex manufacturing problem

    The development of integrated planning and scheduling framework for dynamic and reactive environment of complex manufacturing problem by Zakaria, Zalmiyah, Deris, Safaai, Mat Yatim, Safie, Othman, Muhamad Razib

    Published 2008
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  19. 19
    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…We will develop the proposed OCGA to solve the problem of minimising the total (weighted) completion time as future work. …”
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri

    Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri by Mohd Sabri, Norlina

    Published 2020
    “…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: