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 “"Parameterized algorithms"”.
-
Intuitive algorithms
… Both the concepts of moderately exponential time algorithms and parameterized complexity provide tools for solving many of these problems in reasonable time. In this thesis, we introduce the concept of intuitive algorithms. While intuitive algorithms can be either moderately exponential time …
-
Scalable and Tunable Algorithms for Adaptive All-to-all Data Exchange
… Existing implementations typically rely on algorithms with extremal radix (log-base) values of 2 (latency minimization) and process count (bandwidth maximization). This limits the ability to dynamically optimize performance across the latency–bandwidth spectrum and significantly constrains …
-
Exact algorithms based on specific complexity measures for hard problems
… assumption that P does not equal NP, exact algorithms for problems of the second variety inevitably take superpolynomial time (not necessarily for every input, but in the worst case). In terms of worst-case behavior, it is easy to see that the respective algorithms can be infeasible even for …