Search Results - (( java implementation modified algorithm ) OR ( problem using computational algorithm ))

Refine Results
  1. 1

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”
    Review
  2. 2

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

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…There is also a need to consider implementing this strategy for dynamic object-oriented languages such as Python, Lisp, and Smalltalk.…”
    Get full text
    Get full text
    Thesis
  4. 4

    Fuzzy-based multi-agent approach for reliability assessment and improvement of power system protection by Nadheer Abdulridha, Shalash

    Published 2015
    “…The simulation results for the first and second models are done using the data obtained from Malaysia distribution network (DISCO-Net) and 69 bus test system that were implemented using Java Agent Development Framework package software. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Prevention And Detection Mechanism For Security In Passive Rfid System by Khor, Jing Huey

    Published 2013
    “…The proposed protocol is designed with lightweight cryptographic algorithm, including XOR, Hamming distance, rotation and a modified linear congruential generator (MLCG). …”
    Get full text
    Get full text
    Thesis
  6. 6

    Automatic generation of content security policy to mitigate cross site scripting by Mhana, Samer Attallah, Din, Jamilah, Atan, Rodziah

    Published 2016
    “…It can be extended to support generating CSP for contents that are modified by JavaScript after loading. Current approach inspects the static contents of URLs.…”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    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
  8. 8

    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
  9. 9

    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
  10. 10

    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
  11. 11
  12. 12
  13. 13

    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
  14. 14

    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
  15. 15

    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
  16. 16

    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
  17. 17

    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
  18. 18

    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
  19. 19
  20. 20