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 4 of 4 for “"multiple-choice knapsack problem"”.
-
Decentralized control for UAV path planning and task allocation
… approach was first developed that treats the problem as a Multi-dimensional, Multiple-Choice Knapsack Problem. Paths are selected and task assigned while minimizing the UAV team's overall mission cost. Next, a SIMULINK-based centralized simulation environment was created. This simulation uses …
-
Globally optimal algorithms for multiple-transform signal compression
… transform such as the DCT is typically used. Multiple-transforms such as directional 1-D DCTs have been proposed to exploit the different statistical characteristics of motion compensation residuals. Many issues are associated with this scenario. In this thesis, we will focus on the issue of …
-
Faster fully polynomial approximation schemes for Knapsack problems
… returns ... -optimal solution to a maximization problem of size n, which runs in polynomial time in both ... We develop faster FPTASs for several classes of knapsack problems. In this thesis, we will first survey the relevant literature in FPTASs for knapsack problems. We propose the use of …
-
Randomization-based inference for distributions and quantiles of individual treatment effects
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-05-01