Search Results - (( initial solving data algorithm ) OR ( parallel optimization path algorithm ))

Refine Results
  1. 1

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
  2. 2
  3. 3
  4. 4

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

    Published 2022
    “…In 2011, a new metaheuristic known as Strawberry algorithm (SBA) was initiated. Since then, it has been vastly applied to solve engineering problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

    Published 2008
    “…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
    Get full text
    Thesis
  7. 7
  8. 8

    A Hybrid ant colony optimization algorithm for solving a highly constrained nurse rostering problem by Ramli, Razamin, Abd Rahman, Rosshairy, Rohim, Nurdalila

    Published 2019
    “…The hybridization with the hill climbing is aiming at fine-tuning the initial solution or roster generated by the ACO algorithm to achieve better rosters. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules by Rizauddin, Saian

    Published 2013
    “…Classification rule induction is one of the problems solved by the Ant-miner algorithm, a variant of ACO, which was initiated by Parpinelli in 2001. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12

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

    Published 2011
    “…Specifically, we will focus on new optimization methods for solving clustering and classification problems. First we briefly give some data analysis background. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…Although the swmcan algorithm solves the noise problem in multi-view data, its initial and final graphs are independent and cannot learn from each other. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Sports tournament scheduling using genetic algorithm / Hafeezur Syakir Abdul Motok@Mohd Ridzuan by Abdul Motok@Mohd Ridzuan, Hafeezur Syakir

    Published 2020
    “…In this report, a Genetic Algorithm (GA) is applied for solving University sports timetabling problems. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Solving an application of university course timetabling problem by using genetic algorithm by Norhana, Shaibatul Khadri

    Published 2022
    “…Among the approaches, genetic algorithm (GA), constructed based on Darwin's theory of evolution, becomes the renowned approach to solve various types of timetabling problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

    Published 2020
    “…Many fields such as data science, data mining suffered from the rapid growth of data volume and high data dimensionality. …”
    Get full text
    Get full text
    Article
  17. 17

    Vehicle Routing Problem with Simultaneous Pickup and Delivery by Sze, San Nah, Sek, Siaw Ying Doreen, Sze, Jeeu Fong, Cheah, Wai Shiang, Chiew, Kang Leng

    Published 2020
    “…It is one of the most popular solutions to solve a complex problem. In this research, the algorithm solution consists of two main phases. …”
    Get full text
    Get full text
    Article
  18. 18

    Fuzzy clustering method and evaluation based on multi criteria decision making technique by Sameer, Fadhaa Othman

    Published 2018
    “…The proposed algorithm is used as a pre-processing method for data followed by Gustafson-Kessel (GK) algorithm to classify credit scoring data. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    3D Point Cloud Data Registration Algorithm Based on Augmented Reality Technology by Liying Feng, Ng Giap Weng, Liyao Ma

    Published 2023
    “…In order to solve the above problems, a 3D point cloud data registration algorithm based on augmented reality technology is proposed, and the 3D data registration model is constructed by combining augmented reality technology, build the evaluation index of 3D point cloud data registration, and carry out the initial registration of 3D point cloud based on the evaluation index. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by N. A., Isa, S. A., Bareduan, A. S., Zainudin, M., Marsudi

    Published 2021
    “…To date, the Nawaz-Enscore-Ham (NEH) algorithm is still recognized as the best heuristic in solving makespan problem in scheduling environment. …”
    Get full text
    Get full text
    Article