Browsing Theses by Subject "online algorithms"
Now showing items 1-5 of 5
-
Geometric On-line Ray Searching Under Probability of Placement Scenarios
(University of Waterloo, 2010-09-28)Online computation is a model for formulating decision making under uncertainty. In an online problem, the algorithm does not know the entire input from the beginning; the input is revealed in a sequence of steps. At each ... -
The Incremental Constraint of k-Server
(University of Waterloo, 2012-05-19)Online algorithms are characterized by operating on an input sequence revealed over time versus a single static input. Instead of generating a single solution, they produce a sequence of incremental solutions corresponding ... -
Models for Parallel Computation in Multi-Core, Heterogeneous, and Ultra Wide-Word Architectures
(University of Waterloo, 2013-04-26)Multi-core processors have become the dominant processor architecture with 2, 4, and 8 cores on a chip being widely available and an increasing number of cores predicted for the future. In addition, the decreasing costs ... -
On the Orchestration and Provisioning of NFV-enabled Multicast Services
(University of Waterloo, 2020-05-14)The paradigm of network function virtualization (NFV) with the support of software-defined networking has emerged as a prominent approach to foster innovation in the networking field and reduce the complexity involved in ... -
Variations on the Theme of Caching
(University of Waterloo, 2005)This thesis is concerned with caching algorithms. We investigate three variations of the caching problem: web caching in the Torng framework, relative competitiveness and caching with request reordering. <br /><br /> ...