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
- 4Department of Civil and Environmental Engineering
- 2Department of Physics
- 2Department of Renewable Resources
- 1Department of Earth and Atmospheric Sciences
- 2Salavatipour, Mohammad (Computing Science)
- 2Sander, Joerg (Computing Science)
- 1Ardakanian, Omid (Computing Science)
- 1Cockburn, Bruce (Department of Electrical and Computer Engineering)
- 1Dehghanpour, Hassan (Department of Civil and Environmental Engineering)
- 1Deutsch, Clayton (Civil and Environmental Engineering)
-
Fall 2010
Software can be considered a live entity, as it undergoes many alterations throughout its lifecycle. Therefore, code can become rather complex and difficult to understand. More specifically in object-oriented systems, classes may become very large and less cohesive. In order to identify such...
-
Fall 2011
Multi-agent pathfinding problems involve finding plans for agents that must travel from their start locations to their targets without colliding. Recent work produced a number of algorithms to solve the problem as well as an ample supply of related theory. This work is based on a related work...
-
Spring 2011
In this thesis, we present our work on two combinatorial optimization problems. The first problem is the Bandpass problem, and we designed a linear time exact algorithm for the 3-column case. The other work is on the Complementary Maximal Strip Recovery problem, for which we designed a...
-
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
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 2012
Algorithms are increasingly present in our lives and responsible for many aspects of society – but are hidden from inspection. As codified instructions they require design (unless simplistic) and this design emerges from a web of social factors. Web sites and video games contain decision-making...
-
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 2012
This thesis makes improvement to the process of ahead-of-time feedback-directed optimization (FDO) in compiler design. It examines multiple aspects of FDO from profile collection and representation through to the performance evaluation of FDO code transformations. Two guiding principals knit the...
-
Fall 2013
Due to its wide application in various fields, clustering, as a fundamental unsupervised learning problem, has been intensively investigated over the past few decades. Unfortunately, standard clustering formulations are known to be computationally intractable. Although many convex relaxations of...
-
Fall 2014
Anomaly detection in spatial time series is a challenging problem with numerous potential applications. A comprehensive anomaly detection approach not only should be able to detect and identify the emerging anomalies, but it also has to characterize the essence of these anomalies by visualizing...