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 “"OPTIMAL PARALLEL TIME"”.
-
ΑΥΤΟΜΑΤΗ ΠΑΡΑΛΛΗΛΟΠΟΙΗΣΗ ΣΕΙΡΙΑΚΩΝ ΑΛΓΟΡΙΘΜΩΝ
THIS DISSERTATION STUDIES THE PROBLEM OF OPTIMAL PARALLELIZATION OF NESTED FOR(DO) LOOPS WITH UNIFORM DEPENDENCIES. AN OPTIMAL PARALLELIZATION IS A SCHEDULE THAT ACHIEVES THE MINIMUM PARALLEL EXECUTION TIME WHILE USING THE MINIMUM NUMBER OF PROCESSORS. UPPER AND LOWER BOUNDS ON THE NUMBER OF …
-
Leveraging Parallelism in Interactive Proofs
… of these proof systems, specifically the time required to generate a proof, remains a major bottleneck between theory and practice. In this thesis, we approach this challenge through the lens of parallelism. We first consider whether the aforementioned bottleneck can be overcome by …
-
Structure Discovery in Bayesian Networks: Algorithms and Applications
… of several interesting problem variants. In the optimal Bayesian network learning problem (we call this structure learning), one aims to find a Bayesian network that best explains the data and then utilizes this optimal Bayesian network for predictions or inferences. In others, we are interested …