Search Results - (( using function a algorithm ) OR ( net optimization ((method algorithm) OR (path algorithm)) ))

Refine Results
  1. 1

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, the routing sequence need to be rip-up and all nets need to be re-routed. This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, the routing sequence need to be rip-up and all nets need to be re-routed. This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…Therefore, the routing sequence need to be rip-up and all nets need to be re-routed. This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra’s based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    The Determination of Pile Capacity Using Artificial Neural-net: An Optimization Approach by Ab. Malik, Rosely, Jamil S., Mohamed

    Published 2001
    “…From standard static formula for bearing capacity of a single pile foundation, an algorithm using a reliability approach for the determination of service load was developed. …”
    Get full text
    Get full text
    Article
  6. 6

    Performance analysis of ant colony's algorithm: load-balancing in QoS-based wireless mesh networks routing by Moghanjoughi, Ayyoub Akbari, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir

    Published 2008
    “…The design of the algorithm is based on: the specific self-organizing behavior of ant colonies, the shortest path discovery, and the related framework of ant colony optimization (ACO). …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks by Ghathwan, Khalil Ibrahim

    Published 2016
    “…The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. …”
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Optimal sizing of hybrid tidal, photovoltaic and battery sources of energy by Sadeghi, Omid Sarrafan

    Published 2015
    “…In the sizing problem, cost is proposed as the objective function of the algorithm, which is calculated by the Net Present Cost method. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri by Mohd Sabri, Norlina

    Published 2020
    “…The overall results have shown that eGSA is a reliable algorithm in solving this RF magnetron sputtering parameter optimization problem. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

    Published 2025
    “…Key features include the SMAC Hybrid A* algorithm for global path planning, the Regulated Pure Pursuit Controller for local trajectory execution and dynamic obstacle avoidance, and gmapping for SLAM functionality. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  11. 11

    Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

    Published 2009
    “…Among various works inspired by ant colonies, the Ant Colony Optimization (ACO) metaheuristic algorithms are the most successful and popular, e.g., AntNet, Multiple Ant Colony Optimization (MACO) and AntHocNet. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  15. 15

    The classification of wink-based eeg signals by means of transfer learning models by Jothi Letchumy, Mahendra Kumar

    Published 2021
    “…The implementation of pre-processing algorithms has been demonstrated to be able to mitigate the signal noises that arises from the winking signals without the need for the use signal filtering algorithms. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Thermal and hydraulic impacts consideration in refinery crude preheat train cleaning scheduling using recent stochastic optimization methods by Biyanto, T.R., Ramasamy, M., Jameran, A.B., Fibrianto, H.Y.

    Published 2016
    “…The solution provided by recent stochastic algorithms is global optimum solution. The results show that ignoring the additional pumping cost in the objective function resulted in an optimal cleaning schedule that provides a less savings (18.09 of maximum potential savings) in the net loss compared to the optimal cleaning schedule that utilizes the additional pumping cost in the objective function, which increases about 19.34 of maximum potential savings. …”
    Get full text
    Get full text
    Article
  17. 17

    Designing of skull defect implants using C1 rational cubic Bezier and offset curves by Najihah, Mohamed, Ahmad, Abd Majid, Abd Rahni, Mt Piah, Zainul, Ahmad Rajion

    Published 2015
    “…In this study, data approximation by a rational cubic Bézier function uses HS to optimize position of middle points and value of the weights. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    A Novel Hybrid Deep Learning Model Based on Simulated Annealing and Cuckoo Search Algorithms for Automatic Radiomics-Based COVID-19 Diagnosis by Saleh, Basma Jumaa, Omar, Zaid, As’ari, Muhammad Amir, Bhateja, Vikrant, Izhar, Lila Iznita

    Published 2025
    “…To further enhance COVID-19 lesion estimation, novel optimization strategies, including a hybrid simulated annealing-cuckoo search (SA-CS) algorithm, are introduced alongside the original SA method. …”
    Get full text
    Get full text
    Article
  19. 19

    QoS based fair load-balancing: paradigm to IANRA routing algorithm for wireless networks (WNs) by Moghanjoughi, Ayyoub Akbari, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir

    Published 2008
    “…The obtained results show that the efficiency of IANRA algorithm is better than AODV and AntNet or any other related algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Optimization of surface roughness in micro-high speed end milling of soda lime glass using uncoated tungsten carbide tool with compressed air blowing by Amin, A. K. M. Nurul, Nassar, Mahmoud M.A., Arif, Muammer Din

    Published 2014
    “…Finally, desirability function and genetic algorithms were used to predict the best combination of cutting parameters needed to obtain the lowest surface roughness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article