Search
Skip to Search Results- 1Burden, Michael P
- 1Eghbali, Sara
- 1Islam, Md Manirul
- 1Kazemi Nojadeh, Nasser
- 1Khorshid, Mokhtar
- 1Li, Zhong
-
Fall 2016
In this thesis, we present approximation algorithms for various NP-hard vehicle routing problems, as well as for a related maximum group coverage problem. Our main contribution is a framework to build good constant-factor approximation algorithms for variants of the multi-depot $k$-travelling...
-
Spring 2023
In this thesis, we present Approximation Schemes for the Min Sum k Clustering problem on a number of classes of graph metrics. In Min Sum k Clustering problem introduced by Sahni and Gonzalez [22] in 1976, given a graph G(V, E) with metric edge costs and parameter k, we are asked to partition V...
-
Development of a Model using Machine Learning Intended to be Embedded in a Wearable Device to Detect Muscle Fatigue based on sEMG Data Associated with a Sustained Single 80% Maximum Voluntary Contraction
DownloadFall 2021
Background: Muscle fatigue is the progressive reduction in a muscle's ability to contract and exert force when performing a sustained task. Muscle fatigue may prevent the task from being complete and increase the risk of injury. Eventually, the performance of individuals during athletic...
-
Efficient algorithms for least squares wave equation migration and source signature estimation
DownloadFall 2017
Estimating accurate images of the subsurface is one of the end products of seismic data processing. Numerical solutions to the wave equation allow designing linearized forward operators. The adjoint of the linearized forward operator is used to image the interior of the earth. The adjoint...
-
Spring 2011
In this thesis, we present our work on two combinatorial optimization problems. The first problem is the Bandpass problem, and we designed a linear time exact algorithm for the 3-column case. The other work is on the Complementary Maximal Strip Recovery problem, for which we designed a...
-
Fall 2020
This thesis proposes a framework for ground roll removal based on regularized inversion. Both ground roll and reflections are represented in the frequency-space (f - x) domain as a linear function of unknown complex amplitudes. An inversion algorithm is developed to estimate the coefficients that...
-
Spring 2023
Pathfinding has been an interesting research area throughout the years. Heuristic search algorithms are used to find a path with the minimum length between a start and a goal in a graph, which has applications in GPS navigation and video games. There are different ways to create a heuristic for...
-
Investigating Light Solvent Aided Process in Cold Lake Oil-Sand Reservoir Using Experimental and Numerical Approaches
DownloadSpring 2019
Steam assisted- gravity drainage (SAGD) is the main in-situ bitumen recovery process in which saturated steam is injected into the bitumen zone. However, it has some drawbacks, which include high-energy consumption and significant environmental concerns. Solvent Aided Process (SAP) is a method...
-
Fall 2011
Multi-agent pathfinding problems involve finding plans for agents that must travel from their start locations to their targets without colliding. Recent work produced a number of algorithms to solve the problem as well as an ample supply of related theory. This work is based on a related work...
-
Fall 2012
Algorithms are increasingly present in our lives and responsible for many aspects of society – but are hidden from inspection. As codified instructions they require design (unless simplistic) and this design emerges from a web of social factors. Web sites and video games contain decision-making...