Search Results - (( java implementation path algorithm ) OR ( problem using network algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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
    “…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
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Network reconfiguration and control for loss reduction using genetic algorithm

    Network reconfiguration and control for loss reduction using genetic algorithm by Jawad, Mohamed Hassan Izzaldeen

    Published 2010
    “…The proposed solution to this problem is based on a general combinatorial optimization algorithm known as Genetic Algorithm, and the load flow equations in distribution network. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Efficient radio resource management algorithms for downlink long term evolution networks

    Efficient radio resource management algorithms for downlink long term evolution networks by Mamman, Maharazu

    Published 2018
    “…Optimal priority algorithm uses minimum data rate to guarantees resource allocation to users but increases the average delay and deteriorate the network performance. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Controlling algorithm for energy consumption of radio bandwidth to manage coverage area problem

    Controlling algorithm for energy consumption of radio bandwidth to manage coverage area problem by Marsal K.A., Abdullah I.

    Published 2024
    Conference Paper
    Save to List
    Saved in:
  8. 8
    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm

    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

    Published 2023
    “…This paper proposed a solution to the MCP problem using genetic algorithm (GA). The effectiveness of the proposed algorithm is evaluated through simulation. …”
    Article
    Save to List
    Saved in:
  9. 9
    A hybrid algorithm for finding shortest path in network routing.

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A robust GA-based QoS routing algorithm for solving multi-constrained path problem

    A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

    Published 2023
    “…Multi-constrained path (MCP) problem refers to the problem of finding a path through a network subject to multiple additive constraints. …”
    Article
    Save to List
    Saved in:
  11. 11
    Improving performance of mobile ad hoc networks using efficient Tactical On Demand Distance Vector (TAODV) routing algorithm

    Improving performance of mobile ad hoc networks using efficient Tactical On Demand Distance Vector (TAODV) routing algorithm by Uddin, Mueen, Abdul Rahman, Azizah, Alarifi, Abdulrahman, Talha, Muhammad, Shah, Asadullah, Iftikhar, Mohsin, Zomaya, Albert

    Published 2012
    “…The proposed TAODV algorithm performs better for solving routing problems in Mobile Ad Hoc networks. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    An improved simulated annealing algorithm to avoid crosstalk in optical omega network

    An improved simulated annealing algorithm to avoid crosstalk in optical omega network by Abdullah, Monir, Othman, Mohamed, Johari, Rozita

    Published 2006
    “…When Simulated Annealing (SA) algorithm was used to solve the problem, it gave good results. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement

    The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement by Hosseini E., Al-Ghaili A.M., Kadir D.H., Daneshfar F., Gunasekaran S.S., Deveci M.

    Published 2025
    “…SGA is used in the process of solving optimization test problems by neural networks. …”
    Article
    Save to List
    Saved in:
  15. 15
    Finding multi-constrained path using genetic algorithm

    Finding multi-constrained path using genetic algorithm by Yussof S., See O.H.

    Published 2023
    “…This paper presents a solution to the MCP problem using genetic algorithm (GA). Through simulation, this algorithm has been shown to give a high probability of finding a feasible path if such paths exist. �2007 IEEE.…”
    Conference paper
    Save to List
    Saved in:
  16. 16
    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic

    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

    Published 2004
    “…In CQ Routing Algorithm, the confidence value (C value) can be used to improve the quality of exploration in Q Routing Algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    On network flow problems with convex cost

    On network flow problems with convex cost by Nguyen, V.A., Tan, Y. P.

    Published 2004
    “…To address this problem, we derive the optimality conditions for minimising convex and differentiable cost functions, and devise an algorithm based on the primal-dual algorithm commonly used in linear programming. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Leader election algorithm in 2D torus networks with the presence of one link failure

    Leader election algorithm in 2D torus networks with the presence of one link failure by Refai, M., Sharieh, A., Alshammari, F.

    Published 2010
    “…Leader election algorithms solve the instability problem in the network which is caused by leader failure. …”
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    WCBP: A new water cycle based back propagation algorithm for data classification

    WCBP: A new water cycle based back propagation algorithm for data classification by Mohd. Nawi, Nazri, Khan, Abdullah, Firdaus, Naim, M. Z., Rehman, Siming, Insaf Ali

    Published 2016
    “…Therefore, this paper proposed the use of WC algorithm in combination with Back-Propagation neural network (BPNN) algorithm to solve the local minima problem in gradient descent trajectory. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    AntNet: a robust routing algorithm for data networks

    AntNet: a robust routing algorithm for data networks by Haseeb, Shariq, Sidek, Khairul Azami, Ismail, Ahmad Faris, Weng Kin, Lai, Yit Mei, Aw

    Published 2004
    “…Successful implementation and operation of a network largely depends on the routing algorithm in use. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: