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

Refine Results
  1. 1

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

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

    Solving Examination Timetabling Problem using Partial Exam Assignment with Great Deluge Algorithm by Ashis Kumar, Mandal, M. N. M., Kahar

    Published 2015
    “…In this approach, exams are ordered based on graph heuristics and only selected exams (partial exams) are scheduled first and then improved using great deluge algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Zakaria, M.N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
  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

    A modified partially mapped multiCrossover genetic algorithm for Two-Dimensional Bin Packing Problem by Sarabian, Maryam, Lee, Lai Soon

    Published 2010
    “…Our aim was to improve the performance of the MultiCrossover Genetic Algorithm(MXGA)proposed from the literature for solving the problem. …”
    Get full text
    Get full text
    Article
  8. 8

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
  9. 9

    Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

    Published 2016
    “…The proposed algorithms work by first ordering all examinations using graph heuristics ordering strategies. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Job shop rescheduling using a hybrid artificial immune system and genetic algorithm model by Mohamed Din, Aniza, Ku-Mahamud, Ku Ruhana, Yusof, Yuhanis, Mahmuddin, Massudi

    Published 2012
    “…This paper discusses on developing a hybrid model to tackle the problem of changing environment in the job shop scheduling problem.The main idea is to develop building blocks of partial schedules using the model developed that can be used to provide backup solutions when disturbances occur during production.This model hybridizes genetic algorithm (GA) with artificial immune systems (AIS) techniques to generate these partial schedules.Each partial schedule, also known as antibody, is assigned a fitness value for the selection of final population of best partial schedules. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Job shop rescheduling using a hybridization of genetic algorithm and artificial immune systems by Mohamed Din, Aniza, Ku-Mahamud, Ku Ruhana, Yusof, Yuhanis, Mahmuddin, Massudi

    Published 2012
    “…This paper discusses on developing a hybrid model of genetic algorithm and artificial immune systems to tackle the problem of changing environment in the job shop scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing by Elteriki, Salem Abdulsalam

    Published 2018
    “…However, not many types of research are focused on the study of the 2SALB problem. Recently, the artificial bee colony (ABC) algorithm was used in the solution process where it was considered as a very useful, effective and well-known algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Binary search algorithm-based maximum power point tracking for photovoltaic system under partial shaded conditions by Hamdan, Daniyal, Meng, Chung Tiong, Mohd Herwan, Sulaiman

    Published 2018
    “…All three algorithms were examined under 15 different partial shaded test conditions. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Hybrid moth flame optimization mppt algorithm for accurate real-time tracking under partially shaded photovoltaic system by Tiong, Meng Chung

    Published 2021
    “…In addition, with the continuous improvement effort and the possibility of a new-comer algorithm can show superior results on the current problem, a new MFO based MPPT algorithm was proposed. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

    Published 2004
    “…In CQ Routing Algorithm, the confidence value (C value) can be used to improve the quality of exploration in Q Routing Algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Application of Bee Colony Optimization (BCO) in NP-Hard Problems by Kamarudin, Muhammad Sariy Syazwan

    Published 2011
    “…This report presents the first stage of an ongoing research which is the problem solving of highly complex tasks using Bee-Inspired algorithms. …”
    Get full text
    Get full text
    Final Year Project
  19. 19

    Ball surface representations using partial differential equations by Kherd, Ahmad Saleh Abdullah

    Published 2015
    “…This algorithm is then tested in positivity preserving of surface and image enlargement problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20