Search Results - (( problem using ((dea algorithm) OR (new algorithm)) ) OR ( java application testing algorithm ))

Refine Results
  1. 1

    Classification System for Heart Disease Using Bayesian Classifier by Magendram, Anusha

    Published 2007
    “…This is a new approach that able to use by doctors to rectify the heart problem. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Developing an intelligent system to acquire meeting knowledge in problem-based learning environments by Chiang, A., Baba, M.S.

    Published 2006
    “…Similarly, the algorithm proposed in MALESAbrain can, be used to deal, the problem of conducting a meeting among learners to solve problems. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

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

    Published 2011
    “…The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

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

    Published 2012
    “…The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
    Get full text
    Get full text
    Get full text
    Monograph
  5. 5

    Development of bi-objective optimization model for supply chain network design using data envelopment analysis by Rahimi, Iman

    Published 2017
    “…Facility efficiency is recently focused by some scholars as a new objective in supply chain network. With this, network DEA has been introduced as the best model to solve this problem. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…On the Construction phase, the development of the prototype has been started. All the algorithm for the engine has been developed by using Java script language. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    “…Sequential pattern mining is a new branch of data, mining science that solves inter-transaction pattern mining problems. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

    Published 2011
    “…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  9. 9

    Modeling eco-efficiency changes of heterogeneous firms with an application in power plants / Behrouz Arabi by Arabi, Behrouz

    Published 2013
    “…This study introduces an algorithm accompanied by a slack-based model to tackle the infeasibility problem. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Optimization Of Fractional-Slot Permanent Magnet Synchronous Machine Using Analytical Sub-Domain Model And Differential Evolution by Mohamed, Mohd Rezal

    Published 2019
    “…In order to reduce the repetitive and redundancy works, the optimization tool is deployed to solve this problem. Three multi-objective optimizations based on Analytical Sub-Domain (ASD) and Differential Evolution Algorithm (DEA), Analytical Sub-Domain (ASD) and Particle Swarm Optimization (PSO), Analytical Sub-Domain (ASD) and Genetic Algorithm (GA), for fractionalslot Permanent Magnet Synchronous Machines (PMSM) are formulated, computed and optimized. …”
    Get full text
    Get full text
    Thesis
  11. 11

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
  12. 12

    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application by Yana Aditia, Gerhana, Nur, Lukman, Arief Fatchul, Huda, Cecep Nurul, Alam, Undang, Syaripudin, Devi, Novitasari

    Published 2020
    “…Performance Testing is used to test the performance of algorithm implementations in applications. …”
    Get full text
    Get full text
    Journal
  13. 13

    Development of a systematic method in lean tool selection for automotive industry by Anvari, Alireza

    Published 2012
    “…Based on the systematic features of this algorithm, the efficiency and effectiveness of the model in presenting optimizing techniques for lean tool selection with the automotive industry seems reasonable and useful. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Implementation of (AES) Advanced Encryption Standard algorithm in communication application by Moh, Heng Huong

    Published 2014
    “…The concept of ABS algorithm was firstly studied, including the definition, historical background, and a brief comparison was made between the ABS algorithm with other types of algorithm. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  16. 16

    Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

    Published 2004
    “…The new algorithms also boast faster contractions. Both new algorithms performed better than DISOPE. …”
    Get full text
    Get full text
    Monograph
  17. 17

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

    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2018
    “…The new hybrid algorithm has been applied on different cases of Knapsack problem with different dimensions. 20 case studies have been evaluated by the new hybrid algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…The solutions to both parts are discussed in details in this thesis. These new parallel and sequential finite difference time domain (FDTD) algorithms yield from O(h2), ordinary O(h4) and weighted average O(h4) centered difference discretization using direct-domain and temporary-domain are used to solve problems mentioned above. …”
    Get full text
    Get full text
    Thesis
  20. 20