Search Results - (( development concept method algorithm ) OR ( java simulation optimization algorithm ))

Search alternatives:

Refine Results
  1. 1
    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…The simulation is implemented with iFogSim and java programming language. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing

    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
    Save to List
    Saved in:
  3. 3
    Ant colony optimization algorithm for load balancing in grid computing

    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
    Save to List
    Saved in:
  4. 4
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    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
    Save to List
    Saved in:
  5. 5
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  6. 6
    Features selection for intrusion detection system using hybridize PSO-SVM

    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
    Save to List
    Saved in:
  7. 7
    Resource management in grid computing using ant colony optimization

    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
    Save to List
    Saved in:
  8. 8
    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter

    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
    Save to List
    Saved in:
  9. 9
    Algorithms for extracting adjacency matrix based on Formal Concept Analysis (FCA)

    Algorithms for extracting adjacency matrix based on Formal Concept Analysis (FCA) by Hasni, Hassan, Aznida Hayati, Zakaria@Mohamad, Mohd Isa, Awang, Mokhairi, Makhtar, Rohana, Ismail, Fadhilah, Ahmad

    Published 2017
    “…However, the focus of the paper is on a method proposed to extract adjacency matrix from concepts obtained from the theory of Formal Concept Analysis (FCA) using two consecutive algorithms called the Relatedness Algorithm and Adjacency Matrix Algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations

    New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations by Adeyeye, Oluwaseun, Omar, Zurni

    Published 2018
    “…This new algorithm utilizes the concept from the conventional Taylor series approach of developing linear multistep methods.Certain examples are given to show the simplicity involved in the usage of this new generalized algorithm.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment

    SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment by Murad, Saydul Akbar, Zafril Rizal, M. Azmi, Muzahid, Abu Jafar Md, Bhuiyan, Md Khairul Bashar, Saib, Md, Rahimi, Nick, Prottasha, Nusrat Jahan, Bairagi, Anupam Kumar

    Published 2024
    “…To conduct this experiment, we employed the CloudSim simulator, which is implemented using the Java programming language.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    SEALiP: A simple and efficient algorithm for listing permutation via starter set method

    SEALiP: A simple and efficient algorithm for listing permutation via starter set method by Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila

    Published 2013
    “…In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Analyzing students’ experience in programming with computational thinking through competitive, physical, and tactile games: The quadrilateral method approach

    Analyzing students’ experience in programming with computational thinking through competitive, physical, and tactile games: The quadrilateral method approach by Habib, M. A. a, Raja-Yusof, R. -J., Salim, S. S.a, Sani, A. A. a, Sofian, H., Abu Bakar, A.

    Published 2021
    “…We have conducted game activities through several algorithms that include sorting, swapping, and graph algorithms and analyzed how the game affects the student experience (SX) in understanding the CT concept in those algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Development and applications of metaheuristic algorithms in engineering design and structural optimization / Ali Sadollah

    Development and applications of metaheuristic algorithms in engineering design and structural optimization / Ali Sadollah by Ali, Sadollah

    Published 2013
    “…In addition, two novel optimization methods are developed and presented which are named the mine blast algorithm (MBA) and the water cycle algorithm (WCA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…The methodology starts with literature comprehension studies on the computation pitfalls and existed augmentation studies of Simplex algorithm. Then, followed by concept development which consists of concept extraction, computation stages classification and algorithms integration. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Experimental Model for Teaching Software Testing

    Experimental Model for Teaching Software Testing by Kamal Z., Zamli, Hasneeza, L. Zakaria

    Published 2015
    “…In this paper, we propose the concept of teaching software testing with an experimental model for pairwise testing; developed with Migrating Birds Optimization (MBO) algorithm called Experimental Model for Teaching Software Testing (EMTST). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing

    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
    Save to List
    Saved in:
  18. 18
    Coalition of genetic algorithms and artificial neural network for isolated spoken Malay speech recognition / Noraini Seman

    Coalition of genetic algorithms and artificial neural network for isolated spoken Malay speech recognition / Noraini Seman by Seman, Noraini

    Published 2012
    “…Despite all of the advances in the speech recognition area, the problem is far from being completely solved. Various methods have been introduced to develop an efficient ASR system. …”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  19. 19
    Optimizing Ram Testing Method For Test Time Saving Using Automatic Test Equipment

    Optimizing Ram Testing Method For Test Time Saving Using Automatic Test Equipment by Kesavan Prabagaran, Premkumar

    Published 2017
    “…A memory Build-in Self-test (BIST) design with capability of algorithm failing sequence capture have been developed to implement in the Automate Test Equipment (ATE) flow for production screen. 3 selected algorithm have been tested on the 8 detect units in ATE flow to prove the concept of this method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Even-odd scheduling based energy efficient routing for wireless sensor network (WSN) / Muhammad Zafar Iqbal Khan

    Even-odd scheduling based energy efficient routing for wireless sensor network (WSN) / Muhammad Zafar Iqbal Khan by Khan, Muhammad Zafar Iqbal

    Published 2022
    “…Using the simulation software, it was observed that the alive nodes are higher in numbers i.e. 189 nodes after 500 rounds for the proposed routing algorithm compared to the previous methods which had only 150 alive nodes. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: