Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Bellman-Ford"”.
-
A Biomimetic, Energy-Harvesting, Obstacle-Avoiding, Path-Planning Algorithm for UAVs
… peak analysis and then applies a variant of the Bellman-Ford algorithm to find the minimum-cost path. Both methods are enhanced by taking into account the performance characteristics of the aircraft using advanced performance theory. The combined approach yields five possible trajectories from …
-
Application of shortest path algorithms to find paths of minimum radiation dose
… algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to navigate through contaminated areas such as …
-
Polyhedral aspects of cardinality constrained combinatorial optimization problems
… wird beispielsweise gezeigt, dass die dem Moore-Bellman-Ford Algorithmus innewohnende Struktur dazu verwendet werden kann, um facettendefinierende Ungleichungen für das Polytop der gerichteten (s,t)-Wege mit höchstens k Kanten, herzuleiten. Für zwei Relaxierungen dieses Polytops liefert unser …
-
Fast scheduling for Optical Flow Switching
… available light paths along the way. A modified Bellman-Ford algorithm is designed to select the paths with the least blocking probabilities. By grouping details of network states into the average entropy, we can greatly reduce the information collected and disseminated by the centralized …
-
Optimal Task Scheduling and Flight Planning for Multi-Task Unmanned Aerial Vehicles
… which can be optimally solved by the celebrated Bellman-Ford algorithm.
-
Quality-of-service provisioning in high speed networks : routing perspectives
… solve it by using existing algorithms such as Bellman-Ford and Dijkstra algorithms. However, this approach suffers from either high computational complexity or low success ratio in finding the feasible paths. Hence, a new problem, All Hops k-shortest Path (AHKP), is introduced and investigated. …
-
Duty-Cycled Wireless Sensor Networks: Wakeup Scheduling, Routing, and Broadcasting
… formulate the routing problem as time-dependent Bellman-Ford problem, and use vector representation for time-varying link costs and end-to-end (E2E) distances. We present efficient algorithms for route construction and maintenance, which have bounded time and message complexities in the worst …
-
Distributed routing algorithms for interconnected FDDI LANS
… is required. Much research has been done on the Bellman-Ford algorithm and many implementations of it exist in computer networks. However, due to its instability and problems with routing table loops it is an unsatisfactory algorithm for interconnected FDDI LANs. A new algorithm, termed ISIS …