Search Results - (( basic optimization path algorithm ) OR ( fi estimation using algorithm ))

Refine Results
  1. 1

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
    Get full text
    Get full text
    Thesis
  2. 2

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  3. 3

    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

    Published 2021
    “…To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…It makes use of three basic operations in order to optimize this problem. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…This study shows that Basic Theta* is able to produce the true shortest path compared to A* which produced slightly longer path. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Particle filter approach for estimating indoor mobile user location using IEEE 802.11 signals (F1090) by Mantoro, Teddy, Ayu, Media Anugerah, Raman, Shakiratul Husna, Md. Latiff , Nurul Hidayati

    Published 2011
    “…This creates problem in tracking user location indoor. Moreover, the use of light estimation algorithms such as fingerprinting, ranking algorithm, Weighted Centroid method, k-Nearest Neighbour, did not give a good tracking result. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  10. 10

    Particle filter approach for tracking indoor user location using IEEE 802.11 signals by Mantoro, Teddy, Ayu, Media Anugerah, Raman, Shakiratul Husna, Latiff , N. H. M.

    Published 2011
    “…This creates problem in tracking user location indoor. Moreover, the use of light estimation algorithms such as fingerprinting, ranking algorithm, Weighted Centroid method, k-Nearest Neighbour, did not give a good tracking result. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Enhancement Of Wifi Indoor Positioning System by Aboodi, Ahed Hussein

    Published 2011
    “…In this research, a new algorithm named (WBI) is proposed, based on the WiFi Received Signal Strength (RSS) technology. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    Published 2013
    “…However, the planned path by using basic RRT structure might not always be optimal in terms of path length. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Indoor location estimation utilizing Wi-Fi Signals by Hashim, Nik Mohd Zarifie, Zahari, Muhammad Khairul, Ja'afar, Abd Shukur, Salleh, Azahari, Darsono, Abd Majid

    Published 2020
    “…The study aim is to develop positioning and localization systems by using Wi-Fi signal. Estimation was made based on the measurement of wireless distance for estimation the user’s coordinates. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2008
    “…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
  17. 17

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…As a route improvement strategy, two heuristics which are the swap among routes procedure and 3-opt algorithm are also employed within the ASH algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Making location-aware computing working accurately in smart spaces by Mantoro, Teddy, Ayu, Media Anugerah, Weyn, Maarten

    Published 2011
    “…We present our current development on a light-weight algorithm, which is easy, simple but robust in producing the determination of user location using WiFi signals. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  20. 20

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article