Search Results - (( using permutation parallel algorithm ) OR ( java selection based algorithm ))

Search alternatives:

Refine Results
  1. 1

    The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2013
    “…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network by Othman, Mohamed, Abdullah, Monir, Johari, Rozita

    Published 2008
    “…In this paper, a new parallel algorithm of the window method is developed called the Balanced Parallel Window Method (BPWM) algorithm. …”
    Get full text
    Get full text
    Article
  4. 4

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
  5. 5

    New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

    Published 2013
    “…The computation times in the newly developed sequential methods were dominated by generating starter sets. Therefore, two parallel strategies were developed to parallelise this algorithm so as to reduce the computation times. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Java based expert system for selection of natural fibre composite materials by Ahmed Ali, Basheer A., Salit, Mohd Sapuan, Zainudin, Edi Syams, Othman, Mohamed

    Published 2013
    “…Computer oriented materials selection and knowledge-based expert systems are the prevailing approach in materials selection. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

    Published 2007
    “…Under the constraint of avoiding crosstalk, the interests of these algorithms are to find a permutation that uses a minimum number of passes and minimum execution time. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

    Published 2005
    “…In Zero algorithms, there are three types of algorithms namely; The Zero X, Zero Y and zeroXY algorithms. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks by Moudi, Mehrnaz

    Published 2012
    “…Under the constraint of avoiding crosstalk, what we have been interested is how to realize a permutation that will use the minimum number of passes, the minimum execution time and the maximum bandwidth to route the input request to output without crosstalk. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
    Get full text
    Get full text
    Article
  11. 11

    Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

    Published 2015
    “…But, the computer oriented materials selection and knowledge-based expert systems are the robust approach in materials selection to handle huge amount of materials of choice. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Application of genetic algorithm and JFugue in an evolutionary music generator by Tang, Jia Rou

    Published 2025
    “…This project explores the application of Genetic Algorithms (GA) with JFugue, which is a Java-based music programming library to develop an Evolutionary Music Generator. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  13. 13

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

    Published 2012
    “…EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form. …”
    Get full text
    Get full text
    Get full text
    Monograph
  14. 14

    An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

    Published 2015
    “…Recently, various techniques based on different algorithms have been developed. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…The selected methodology for the application development is based on prototyping methodology. …”
    Get full text
    Get full text
    Final Year Project
  16. 16

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

    Published 2011
    “…EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Software metrics selection model for predicting maintainability of object-oriented software using genetic algorithms by Bakar, Abubakar Diwani

    Published 2016
    “…The latest effort to solve this selection problem is the development of the metrics selection model that uses genetic algorithm (GA). …”
    Get full text
    Get full text
    Thesis
  18. 18

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

    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

    Published 2023
    “…Flexible job shop scheduling problem (FJSP) is a common optimisation problem in the industry. The use of parallel machines allows an operation to be executed on a machine assigned from a set of alternative machines, raising a combination of machine assignment and job sequencing sub-problems. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…In the software development testing we examine image based clustering, as we can used clustering by distance base, by pixel (red, green, blue) value etc., The problem is solved by region based method which is based on connect component and background detection techniques. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis