Search Results - (( variables solution clustering algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The optimal results obtained for constrained engineering problems as well as data clustering are very promising in terms of quality of solutions and convergence speed of the algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…In general, genetic based clustering algorithms showed the ability to reach near global optimal solution. …”
    Get full text
    Get full text
    Thesis
  4. 4

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

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

    Data dissemination in VANETs using clustering and probabilistic forwarding based on adaptive jumping multi-objective firefly optimization by Hamdi, Mustafa Maad, Audah, Lukman, Rashid, Sami Abduljabbar

    Published 2022
    “…The solution space design in CFM combined two variables: the first is the probability of forwarding and the second is the maximum number of nodes within one cluster. …”
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    Hyper-heuristic approaches for data stream-based iIntrusion detection in the Internet of Things by Hadi, Ahmed Adnan

    Published 2022
    “…Here, the memory consumption can be reduced by enabling a feature selection algorithm that excludes nonrelevant features and preserves the relevant ones. the algorithm is developed based on the variable length of the PSO. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Application of Optimization Methods for Solving Clustering and Classification Problems by Shabanzadeh, Parvaneh

    Published 2011
    “…Next the problem of data classification is studied as a problem of global, non-smooth and non-convex optimization; this approach consists of describing clusters for the given training sets. The data vectors are assigned to the closest cluster and correspondingly to the set, which contains this cluster and an algorithm based on a derivative-free method is applied to the solution of this problem. …”
    Get full text
    Get full text
    Thesis
  10. 10

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

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

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

    Modeling flood occurences using soft computing technique in southern strip of Caspian Sea Watershed by Borujeni, Sattar Chavoshi

    Published 2012
    “…In conventional hard clustering approach, the number of clusters was determined by hierarchical clustering and two-step cluster analysis; then the sites were allocated to the appropriate cluster by k-means clustering method. …”
    Get full text
    Get full text
    Thesis
  14. 14

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

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

    Application Of Higher Order Compact Finite Difference Methods To Problems In Fluid Dynamics by Yap, Wen Jiun

    Published 2003
    “…These unknowns are solved explicitly with Hermitian relations that relate the variables and its spatial derivatives. The numerical algorithms are first developed for viscous Burgers' equation on uniform and clustered grids. …”
    Get full text
    Get full text
    Thesis
  17. 17

    An ensemble of neural network and modified grey wolf optimizer for stock prediction by Das, Debashish

    Published 2019
    “…Additionally, the research restricts the number of variables through feature selection to enhance the performance of the algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…To achieve energy efficiency, it compresses the packet information by using GZIP tools in JAVA. SecPath is evaluated with several variations using 400 nodes in WSN deployments as well as large-scale simulations. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…To achieve energy efficiency, it compresses the packet information by using GZIP tools in JAVA. Energy efficient iPath (E-iPath) is evaluated with several variations of nodes in WSN deployments as well as large-scale simulations. …”
    Get full text
    Get full text
    Get full text
    Article