Search Results - (( program implementation function algorithm ) OR ( time selection path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

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

    Published 2019
    “…Re-execution of all test cases can be expensive as there might be wasting resources, could be costly and time consuming. The three regression testing techniques are test cases selection (TCS), test suite minimization (TSM) and test cases prioritization (TCP). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Automated path testing using the negative selection algorithm

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
    Save to List
    Saved in:
  3. 3
    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
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    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
    Save to List
    Saved in:
  6. 6
    Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques

    Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques by Salem S. M. Khalifa

    Published 2024
    “…By contrast, the running time of the safe path selection model (96 µs) is shorter than the running times of Dijkstra's algorithm and the Floyd- Warshall algorithm (150 µs and 184 µs, respectively). …”
    thesis::doctoral thesis
    Save to List
    Saved in:
  7. 7
    Shortest Path Routing Using Heuristic Search

    Shortest Path Routing Using Heuristic Search by Alaiwan, Ahmed Omran A.

    Published 2006
    “…In this project A* algorithm was used, to suggest shortest path model between two selected points to find the fastest and shortest route on Malaysia map. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Route optimization using shortest path method / Muhamad Faisal Amin Shakri

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…Strategic planning in road selection helps to reduce many costs such as time and transportation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Path planning for unmanned aerial vehicles using visibility line-based methods

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…Simulation results have proven that the proposed 2D path planning algorithms are much faster in comparison with the VG and hence are suitable for real time path planning applications. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The problem is to find the global path that satisfies the optimization criteria, which are shorter path length and less computation time. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    AUTOMATIC ROUTE FINDER FOR NEW VISITORS

    AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

    Published 2006
    “…Shortest path finding algorithms are necessary in road network of a city or country for tourists and visitors. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  12. 12
    Attack path selection optimization with adaptive genetic algorithms

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…Attack paths that satisfy certain optimization criteria are then selected and presented as possible components of the security solution. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Attack path selection optimization with adaptive genetic algorithms

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…Attack paths that satisfy certain optimization criteria are then selected and presented as possible components of the security solution. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    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:
  15. 15
    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:
  16. 16
    Logic Programming In Radial Basis Function Neural Networks

    Logic Programming In Radial Basis Function Neural Networks by Hamadneh, Nawaf

    Published 2013
    “…The first technique is to encode the logic programming in radial basis function neural networks. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times

    Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

    Published 2016
    “…The proposed technique is able to find a least spent travel time path between two nodes in a bus network with time-dependence.Graph algorithm is used to generate all possible paths to reveal the distances.Classification technique is then used to analysis traffic situation in different period of the time.By analysis traffic situation, date, time, week, month, location are used as a main factor for training process in classification technique.From the experimental studies, the proposed technique is able to show the best route from any given node to the final destination depending on the different period of the time.The proposed technique provides significant benefit for traveler to select the best bus route, which is short distance and fast, among generated routes…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms

    Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms by Alzaeemi, Shehab Abdulhabib, Tay, Kim Gaik, Huong, Audrey, Sathasivam, Saratha, Majahar Ali, Majid Khan

    Published 2023
    “…The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms, including Genetic Algorithm (GA), Evolution Strategy Algorithm (ES), Differential Evolution Algorithm (DE), and Evolutionary Programming Algorithm (EP). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    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:
  20. 20
    Projecting image on non-planar surface with zero-th order geometric continuity using simple dual-linear function and manipulation of strict integer implementation in programming language

    Projecting image on non-planar surface with zero-th order geometric continuity using simple dual-linear function and manipulation of strict integer implementation in programming la... by Yusoff, Fakhrul Hazman, Azhar, Muhammad Amirul

    Published 2015
    “…Usage of a projection system to display large screen images is still relevant in the midst of LED-based display increasing popularity.This is due to that the system itself is a mature technology, reliable and cheaper than the LED counterpart.While various methods had addressed the projection problems on curve surface, projecting image on jagged like surface (zero order geometric continuity) has yet to be studied in depth.This paper proposes a method for projecting image on non-planar surface with zero-order geometric continuity property using parametric modeling.The method manipulate linear function by combining two functions into one by taking advantage of computer programs strict implementation of integer variables.The method was applied to grid-based texturing algorithm in order to create the desired zero-continuity effect on the surface.The method was compared with texturing that implement existing curve algorithm to project image on the screen.Visual evaluation results showed that the proposed method fared better compared to existing curve-based projection algorithm.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: