Search Results - (( java implementation modified algorithm ) OR ( programming problem where 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
    “…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
    Save to List
    Saved in:
  2. 2
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    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
    Save to List
    Saved in:
  3. 3
    Comparison Between Linear Programming And Integer Linear Programming: A Review

    Comparison Between Linear Programming And Integer Linear Programming: A Review by Sam, Mei Lee, Saptari, Adi, Salleh, Mohd Rizal, Mohamad, Effendi

    Published 2018
    “…Meanwhile, heuristics outperform exact algorithms in solving large sized problem where it can obtain near optimal solution in an acceptable computational time. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Prevention And Detection Mechanism For Security In Passive Rfid System

    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
    Save to List
    Saved in:
  5. 5
    Automatic generation of content security policy to mitigate cross site scripting

    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
    Save to List
    Saved in:
  6. 6
    Deterministic and stochastic inventory routing problems with backorders using artificial bee colony / Huda Zuhrah Ab Halim

    Deterministic and stochastic inventory routing problems with backorders using artificial bee colony / Huda Zuhrah Ab Halim by Huda Zuhrah , Ab Halim

    Published 2019
    “…A new MILP for DSIRPB is formulated and used within the algorithm. The DSIRPB is modeled as stochastic dynamic programming and solved using hybrid rollout algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Development of dynamic programming algorithm for maintenance scheduling problem

    Development of dynamic programming algorithm for maintenance scheduling problem by Zafira Adlia, Mohd Fauzi

    Published 2020
    “…The objectives of this research are to develop a dynamic programming algorithm for the maintenance scheduling problem that can deal with the uncertainty and to determine the optimum maintenance schedule that will change according to the uncertainty that happened. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems

    An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems by Watada, J., Roy, A., Wang, B., Tan, S.C., Xu, B.

    Published 2020
    “…In the current work, we devised a hybrid method involving a Double-Layer Neural Network (DLNN) for solving a quadratic Bi-Level Programming Problem (BLPP). For an efficient and effective solution of such problems, the proposed potential methodology includes an improved Artificial Bee Colony (ABC) algorithm, a Hopfield Network (HN), and a Boltzmann Machine (BM). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A method for group formation using genetic algorithm

    A method for group formation using genetic algorithm by Che Ani, Zhamri, Yasin, Azman, Husin, Mohd Zabidin, Abdul Hamid, Zauridah

    Published 2010
    “…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to enter industry because by working in group, it can reduce the individual workload, improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language, most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in programming.This paper presents a method for group formation using genetic algorithm, where the members for each group will be generated based on the students’ programming skill.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    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
    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
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Agent-based extraction algorithm for computational problem solving

    Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

    Published 2015
    “…Modeling Computational Problem Solving (CPS) is the main issue in teaching programming where the given text is needed to be transformed into a model then later into a programming language. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun

    Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun by Harun, Hazaruddin

    Published 2015
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Invigilation timetabling system using genetic algorithm (GA) / Shahirah Mohamed Hatim

    Invigilation timetabling system using genetic algorithm (GA) / Shahirah Mohamed Hatim by Shahirah, Mohamed Hatim

    Published 2011
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail

    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail by Ismail, Zafhira

    Published 2017
    “…The input data of this project is retrieved from the game’s rule itself and implemented with the proposed algorithm which is A* algorithm. The output of this project is the best solution to achieve the goal using A* algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Finding multi-constrained path using genetic algorithm

    Finding multi-constrained path using genetic algorithm by Yussof S., See O.H.

    Published 2023
    Conference paper
    Save to List
    Saved in:
  18. 18
    Hybrid genetic algorithms and line search method for industrial production planning with non-linear fitness function

    Hybrid genetic algorithms and line search method for industrial production planning with non-linear fitness function by Vasant, Pandian

    Published 2009
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    A genetic algorithm approach for timetabling problem: the time group strategy

    A genetic algorithm approach for timetabling problem: the time group strategy by Md Sultan, Abu Bakar, Mahmod, Ramlan, Sulaiman, Md. Nasir, Abu Bakar, Mohd Rizam

    Published 2004
    “…The university timetabling problems (TTP) deal with the scheduling of the teaching program. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Group formation using genetic algorithm

    Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

    Published 2009
    “…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to industry because by working in group, it can reduce the individual workload,improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:

Search Tools: