Theses and Dissertations
This collection contains theses and dissertations of graduate students of the University of Alberta. The collection contains a very large number of theses electronically available that were granted from 1947 to 2009, 90% of theses granted from 2009-2014, and 100% of theses granted from April 2014 to the present (as long as the theses are not under temporary embargo by agreement with the Faculty of Graduate and Postdoctoral Studies). IMPORTANT NOTE: To conduct a comprehensive search of all UofA theses granted and in University of Alberta Libraries collections, search the library catalogue at www.library.ualberta.ca - you may search by Author, Title, Keyword, or search by Department.
To retrieve all theses and dissertations associated with a specific department from the library catalogue, choose 'Advanced' and keyword search "university of alberta dept of english" OR "university of alberta department of english" (for example). Past graduates who wish to have their thesis or dissertation added to this collection can contact us at erahelp@ualberta.ca.
Items in this Collection
- 2Abdi Oskouie, Mina
- 2Birkbeck, Neil Aylon Charles
- 2Cai, Zhipeng
- 2Chen, Jiyang
- 2Chowdhury, Md Solimul
- 2Chubak, Pirooz
- 74Machine Learning
- 70Reinforcement Learning
- 41Artificial Intelligence
- 36Machine learning
- 22Natural Language Processing
- 22Reinforcement learning
-
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...
-
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
DownloadFall 2021
In this thesis, we present Approximation Schemes for Capacitated Vehicle Routing Problem (CVRP) on several classes of graphs. In CVRP, introduced by Dantzig and Ramser in 1959, we are given a graph G = (V,E) with metric edges costs, a depot r in V , and a vehicle of bounded capacity Q. The goal...
-
Spring 2024
In this thesis, we present approximation schemes for the airport and railway problem (AR) on several classes of graphs. The AR problem, introduced by Adamaszek et al., is a combination of the capacitated facility location problem (CFL) and the network design problem. An AR instance comprises a...
-
Fall 2011
In this thesis, we present a variety of approximation algorithms for the Unsplittable Flow on Paths problem and some Traveling Salesman problems. The main contribution to the Unsplittable Flow on Paths problem is a logarithmic approximation algorithm which is the first non-trivial approximation...
-
Fall 2021
The problem of aspect-based recommendation---recommending an "item" to a "recommendation recipient" based on "aspects", i.e., information about the characteristic features of the item that may be of interest to the recommendation recipient or what makes an item a good match for a recommendation...
-
Assessing the Feasibility of Learning Biomedical Phenotype Patterns Using High-Throughput Omics Profiles
DownloadSpring 2014
A decade after the completion of the human genome project, the rapid advancement of the high-throughput measurement technologies has made omics (genomics, epigenomics, transcriptomics, metabolomics) profiling feasible. The availability of such omics profiles has raised the hope for the...
-
Fall 2011
With increasing software size and complexity, corrective software maintenance has become a challenging process. When a failure is reported, it takes time and expertise for human operators to collect the right information and pinpoint the root cause. Typically, the operators are overloaded with...