Search Results - (( developing starter _ algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

    Butterfly Triple System Algorithm Based on Graph Theory by Ibrahim, Haslinda, Aldiabat, Raja’i, Karim, Sharmila

    Published 2022
    “…Basically, in this algorithm development, a starter of cyclic near-resolvable ((v-1)/2)-cycle system of the 2-fold complete graph 2Kvis employed to construct the starter of cyclic ((v-1)/2)-star decomposition of 2Kv. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation by Karim, Sharmila, Ibrahim, Haslinda

    Published 2021
    “…This new algorithm is still in the early stage and under development for the generation of the half wing of butterfly representation. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3
  4. 4

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  6. 6

    New algorithm for listing all permutations by Ibrahim, Haslinda, Omar, Zurni, Mohd Rohni, Azizah

    Published 2010
    “…In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    A new starter sets generation method by fixing any element under exchange restriction by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni, Sapiri, Hasimah

    Published 2016
    “…A new method is developed for starter sets generation namely STARSET2 based on exchange where any element can be selected randomly to be fixed.The result showed that no redundancy of starter sets is occurring and no equivalence starter sets are obtained.…”
    Get full text
    Get full text
    Article
  8. 8

    A new method for starter sets generation by fixing any element by Karim, Sharmila, Ibrahim, Haslinda, Sapiri, Hasimah

    Published 2015
    “…a new permutation technique based on distinct starter sets was introduced by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile new strategies for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method.However all these algorithms have limitations in terms of fixing element to construct the first set (starter set) to begin with.It would be interesting to derive new strategy by fixing an element in any position. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    SEALiP: A simple and efficient algorithm for listing permutation via starter set method by Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila

    Published 2013
    “…Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Parallel strategy for starter sets to list all permutation based on cycling restriction by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar

    Published 2011
    “…This paper presents a parallel implementation of a new permutation generation method.This permutation generation method is based on the starter sets for listing all the n! permutations.The sequential algorithm is developed and parallelized for parallel computing by integrating with Message Passing Interface (MPI) libraries. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Generalized Triad Design Algorithms by Saa, Tareq Mohammad Abu

    Published 2012
    “…In addition, new constructions for the starter of a compatible factorization on v objects, a SCF(v), and new algorithms for a CF(v) was developed. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Developing triad design algorithms based on compatible factorization by Ibrahim, Haslinda, Omar, Zurni, Abdul Rahim, Rahela

    Published 2011
    “…These processes have helped us develop algorithm for triad design, the objective of this study.A new technique for triad design algorithm, known as Interval Generation Method was employed to construct TD(6n + 1) and TD(6n + 5).This method depends on analyzing the pattern of triples in the design to build starters.We begin by producing starters from Interval Generation Method as the initial block to begin with.Then the algorithm begins by cycling modular v from the initial block and finishes when the process approaches the initial block.The algorithms for TD(6n+1) and TD(6n+5) are presented in Chapter 4 and 5, respectively.As the entire study depends mainly on TD(v) algorithms, new and remarkable theorems and lemmas for TD(v) development are presented and proved.…”
    Get full text
    Get full text
    Get full text
    Monograph
  13. 13

    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. …”
    Review
  14. 14

    Three phase induction motor coupled to DC motor in hybrid electric vehicle application by Zulkarnain, Lubis

    Published 2011
    “…The DC starter-generator has been tested in both motoring (engine starting) and generating modes with the starter-generator mounted in the vehicle. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  17. 17

    A new parallel model for starter sets generation via exchanging two elements by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2019
    “…In this study, a technique of parallelization across the method was employed to develop new parallel algorithm for finding all permutations under exchanged restrictions. …”
    Get full text
    Get full text
    Article
  18. 18

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph