Search Results - (( developing parallel maximization algorithm ) OR ( java optimization path algorithm ))

  • Showing 1 - 10 results of 10
Refine Results
  1. 1

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  2. 2

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

    Published 2025
    “…Core functionalities such as path planning, autonomous movement, voice feedback, and app-to-robot communication have been thoroughly tested and optimized. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5

    Online system identification development based on recursive weighted least square neural networks of nonlinear hammerstein and wiener models. by Kwad, Ayad Mahmood

    Published 2022
    “…Best Hammerstein parallel NN polynomial based model and series-parallel NN polynomial model are 88.75% and 93.9% respectively, for best Hammerstein parallel NN sigmoid based model and series-parallel NN sigmoid based model 78.26% and 95.95% respectively, and for best Hammerstein parallel NN hyperbolic tangent based model and series-parallel NN hyperbolic tangent based model 70.7% and 96.4% respectively. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7
  8. 8
  9. 9

    Scheduling dynamic cellular manufacturing systems in the presence of cost uncertainty using heuristic method by Delgoshaei, Aidin

    Published 2016
    “…Since the proposed models (like similar models in the literature) are likely to fall into local optimum points, a Branch and Bound based heuristic, a hybrid Simulated Annealing and Genetic algorithm, a hybrid Tabu search and Simulated Annealing, a hybrid Genetic algorithm and Simulated Annealing, a hybrid Ant Colony Optimization and Simulated Annealing and a hybrid Multi-layer Perceptron and Simulated Annealing algorithms are developed. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis