Search alternatives:
companion » companies (Expand Search)
bath" » both" (Expand Search), batu" (Expand Search)
math" » mat" (Expand Search)
Showing 1 - 20 results of 632 for search '"(companion OR comparison) of the ((bath" OR math") OR path")', query time: 0.11s Refine Results
  1. 1

    Mobile path planner by Lim, Zhi Qiang.

    Published 2011
    “…The application enable the user to specify a set of locations on pre-loaded map and plan an optimal Path, visiting the specified locations with minimal traveling time. …”
    Get full text
    Final Year Project (FYP)
  2. 2
  3. 3
  4. 4

    Vision and path planning in RoboCup by Wang, Chunmiao

    Published 2008
    “…The second part is about path planning with obstacle avoidance.…”
    Get full text
    Thesis
  5. 5

    Simulation for complete coverage path planning by Win Myat Soe.

    Published 2008
    “…This thesis consists of 2 parts. -Part B-Coverage path planning is the determination of a path that a robot must take in order to pass over each point in an environment. …”
    Get full text
    Thesis
  6. 6

    Channel investigation and characterization for slant path by Teng, Ker Wei.

    Published 2010
    “…This report provides documentation for the investigation and characterization for slant path provided by the signal for frequency within the C-band (4-8 GHz). …”
    Get full text
    Final Year Project (FYP)
  7. 7
  8. 8

    Multilevel path branching for digital options by Giles, MB, Haji-Ali, A-L

    Published 2024
    “…The new estimator is based on repeated path splitting and relies on the correlation of approximate paths of the underlying SDE that share parts of a Brownian path. …”
    Journal article
  9. 9

    Memory-efficient and rapidly-converging path planner by Immanuel, Ivan

    Published 2020
    “…For that purpose, a robust path planning algorithm is critical in determining the route which needs to be traveled by each UAV. …”
    Get full text
    Final Year Project (FYP)
  10. 10

    Multi-agent path finding (part B) by Cao, Lifeng

    Published 2020
    “…Multi-Agent Pathfinding (MAPF) is the problem of finding paths efficient collision-free paths for sets of agents with a designated start and end goal. …”
    Get full text
    Final Year Project (FYP)
  11. 11
  12. 12
  13. 13
  14. 14

    Unveiling the importance of longer paths in quantum networks by Hu, X, Dong, G, Lambiotte, R, Christensen, K, Fan, J, Tian, Z, Havlin, S, Meng, X

    Published 2025
    “…Our finding is demonstrated on hierarchical scale-free networks, the (U,V) flowers, which allow full analytical control over path connectivity by adjusting the two distinct path length scales, U ≤ V. …”
    Journal article
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19

    Implementation of Dijkstra's shortest path algorithm for vehicle routing by Pang, Jacquelyn Jiaqi

    Published 2017
    “…My project is to implement Dijkstra’s algorithms via COM programming to find the shortest path between any two locations.…”
    Get full text
    Final Year Project (FYP)
  20. 20

    Shortest paths without a map, but with an entropic regularizer by Bubeck, S, Coester, C, Rabani, Y

    Published 2024
    “…<p>In a 1989 paper titled &ldquo;shortest paths without a map&rdquo;, Papadimitriou and Yannakakis introduced an online model of searching in a weighted layered graph for a target node, while attempting to minimize the total length of the path traversed by the searcher. …”
    Journal article