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 7 of 7 for “"greedy technique"”.
-
A greedy next-hop selection module for vehicular ad-hoc network routing using the A* algorithm method
… routing have narrowed towards the position-aware greedy scheme, which involves making next-hop forwarding choices of a neighbour that is geographically closer to destination continually. Forwarding techniques in MANET/VANET that use the geographic greedy scheme to make next-hop selections include …
-
A Spectral Decomposition Heuristic for Near Optimal Capture Sets In Consensus Models
… interest F(A) is supermodular and therefore, a greedy technique provides a ( 1 - 1/e) approximation to the optimal solution. While the greedy technique provides a guaranteed approximation it comes at the cost of being O(k n^4). This work develops the Spectral Decomposition heuristic for this …
-
A Power-Aware Reinforcement Learning Technique for Memory Allocation in Real-time Embedded Systems
… previous studies have offered alternative techniques to resolve this problem in significantly shorter times. In this work, I propose a reinforcement learning technique to tackle the memory allocation problem in a hybrid architecture. As the results showed, the proposed technique can provide …
-
Computational Scientific Discovery Using Rate-Based Process Models
… by automating the model building process. These techniques fall within the discipline of computational scientific discovery, which has its roots in the early development of artificial intelligence. The approaches developed in this thesis differ from most existing automated model building …
-
Approximation algorithms for new graph partitioning and facility location problems
… algorithms for this problem using the technique of Lagrangian relaxation, and a different algorithm for its maximization version. The other graph partitioning problem that we introduce and study is the min-max multiway cut problem. It aims to partition a graph into multiple components, …
-
Geometric Algorithms for Intervals and Related Problems
… and for the same reason, computational geometry techniques find useful for attacking these problems. Specifically, the problems we study in this dissertation includes the following: balanced splitting on weighted intervals, minimizing the movements of spreading points, dispersing points on …
-
Programming frameworks for mobile sensing
… polynomial time using a topological sorting and greedy technique.