Search Results - (( development _ sparse 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
    “…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
  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

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

    Proximal linearized method for sparse equity portfolio optimization with minimum transaction cost by Sim, Hong Seng, Ling, Wendy Shin Yie, Leong, Wah June, Chen, Chuei Yee

    Published 2023
    “…The complexity of the model calls for proximal method, which allows us to handle the objective terms separately via the corresponding proximal operators. We develop an efficient algorithm to find the optimal portfolio and prove its global convergence. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

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

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

    Blind Source Separation Using Two-Dimensional Nonnegative Matrix Factorization In Biomedical Field by Toh, Cheng Chuan

    Published 2018
    “…This represents sparseness constraints yield to decrease ambiguity and provide uniqueness to the model.In comparison in between β-divergence,α-divergence,sparse β-divergence and sparse α-divergence NMF2D,it found that SDR value of sparse α-divergence NMF2D is the best decomposition method among all divergences.This can be concluded that sparse α-divergence NMF2D is more applicable in separating real data recording.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Identification of the continuous-time Hammerstein models with sparse measurement data using improved marine predators algorithm by Mohd Zaidi, Mohd Tumari, Mohd Ashraf, Ahmad, Zaharuddin, Mohamed

    Published 2024
    “…Therefore, this study introduced data-driven modeling for continuous-time Hammerstein models in the presence of sparse measurement data. The analysis employed the random average marine predators algorithm (RAMPA) with a tunable step-size adaptive coefficient (CF) (RAMPA-TCF), which offers significant advantages over the conventional MPA by preventing stagnation in the local optima and enhancing the balance between the exploration and exploitation stages. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  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

    Image denoising using combined higher order non-convex total variation with overlapping group sparsity by Adam, Tarmizi, Paramesran, Raveendran

    Published 2019
    “…To solve the proposed image restoration model, we develop an iteratively re-weighted ℓ1 based alternating direction method of multipliers algorithm to deal with the constraints and subproblems. …”
    Get full text
    Get full text
    Article
  12. 12

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

    Taylor-Bird Swarm Optimization-Based Deep Belief Network For Medical Data Classification by Mohammed, Alhassan Afnan

    Published 2022
    “…Then, the selected features are given as input to the DBN classifier which is trained using the Taylor-based bird swarm algorithm (Taylor-BSA). Taylor-BSA is designed by combining the Taylor series and bird swarm algorithm (BSA).…”
    Get full text
    Get full text
    Thesis
  14. 14

    Multi-Hop Selective Constructive Interference Flooding Protocol For Wireless Sensor Networks by Alhalabi, Huda A. H.

    Published 2019
    “…The first step of the proposed protocol involves the development of an energy efficient clustering algorithm which is appropriate for WSN with a sparse density topology. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Scene classification for aerial images based on CNN using sparse coding technique by Qayyum, A., Malik, A.S., Saad, N.M., Iqbal, M., Faris Abdullah, M., Rasheed, W., Rashid Abdullah, T.A., Bin Jafaar, M.Y.

    Published 2017
    “…However, cataloguing presents a fundamental problem for high-resolution remote-sensing imagery (HRRS). Recent developments include several approaches and numerous algorithms address the task. …”
    Get full text
    Get full text
    Article
  17. 17

    Hardware development of autonomous mobile robot based on actuating lidar by Mohd Romlay, Muhammad Rabani, Mohd Ibrahim, Azhar, Toha, Siti Fauziah, Rashid, Muhammad Mahbubur, Ahmad, Muhammad Syahmi

    Published 2022
    “…As opposed to a point cloud generated from high-end LiDAR sensors where many algorithms have been developed for object detection, sparse LiDAR point clouds still possess large room for improvement. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Semi-supervised learning for feature selection and classification of data / Ganesh Krishnasamy by Ganesh , Krishnasamy

    Published 2019
    “…An efficient iterative algorithm is developed to optimize the objective function of the proposed algorithm since it is non-smooth and difficult to solve. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Speech compression using compressive sensing on a multicore system by Gunawan, Teddy Surya, Khalifa, Othman Omran, Shafie, Amir Akramin, Ambikairajah, Eliathamby

    Published 2011
    “…In this paper, a novel algorithm for speech coding utilizing CS principle is developed. …”
    Get full text
    Get full text
    Proceeding Paper
  20. 20

    Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

    Published 2010
    “…Thus far, a few efficient interactive mining algorithms have been proposed. However, their runtime do not fulfill the need of short runtime in real time applications especially where data is sparse and proper frequent patterns are mined with very low values of minsup. …”
    Get full text
    Get full text
    Thesis