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 8 of 8 for “"AVERAGE CASE ANALYSIS"”.
-
Average-case analysis of power consumption in embedded systems
… then building the power model based on average number of repetitions. In the first case, a design method called Asynchronous Charge Sharing Logic (ACSL) is used to implement the Arithmetic Logic Unit (ALU) for the 8051 microcontroller. The ACSL circuits are power predictable due to the …
-
Practical programming for static average-case analysis: the MOQA investigation
… considers the static calculation of a program’s average-case time. The number of systems that currently tackle this research problem is quite small due to the difficulties inherent in average-case analysis. While each of these systems make a pertinent contribution, and are individually discussed …
-
Convex Relaxations: Beyond Polynomials, Splitting Methods and Average Case Analysis
… when the approximation is chosen optimally. Our analysis extends beyond the quantum relative entropy to the $\alpha$-quasi-entropies. The second part of the thesis makes contributions to the study of first-order algorithms for convex optimisation and non-convex optimisation. We begin by …
-
ΤΕΧΝΙΚΕΣ ΣΧΕΔΙΑΣΜΟΥ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΚΑΙ Η ΕΦΑΡΜΟΓΗ ΤΟΥΣ ΣΕ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ
… WE PROVIDE NEW TECHNIQUES FOR THE DESIGN AND ANALYSIS OF PARALLEL ALGORITHMS AND THEIR APPLICATION TO GRAPH PROBLEMS. MORE PRECISELY: 1. WE PRESENT A DETERMINISTIC TECHNIQUE BASED ON THE DECOMPOSITION OF A PLANAR DIGRAPH INTO SPECIAL OUTERPLANAR SUBGRAPHS CALLED HAMMOCKS. 2. WE PRESENT A …
-
Smoothed analysis of Gaussian elimination
We present a smoothed analysis of Gaussian elimination, both with partial pivoting and without pivoting. Let A be any matrix and let A be a slight random perturbation of A. We prove that it is unlikely that A has large condition number. Using this result, we prove it is unlikely that A has large …
-
Optimism and Robustness: Learning From Structured and Semi-Random Inputs
… have been studied under two regimes: worst-case analysis, which makes no assumptions about the input, and average-case analysis, which assumes that inputs are drawn from a certain distribution. However, real-world inputs rarely conform to either of these extremes. A new paradigm known as …
-
Optimization models and methods for storage yard operations in maritime container terminals
… integer program model, perform an asymptotic average case analysis, and show that our methods can apply to other storage systems where stacking occurs. Second, we relax the assumption that the full retrieval order of containers is known in advance and study the stochastic container relocation …
-
ΧΕΙΡΟΤΕΡΗ ΚΑΙ ΜΕΣΗ ΣΥΜΠΕΡΙΦΟΡΑ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΓΙΑ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ
… MORE PRECISELY WE INVESTIGATE, (I) THE WORST-CASE PARALLEL COMPLEXITY MOSTLY OF COLORINGAND SHORTEST PATH PROBLEMS IN SPARSE (E.G. PLANAR) GRAPHS, AND (II) THE AVERAGE-CASE PARALLEL COMPLEXITY OF A GRAPH COLORING PROBLEM WHICH IS KNOWN TO BE NP-COMPLETE IN THE WORST CASE. THE ALGORITHMS CAN BE …