Browsing Theses by Subject "dynamic programming"
Now showing items 1-6 of 6
-
The application of the in-tree knapsack problem to routing prefix caches
(University of Waterloo, 2009-04-30)Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact that TCAM is a non-standard type of memory and ... -
Covering Problems via Structural Approaches
(University of Waterloo, 2011-09-30)The minimum set cover problem is, without question, among the most ubiquitous and well-studied problems in computer science. Its theoretical hardness has been fully characterized--logarithmic approximability has been ... -
Frequency and Voltage Control of Islanded Microgrids
(University of Waterloo, 2020-05-29)Islanded microgrids (MGs), characterized by distributed generators, power consumers, and energy storage systems (ESSs), are designed to signi cantly enhance self-sustainability of future distribution networks and to provide ... -
SPIDER: Reconstructive Protein Homology Search with De Novo Sequencing Tags
(University of Waterloo, 2011-04-21)In the field of proteomic mass spectrometry, proteins can be sequenced by two independent yet complementary algorithms: de novo sequencing which uses no prior knowledge and database search which relies upon existing protein ... -
Subseries Join and Compression of Time Series Data Based on Non-uniform Segmentation
(University of Waterloo, 2008-09-24)A time series is composed of a sequence of data items that are measured at uniform intervals. Many application areas generate or manipulate time series, including finance, medicine, digital audio, and motion capture. ... -
Technology Diffusion on Spiders
(University of Waterloo, 2017-08-29)There has been significant research about cascade effects that occur when information is spread through a network. Most models of such cascade effects are highly-localised, which means that they assume a node’s behaviour ...