Search Results - (( java implication based algorithm ) OR ( terms selection path algorithm ))

Search alternatives:

Refine Results
  1. 1
    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs

    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akhbar, R.

    Published 2010
    “…The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin

    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin by Sariff, Nohaidda, Buniyamin, Norlida

    Published 2010
    “…Performances between both algorithms were compared and evaluated in terms of speed and number of iterations that each algorithm takes to find an optimal path within several selected environments. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance

    A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance by Muhammad, Aisha, Ali, Mohammed A.H., Turaev, Sherzod, Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Shanono, Ibrahim Haruna, Alzaid, Zaid, Alruban, Abdulrahman, Alabdan, Rana, Dutta, Ashit Kumar, Almotairi, Sultan

    Published 2022
    “…The algorithm will select the minimum path from the candidate points to target while avoiding obstacles. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Multi agent quality of service routing based on scheme ant colony optimization algorithm

    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
    Save to List
    Saved in:
  7. 7
    Energy efficient path-planning for unmanned aerial vehicle

    Energy efficient path-planning for unmanned aerial vehicle by Debnath, Sanjoy Kumar

    Published 2022
    “…The proposed path planning algorithm is called Iterative Elliptical- Convex Visibility Graph (IECoVG) which is based on visibility graph (VG) and Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…Results show that for the same network load, DLBR outperforms the shortest path in terms of the average delay and packet loss. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…Results show that for the same network load, DLBR outperforms the shortest path in terms of the average delay and packet loss. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Finding the shortest route using Dijkstra’s algorithm with application to ride hailing in UiTM Cawangan Negeri Sembilan Kampus Seremban / Nur Husnina Hassan, Nurin Hadrah Syahira Muhamad Bakri and Alya Batrisyia Sazeli

    Finding the shortest route using Dijkstra’s algorithm with application to ride hailing in UiTM Cawangan Negeri Sembilan Kampus Seremban / Nur Husnina Hassan, Nurin Hadrah Syahira M... by Hassan, Nur Husnina, Muhamad Bakri, Nurin Hadrah Syahira, Sazeli, Alya Batrisyia

    Published 2022
    “…The Dijkstra's Algorithm is expected to be able to complete the study for the shortest path with a minimum of time. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  12. 12
    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score

    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

    Published 2021
    “…A gendermatched case-control study was conducted in Punjab Institute of Cardiology, Pakistan, in which a sample of 460 individuals was selected through systematic sampling. The warppartial least square method was utilized to estimate the multi-layer hypothesized path model. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…Performance of each algorithm is compared in terms of number of test cases generated as well as the run time required. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). …”
    Article
    Save to List
    Saved in:
  17. 17
    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). …”
    Article
    Save to List
    Saved in:
  18. 18
    Multi-user mmWave MIMO channel estimation with hybrid Beamforming over frequency selective fading channels

    Multi-user mmWave MIMO channel estimation with hybrid Beamforming over frequency selective fading channels by Uwaechia, Anthony Ngozichukwuka, Mahyuddin, Nor Muzlifah, Ain, Mohd Fadzil, Abdul Latiff, Nurul Muazzah, Za'bah, Nor Farahidah

    Published 2020
    “…Simulation results show that the proposed algorithm is effective and offer a better CE performance in terms of MSE when compared to the generalized block orthogonal matching pursuit (G-BOMP) algorithm that does not possess a pruning step.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  19. 19
    Steganography based on utilizing more surrounding pixels

    Steganography based on utilizing more surrounding pixels by Afrakhteh, Masoud

    Published 2010
    “…Conventional LSB method’s concept is used as the benchmark for the proposed algorithms. A model structure selection based on not choosing selected pixels as immediate neighbors of the target pixel is proposed in this study to reduce image’s distortion made by embedding random bits or in other words to get a higher imperceptibility. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    The implications for ahybrid detection technique against malicious sqlattacks on web applications

    The implications for ahybrid detection technique against malicious sqlattacks on web applications by Bahjat Arif, Sarajaldeen Akram, Wani, Sharyar

    Published 2025
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: