Search Results - (( _ processing (problems OR problem) algorithm ) OR ( java application design algorithm ))

Search alternatives:

Refine Results
  1. 1
    Improving Class Timetabling using Genetic Algorithm

    Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

    Published 2006
    “…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    A Model for Evaluation of Cryptography Algorithm on UUM Portal

    A Model for Evaluation of Cryptography Algorithm on UUM Portal by Norliana, Abdul Majid

    Published 2004
    “…The methodology used in this study begun with problem identification, requirement identification, analysed the model process and design the simulation model. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Object-Oriented Programming semantics representation utilizing agents

    Object-Oriented Programming semantics representation utilizing agents by Mohd Aris, Teh Noranis

    Published 2011
    “…Generally, these source codes go through the preprocessing, comparison, extraction, generate program semantics and classification processes. A formal algorithm that can be applied to any two related Java-based source codes examples is invented to generate the semantics of these source codes. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Message based random variable length key encryption algorithm.

    Message based random variable length key encryption algorithm. by Mirvaziri, Hamid, Jumari, Kasmiran, Ismail, Mahamod, Mohd Hanapi, Zurina

    Published 2009
    “…None fixed size key caused avoidance of replaying and other attacks that can happen on fixed sized key algorithms. Conclusion: Random process employed in this block cipher increased confidentiality of the message and dynamic length substitution in proposed algorithm may lead to maximum cryptographic confusion and consequently makes it difficult for cryptanalysis.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    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
    “…In the exponentially growing material database, selection of optimal material for engineering design is Multi Criteria Decision Making (MCDM) problem as many properties of each material influence the selection process. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Challenges of hidden data in the unused area two within executable files

    Challenges of hidden data in the unused area two within executable files by Naji, Ahmed Wathik, Zaidan, A.A., Zaidan, B.B.

    Published 2009
    “…There are many challenges of hidden data in the unused area two within executable files, which is dependencies of the size of the cover file with the size of hidden information, differences of the size of file before and after the hiding process, availability of the cover file after the hiding process to perform normally and detection by antivirus software as a result of changes made to the file. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    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:
  8. 8
    Provider independent cryptographic tools

    Provider independent cryptographic tools by Ibrahim, Subariah, Salleh, Mazleena, Abdul Aziz, Shah Rizan

    Published 2003
    Get full text
    Get full text
    Get full text
    Monograph
    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
    “…Flow shop scheduling problems relates the generation of appropriate sequencing for processing of N machines in compliance with given processing sequence orders. …”
    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
    “…Thus, this work focuses on industrial MO problems encountered in process engineering with more than two objectives. …”
    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
    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    “…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    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:
  14. 14
    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:
  15. 15
    Monkey Algorithm for Packing Circles with Binary Variables

    Monkey Algorithm for Packing Circles with Binary Variables by Torres-Escobar, R., Marmolejo-Saucedo, J.A., Litvinchev, I., Vasant, P.

    Published 2019
    “…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Monkey Algorithm for Packing Circles with Binary Variables

    Monkey Algorithm for Packing Circles with Binary Variables by Torres-Escobar, R., Marmolejo-Saucedo, J.A., Litvinchev, I., Vasant, P.

    Published 2019
    “…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    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:
  18. 18
    Generic DNA encoding design scheme to solve combinatorial problems

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

    Published 2015
    “…The complexity of combinatorial problems is classified as NP meaning that algorithms are yet to exist to efficiently solve the problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Bees algorithm for Forest transportation planning optimization in Malaysia

    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
    Save to List
    Saved in:
  20. 20
    Optimization of multi-holes drilling path using particle swarm optimization

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…One way to improve the multi-hole drilling is by optimising the tool path in the process. This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: