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
-
Fall 2019
Building Information Modeling (BIM) has become an integral part of the design process, as all building data is accessible in a digital representation and can be viewed in a 3D environment prior to construction. This supports the capability of evaluating or checking a model against building codes...
-
Fall 2013
A type-based alias analysis uses the types of variables in a program to assist in determining the alias relations of those variables. The C standard imposes restrictions on the types of expressions that may access objects in memory, with the explicit intent of specifying when two objects may be...
-
Sample-Efficient Control with Directed Exploration in Discounted MDPs Under Linear Function Approximation
DownloadSpring 2022
An important goal of online reinforcement learning algorithms is efficient data collection to learn near-optimal behaviour, that is, optimizing the exploration-exploitation trade-off to reduce the sample-complexity of learning. To improve sample-complexity of learning it is essential that the...
-
Fall 2011
Propositional satisability (SAT) has been a dominant tool in solving some practical NP-complete problems. However, SAT also has a number of weaknesses, including its inability to compactly represent numerical constraints and its low level, unstructured language of clauses. In contrast, Constraint...
-
Scalable Solutions to Image Abnormality Detection and Restoration using Limited Contextual Information
DownloadFall 2020
Detecting and interpreting image abnormalities and restoring images are essential to many processing pipelines in diverse fields. Challenges involved include randomness and unstructured nature of image artefacts (from signal processing perspective) and performance constraints imposed by...