This is a decommissioned version of ERA which is running to enable completion of migration processes. All new collections and items and all edits to existing items should go to our new ERA instance at https://ualberta.scholaris.ca - Please contact us at erahelp@ualberta.ca for assistance!
Search
Skip to Search Results- 16Scheduling
- 3Simulations
- 2Approximation
- 2Approximation Algorithms
- 2Planning
- 2Wireless Sensor Networks
- 1Darbouy, Seyed Parsa
- 1Ho, Van H
- 1Hosseinimotlagh, Seyedmahyar
- 1Hyatt-Denesik, Dylan V
- 1Khakpash, Saber
- 1Mahmood, Abdullah-Al
-
A Machine Learning Approach to Predict Production Time in Industrialized Building Construction
DownloadFall 2021
Industrialized building construction is an effective approach for improving the performance and management of construction projects by offering higher quality products, minimized environmental impacts, and improved schedule predictability. The industrialized building construction approach...
-
Fall 2015
Transceiver duty-cycling (DC) is a popular technique to conserve energy in a wireless sensor network (WSN). In this thesis, our overall objective is to study the performance of a DC WSN. Namely, we consider the performance of a DC WSN from the point of throughput, as well as energy consumption,...
-
Fall 2019
Scheduling problems are problems in which jobs are assigned to machines at particular times. A common objective of scheduling is to schedule as many jobs before their deadline as possible, called Throughput Maximization. In this thesis, we provide algorithms for various...
-
Application-layer versus Network-layer Multicast: Networking Load, Link Stress, and Distribution Delay
DownloadFall 2017
Multicast is the task of disseminating a message from a source to a set of destinations. If supported by the network and switches, multicast can be performed at the network layer. The alternative solution is application-layer multicast (ALM) which disseminates the message through a set of unicast...
-
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...
-
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...
-
Fall 2010
The allocation of resources over time, referred to as resource scheduling, in large-scale construction environments is a challenging problem. Although traditional network scheduling techniques are the most popular scheduling techniques in the construction industry, they are ineffective in...
-
Fall 2010
The Wireless Sensor Networks (WSNs) have emerged as a new paradigm for collecting and processing data from physical environments, such as wild life sanctuaries, large warehouses, and battlefields. Users can access sensor data by issuing queries over the network, e.g., to find what are the 10...