Search Results - (( problem using computational algorithm ) OR ( java application modified 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
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm

    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm by Muhammad Syahril Mohamad Sainal

    Published 2022
    “…Meta-heuristic algorithms are mostly used to solve this problem. For example, Genetic Algorithm with Particle Swarm Optimization, Genetic Algorithm with Artificial Bee Colony Algorithms (ABC) and Genetic Algorithm with Ant Colony Optimization Algorithms. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
    Save to List
    Saved in:
  3. 3
    Travelling Salesman Problem using Prim Algorithm in High Performance Computing

    Travelling Salesman Problem using Prim Algorithm in High Performance Computing by Wan Harun, Wan Nurhafizah

    Published 2007
    “…TSP has been used in The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland and Usefulness of Solution Algorithms of the Travelling Salesman Problem in the typing of Biological Sequences in a Clinical Laboratory Setting.…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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
    “…The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    CSC126 - Fundamentals of Algorithms and Computer Problem Solving / Faculty of Computer And Mathematical Sciences

    CSC126 - Fundamentals of Algorithms and Computer Problem Solving / Faculty of Computer And Mathematical Sciences by UiTM, Faculty of Computer And Mathematical Sciences

    Published 2023
    “…This course is an introduction to problem solving using a computer programming language. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
    Save to List
    Saved in:
  7. 7
    Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)

    Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA) by Alamri, Hammoudeh S., Zamli, Kamal Z., Ahmad Firdaus, Zainal Abidin, Mohd Faizal, Ab Razak

    Published 2019
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  9. 9
    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali

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

    Published 2012
    “…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

    A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm by Abarghouei, Amir Atapour

    Published 2010
    “…In this approach, suitable fuzzy matrices are used to illustrate the details of the problem. A new optimization algorithm, called the Gravitational Search Algorithm (GSA) is applied to solve TSP as precise as possible, and finally the Genetic Algorithm (GA) finds the final answer in an acceptable amount of time. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Comparison between ant colony and genetic algorithm using traveling salesman problem

    Comparison between ant colony and genetic algorithm using traveling salesman problem by Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah

    Published 2013
    “…In ant colony algorithm each individual ant constructs a part of the solution using an artificial pheromone which reflects its experience accumulated while solving the problem and heuristic information dependent on the problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian

    Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

    Published 2013
    “…One of the ways for resolving this problem is by using pre-computed results of queries. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Hybrid ant colony system and genetic algorithm approach for scheduling of jobs in computational grid

    Hybrid ant colony system and genetic algorithm approach for scheduling of jobs in computational grid by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2015
    “…Metaheuristic algorithms have been used to solve scheduling problems in grid computing.However, stand-alone metaheuristic algorithms do not always show good performance in every problem instance. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Scheduling jobs in computational grid using hybrid ACS and GA approach

    Scheduling jobs in computational grid using hybrid ACS and GA approach by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2014
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Adopting Jaya Algorithm for Team Formation Problem

    Adopting Jaya Algorithm for Team Formation Problem by Kader, Md. Abdul, Kamal Z., Zamli

    Published 2020
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints

    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

    Published 2015
    “…Vehicle routing problem is difficult to solve using exact methods especially for large size instances due to computational expensive. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Solving time gap problems through the optimization of detecting stepping stone algorithm

    Solving time gap problems through the optimization of detecting stepping stone algorithm by Omar, Mohd. Nizam, Maarof, Mohd. Aizaini, Zainal, Anazida

    Published 2004
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  18. 18
    Solving multi-task optimization problems using the sine cosine algorithm

    Solving multi-task optimization problems using the sine cosine algorithm by Kamal Z., Zamli, Kader, Md. Abdul

    Published 2022
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…In network theory, it’s known as the shortest-path problem, and Dijkstra’s algorithm is usually used to solve it. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing

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

    Published 2015
    “…The proposed algorithms were evaluated against twelve metaheuristic algorithms in static (expected time to compute model) and dynamic (distribution pattern) grid computing environments. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: