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 3 of 3 for “"polynomial time solutions"”.
-
Inferring noncompensatory choice heuristics
… structure, many are hard and likely do not have polynomial time solutions. For the hard problems we develop an exact dynamic programming algorithm that is robust and scalable in practice, as well as analyze several local search heuristics. We conduct an empirical study of SmartPhone preferences …
-
Optimism and Robustness: Learning From Structured and Semi-Random Inputs
… sum-of-diameters (MSD) objectives, and provide polynomial time solutions under stability assumptions. In the second part of this thesis, we focus on enhancing algorithm robustness to contamination in average-case inputs (semi-random inputs). In the context of low-rank matrix recovery problems, …
-
Power-Aware Planning and Design for Next Generation Wireless Networks
… Linear Programming (MILP) to provide optimal solutions. Then we present a general optimization framework to guide algorithm design, which solves two subproblems, channel assignment and load allocation, in sequence. In addition, we present an effective heuristic algorithm that jointly solves …