This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 2Abdi Oskouie, Mina
- 2Birkbeck, Neil Aylon Charles
- 2Cai, Zhipeng
- 2Chen, Jiyang
- 2Chowdhury, Md Solimul
- 2Chubak, Pirooz
- 83Machine Learning
- 76Reinforcement Learning
- 42Artificial Intelligence
- 37Machine learning
- 24Natural Language Processing
- 23reinforcement learning
-
Fall 2018
There is a wealth of software development artifacts such as source code, issue reports, and revision histories, contained within publicly-accessible and privately-accessible repositories. Mining this data presents myriad opportunities that may benefit future software development efforts; however...
-
Fall 2009
Most story-based games today have manually-scripted non-player characters (NPCs) and the scripts are usually simple and repetitive since it is time-consuming for game developers to script each character individually. ScriptEase, a publicly-available author-oriented developer tool, attempts to...
-
Applying support vector machines to discover just-in-time method-specific compilation strategies
DownloadFall 2010
Adaptive Just-in-Time compilers employ multiple techniques to concentrate compilation efforts in the most promising spots of the application, balancing tight compilation budgets with an appropriate level of code quality. Some compiler researchers propose that Just-in-Time compilers should...
-
Fall 2024
In this thesis, we introduce a new problem called the Minimum Sum Coloring with Bundles. We are given an undirected graph and bundles which bundles are sets of nodes (not necessarily disjoint). The goal is to find a proper coloring of the graph with positive integers to minimize the weighted...
-
Fall 2012
In this thesis, we present some approximation algorithms for the following clustering problems: Minimum Sum of Radii (MSR), Minimum Sum of Diameters (MSD), and Unsplittable Capacitated Facility Location. Given a metric (V, d) and an integer k, we consider the problem of partitioning the points...
-
Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
DownloadFall 2022
In this study, we present an improved approximation algorithm for three related problems. In the Minimum Sum of Radii clustering problem (MSR), we aim to select k balls in a metric space to cover all points while minimizing the sum of the radii. In the Minimum Sum of Diameters clustering problem...
-
Fall 2023
In this thesis, we design approximation algorithms for a variety of problems in Network Design. The first problem we consider is the Directed Steiner Tree (DST) problem where we want to find a cheapest way of connecting a subset of nodes (terminal nodes) from a root node in a directed network. We...