Search Results - (( java implication based algorithm ) OR ( problem implementation _ (algorithmic OR algorithms) ))

Refine Results
  1. 1

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

    Published 2010
    “…These quantum algorithms can be applied to solve routing problem in the quantum networks and the quantum multicomputer. …”
    Get full text
    Get full text
    Thesis
  2. 2

    An experiment on the performance of shortest path algorithm by Chan, Simon Yew Meng, Adnan, Nur’ayuni, Sukri, Syazwan Syafiqah, Wan Zainon, Wan Mohd Nazmee

    Published 2016
    “…The main objective of this paper is to study and experiment the different shortest path algorithm such as Dijkstra’s algorithm, Symmetrical Dijkstra’s algorithm, A* algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm and Genetic algorithm in solving the shortest path problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
  4. 4

    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

    Published 2015
    “…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem by Zamani M.K.M., Musirin I., Suliman S.I., Mustaffa S.A.S.

    Published 2023
    “…Good performance of these heuristics-based algorithm has been implied through various implementation in solving optimisation problems. …”
    Article
  6. 6

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

    Published 2023
    “…This work is focused on the implementation of evolutionary based computer algorithms, genetic algorithms (GAs), on microcontrollers. …”
    Conference paper
  8. 8

    The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

    Published 2005
    “…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
    Get full text
    Get full text
    Final Year Project
  9. 9

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

    Published 2006
    “…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…Nonetheless, the A • algorithm do have some unique properties which is more efficient in finding the shortest path especially in human real-world problem. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Festive season balancing groceries optimization / Fairuz Mohamed Razi by Mohamed Razi, Fairuz

    Published 2012
    “…An Artificial Intelligence method or technique is selected to provide a solution to this problem. The cause of the shortage in supply-demand is taken to be implemented in the Genetic Algorithms optimization concepts. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Attribute related methods for improvement of ID3 Algorithm in classification of data: A review by Nur Farahaina, Idris, Mohd Arfian, Ismail

    Published 2020
    “…Decision tree is an important method in data mining to solve the classification problems. There are several learning algorithms to implement the decision tree but the most commonly-used is ID3 algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing by Alobaedy, Mustafa Muwafak Theab

    Published 2015
    “…One of the prominent intelligent algorithms is ant colony system (ACS) which is implemented widely to solve various types of scheduling problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Improving utility and recovery algorithms for adaptive real time system in multiprocessor environment by Ahmad, Idawaty

    Published 2012
    “…These algorithms solved the abortion problem in the existing General Utility Scheduling (GUS). …”
    Get full text
    Get full text
    Thesis
  16. 16

    Optimal path planning algorithm for swarm robots using bat algorithm with mutation (bam) by Lim, Pei Yee

    Published 2022
    “…However, there is still room for improvement such as implementing the obstacle avoidance algorithm into swarm robot. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  17. 17

    Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

    Published 2017
    “…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
    Get full text
    Get full text
    Thesis
  18. 18

    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

    Published 2012
    “…Since subexponential-time algorithm is known for ordinary discrete logarithm problem and integer factorization problem and not for elliptic curve discrete logarithm problem, the algorithm presented for the digital signature in this study has substantially greater strength per key bit than in other digital signature algorithm…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    A hybrid architecture approach for quantum algorithms. by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…Problem statement: In this study, a general plan of hybrid architecture for quantum algorithms is proposed. …”
    Get full text
    Get full text
    Article
  20. 20

    A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem by Lee, Wei Wen, Hashim, Mohd Ruzaini

    Published 2023
    “…Four types of benchmark functions are applied to test the performances of the proposed algorithm. Furthermore, the proposed algorithm is applied in the IEEE-26 bus system for tackling the economic dispatch problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item