Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"tree knapsack problem"”.

  1. The application of the in-tree knapsack problem to routing prefix caches

    … (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact that TCAM is a non-standard type of memory and inherently parallel, there are concerns about its cost and power consumption. This problem is exacerbated by the growth in routing tables, which demands ever …

    waterloo Repository record for The application of the in-tree knapsack problem to routing prefix caches (opens in a new tab)

  2. The use of partitioning strategies in local access telecommunication network problems and other applications

    … the total telecommunications network cost. The Tree Knapsack Problem (TKP) and Extended Tree Knapsack Problems (ETKP) can be used to model some aspects of the LATN design problem. Efficient solution methods for these models can improve planning of LATN's as it may be necessary to solve many such …

    nwu-za Repository record for The use of partitioning strategies in local access telecommunication network problems and other applications (opens in a new tab)