Search Results - optimal ((colony algorithm) OR (((((tree algorithm) OR (_ algorithm))) OR (graph algorithm))))

Search alternatives:

Refine Results
  1. 1
    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…However, the traditional Dijkstra’s is not accurate and need more time to perform the path in order it should visit all the nodes in the graph. In this paper, the Dijkstra-ant colony algorithm (ACO) with binary search tree (BST) has been proposed. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences

    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

    Published 2024
    Subjects: “…Ant colony optimization…”
    journal::journal article
    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
    A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid

    A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid by Mohammad Zahid, Munashahira

    Published 2024
    “…The Reverse-Delete algorithm works in reverse; it starts with the full graph and iteratively removes the largest edges, ensuring that the graph remains connected. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    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
    “…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling

    Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling by Shimailawi, Shatha Abdulhadi Muthana

    Published 2022
    “…Friedman test using GRG metric shows significant better performance (p-values<0.05) for PACS algorithm compared to benchmark algorithms. The proposed models and algorithm can be used to solve the multi-objective GMS problem while the new parameters’ values can be used to obtain optimal or near optimal maintenance scheduling of generators. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in the graph. This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Path Optimization For Cooperative Multi-Head 3d Printing

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…Two well-known algorithms for solving a closely related graph theory problem known as the Travelling Salesman Problem (TSP) are the Ant System (AS) and Ant Colony System (ACS) algorithms. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  11. 11
    A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network

    A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Che, Yahaya, Roslina, Abdul Hamid

    Published 2018
    “…The Ant Colony Optimization (ACO) Algorithm has been adapted for the protein functional module detection by modeling the problem as an optimization problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    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
    “…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  13. 13
    A class skew-insensitive ACO-based decision tree algorithm for imbalanced data sets

    A class skew-insensitive ACO-based decision tree algorithm for imbalanced data sets by Mohd Razali, Muhamad Hasbullah, Saian, Rizauddin, Yap, Bee Wah, Ku-Mahamud, Ku Ruhana

    Published 2021
    “…This study proposed an enhanced algorithm called hellingerant-tree-miner (HATM) which is inspired by ant colony optimization (ACO) metaheuristic for imbalanced learning using decision tree classification algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…The objectives of this study are to explore and evaluate the Ant System (AS) algorithm and Ant Colony System (ACS) algorithm in finding shortest paths. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…The main algorithms involve is Dijkstra’s algorithm and then an Ant Colony Optimization algorithm is used as hybrid versions of Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    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:
  18. 18
    Intrusion Detection Systems, Issues, Challenges, and Needs

    Intrusion Detection Systems, Issues, Challenges, and Needs by Aljanabi, Mohammad, Mohd Arfian, Ismail, Ali, Ahmed Hussein

    Published 2021
    “…Such parameters are C in SVM and gamma which effect the performance of SVM if not tuned well. Optimization algorithms such as genetic algorithm (GA), particle swarm optimization (PSO) algorithm , ant colony algorithm, and many other algorithms are used along with classifiers to improve the work of these classifiers in detecting intrusion and to increase the performance of these classifiers. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    A Modified ACO-based Search Algorithm for Detecting Protein Functional Module From Protein Interaction Network

    A Modified ACO-based Search Algorithm for Detecting Protein Functional Module From Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Roslina, Abd Hamid

    Published 2015
    “…The Ant Colony Optimization (ACO) Algorithm has been adapted for the protein functional module detection by modeling the problem as an optimization problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    An efficient multi join query optimization for relational database management system using swarm intelligence approaches

    An efficient multi join query optimization for relational database management system using swarm intelligence approaches by Alsaedi, Ahmed Khalaf Zager

    Published 2016
    “…A directed acyclic graph, based on materialized query graph, aids in the optimization of algorithms and solving MJQO by removing non-promising QEP, which decreases the QEP combination space. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: