Search Results - (( developing classical selection algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2

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

    Published 2009
    “…We modified the classical bootstrapping algorithm by developing a mechanism based on the robust LTS method to detect the correct number of outliers in the each bootstrap sample. …”
    Get full text
    Get full text
    Thesis
  3. 3

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

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

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

    A comprehensive overview of classical and modern route planning algorithms for self-driving mobile robots by Wan Daud, Wan Mohd Bukhari, Abu, Nur Syuhadah, Omar, Siti Nashayu, Sohaimeh, Shahirul Ashraf, Adli,, M. H.

    Published 2022
    “…Classical or traditional methods, such as Roadmaps (Visibility Graph and Voronoi Diagram), Potential Fields, and Cell Decomposition, and modern methodologies such as heuristic-based (Dijkstra Method, A* Algorithms, and D* Algorithms), metaheuristics algorithms (such as PSO, Bat Algorithm, ACO, and Genetic Algorithm), and neural systems such as fuzzy neural networks or fuzzy logic (FL) and Artificial Neural Networks (ANN) are described in this report. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

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

    Robust diagnostics and variable selection procedure based on modified reweighted fast consistent and high breakdown estimator for high dimensional data by Baba, Ishaq Abdullahi

    Published 2022
    “…However, in practice, high leverage points may lead to misleading results in solving variable selection problems. Therefore, a robust sure independence screening procedure based on the weighted correlation algorithm of MRFCH for high dimensional data is developed to address this problem. …”
    Get full text
    Get full text
    Thesis
  10. 10

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

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

    Improved TLBO-JAYA Algorithm for Subset Feature Selection and Parameter Optimisation in Intrusion Detection System by Aljanabi, Mohammad, Mohd Arfian, Ismail, Mezhuyev, Vitaliy

    Published 2020
    “…Many optimisation-based intrusion detection algorithms have been developed and are widely used for intrusion identification. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Kernel and multi-class classifiers for multi-floor wlan localisation by Abd Rahman, Mohd Amiruddin

    Published 2016
    “…For fingerprint database optimisation, novel access point (AP) selection algorithms which are based on variant AP selection are investigated to improve computational accuracy compared to existing AP selection algorithms such as Max-Mean and InfoGain. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Hybrid Harmony Search Algorithm with Grey Wolf Optimizer and Modified Opposition-based Learning by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Aloufi, Khalid, Kamal Z., Zamli

    Published 2019
    “…In this paper, a hybrid algorithm of HS with grey wolf optimizer (GWO) has been developed to solve the problem of HS parameter selection. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Improvement of Neural Network performance by data selection using Radial Basis Function and Hybrid Multilayered Perceptron network / Ahmad Puad Ismail, Nazirah Mohamat Kasim and S... by Ismail, Ahmad Puad, Mohamat Kasim, Nazirah, Yahaya, Saiful Zaimy

    Published 2008
    “…This thesis presents the implementation of Radial Basis Function (RBF) and Hybrid Multilayered Perceptron(HMLP) Neural Network for a classical controller modeling. The word modeling means to develop or to model the controller by using the RBF and HMLP Neural Network that has the ability to predict the output just like the classical controller. …”
    Get full text
    Get full text
    Research Reports
  16. 16

    Optimal reactive power dispatch using multistage artificial immune system by Nordin N.F., Mansor M.H., Kamil K., Roslan N.

    Published 2023
    “…This process includes cloning and mutation as well as selection. These modifications also aid in the development of new and unique solutions, as opposed to the classical AIS optimization process. …”
    Article
  17. 17
  18. 18

    Cognitive selection mechanism performance in IEEE 802.11 WLAN by Hashim, Wahidah, Ismail, Ahmad Fadzil, Ghafar, Nadratul, Dzulkifly, Sumayyah

    Published 2013
    “…The enhancement reaped from the developed selection algorithm is expected to bring benefit to different user at various places…”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Robust variable selection methods for large- scale data in the presence of multicollinearity, autocorrelated errors and outliers by Uraibi, Hassan S.

    Published 2016
    “…We develop Robust Forward Selection algorithm based on RFCH correlation coefficient (RFS.RFCH) because FS.Winso is not robust to multivariate outliers. …”
    Get full text
    Get full text
    Thesis
  20. 20