Search
Skip to Search Results- 1Aftergood, Olivia SR
- 1Al Dallal, Ahmed
- 1Behsaz, Babak
- 1Berube, Paul N. J.
- 1Blouin, Karen D
- 1Brown, Daniel M.
- 13Department of Computing Science
- 5Department of Electrical and Computer Engineering
- 3Department of Civil and Environmental Engineering
- 2Department of Renewable Resources
- 1Department of Earth and Atmospheric Sciences
- 1Department of Mathematical and Statistical Sciences
- 2Lin, Guohui (Computing Science)
- 2Sander, Joerg (Computing Science)
- 1Ardakanian, Omid (Computing Science)
- 1Cockburn, Bruce (Department of Electrical and Computer Engineering)
- 1Deutsch, Clayton (Civil and Environmental Engineering)
- 1Dick, Scott (Department of Electrical and Computer Engineering)
-
Fall 2012
Recent proliferation of low-cost and lightweight GPS tracking devices led to a large increase in the amounts of collected mobility data. The rapidly emerging field of location-based services requires accurate and informative knowledge mining from these large quantities of data. One such mobility...
-
Fall 2017
Density-based clustering methods extract high density clusters which are separated by regions of lower density. HDBSCAN* is an existing algorithm for producing a density-based cluster hierarchy. To obtain clusters from this hierarchy it includes an instance of FOSC(Framework for Optimal Selection...
-
Fall 2015
The objective of this thesis is to develop, implement and verify a theoretical framework based upon aggregation and mathematical programming for solving the long-term open pit production planning problem. The goal is to closely estimate the maximum net present value of the operation by providing...
-
Fall 2011
An industrial construction enterprise operating in the City of Edmonton wants to improve its bidding strategies that are currently plagued with uncertainty, lack of information and historical price variability. The present research studies a compilation of documents obtained from company archives...
-
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...
-
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...
-
Fall 2015
In this thesis, we consider two closely related clustering problems, Min Sum k-Clustering (MSkC) and Balanced k-Median (BkM). In Min Sum k-clustering, one is given a graph and a parameter k, and has to partition the vertices in the graph into k clusters to minimize the sum of pairwise distances...
-
Spring 2019
Many real-world problems can be formulated as combinatorial optimization problems, thus making it very important to find efficient methods to solve them, both theoretically and practically. In this thesis, we consider several NP-hard combinatorial optimization problems, consisting of some...
-
Fall 2015
How to evaluate the performance of an algorithm is a very important subject in computer science, for understanding its applicability, for understanding the problem which it is applied to, and for the development of new ideas that help to improve the existing algorithms. There are two main...
-
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...