Search
Skip to Search Results- 1Achal, Roshan
- 1Aftergood, Olivia SR
- 1Al Dallal, Ahmed
- 1Ali, Mostafa A A
- 1Arango Moreno, Camilo
- 1Behsaz, Babak
- 15Department of Computing Science
- 5Department of Electrical and Computer Engineering
- 4Department of Civil and Environmental Engineering
- 1Department of Earth and Atmospheric Sciences
- 1Department of Mathematical and Statistical Sciences
- 1Department of Mechanical Engineering
- 3Salavatipour, Mohammad (Computing Science)
- 2Mohamed, Yasser (Civil and Environmental Engineering)
- 2Sander, Joerg (Computing Science)
- 1Ardakanian, Omid (Computing Science)
- 1Cockburn, Bruce (Department of Electrical and Computer Engineering)
- 1Deutsch, Clayton (Civil and Environmental Engineering)
-
“Moving in Data”: The Open Data Gaze as a form of Municipal Statecraft in the Entrepreneurial City
DownloadFall 2022
Globally speaking, data-driven urbanism is on the rise. As data becomes more readily available and important in contemporary economies, municipal governments are adopting new ways of managing and planning cities. By transforming themselves via urban data, cities can position themselves to be...
-
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 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...
-
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...
-
Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors
DownloadFall 2013
In this thesis we present approximation algorithms for some multi-processor task scheduling problems. In a scheduling problem, there is a set of processors P that can be used to process a set of tasks T and the goal is to find a feasible scheduling of the tasks on the processors, while optimizing...