Search Results - (( problem model selection algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2

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

    Published 2011
    “…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
  3. 3

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

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

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

    Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

    Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Support Vector Machine (SVM) is a present day classification approach originated from statistical approaches.Two main problems that influence the performance of SVM are selecting feature subset and SVM model selection. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

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

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    SURE-Autometrics algorithm for model selection in multiple equations by Norhayati, Yusof

    Published 2016
    “…This automatic model selection algorithm is better than non-algorithm procedure which requires knowledge and extra time. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Model structure selection for a discrete-time non-linear system using genetic algorithm by Ahmad, Robiah, Jamaluddin , Hishamuddin, Hussain, Mohd. Azlan

    Published 2004
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Algorithmic approaches in model selection of the air passengers flows data by Ismail, Suzilah, Yusof, Norhayati, Tuan Muda, Tuan Zalizam

    Published 2015
    “…Algorithm is an important element in any problem solving situation.In statistical modelling strategy, the algorithm provides a step by step process in model building, model testing, choosing the ‘best’ model and even forecasting using the chosen model.Tacit knowledge has contributed to the existence of a huge variability in manual modelling process especially between expert and non-expert modellers.Many algorithms (automated model selection) have been developed to bridge the gap either through single or multiple equation modelling.This study aims to evaluate the forecasting performances of several selected algorithms on air passengers flow data based on Root Mean Square Error (RMSE) and Geometric Root Mean Square Error (GRMSE).The findings show that multiple models selection performed well in one and two step-ahead forecast but was outperformed by single model in three step-ahead forecasts.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Article
  15. 15

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Article
  16. 16

    Development of committee machine models for multiple response optimization problems by Golestaneh, Seyed Jafar

    Published 2014
    “…Four methodologies are to make four different CM models to solve MRO problems. The fifth methodology proposes the final algorithm which uses four CM models together to solve MRO problems. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach by N. M., Razali

    Published 2014
    “…The process sequencing problem can be modeled as the travelling salesman problem with precedence constraints (TSPPC). …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Dynamic Robust Bootstrap Algorithm for Linear Model Selection Using Least Trimmed Squares by Uraibi, Hassan Sami

    Published 2009
    “…The results show that the DRBLTS is more efficient than other estimators discussed in this thesis. The results on the model selection again signify that our proposed robust bootstrap model selection method is more robust than the classical bootstrap model selection.…”
    Get full text
    Get full text
    Thesis
  20. 20