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 20 of 22 for “"Optimal Bounds"”.

  1. Pusgrupių aproksimacijų tikslumo tyrimai /

    … for Euler's approximations of semigroups with optimal bounds for the remainder terms. We provide various explicit formulas for the coefficients for these expansions. For Yosida approximations of semigroups we obtain two optimal error bounds with optimal constants. We also construct asymptotic …

    vilnius Repository record for Pusgrupių aproksimacijų tikslumo tyrimai / (opens in a new tab)

  2. Investigations of the accuracy of approximations of semigroups /

    … for Euler's approximations of semigroups with optimal bounds for the remainder terms. We provide various explicit formulas for the coefficients for these expansions. For Yosida approximations of semigroups we obtain two optimal error bounds with optimal constants. We also construct asymptotic …

    vilnius Repository record for Investigations of the accuracy of approximations of semigroups / (opens in a new tab)

  3. FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.

    … and the sieve strategy which uses stronger than optimal bounds. The fixed order branch-and-bound method with selective expansion of subproblems is effective in reducing the error estimate quickly whereas the sieve strategy is effective in reducing the error estimate as well as finding improved …

    arizona-thes Repository record for FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING. (opens in a new tab)

  4. Temporal isolation of latency-sensitive tasks in real-time nested locking

    … locking protocols that ensure asymptotically optimal bounds on priority inversion, that support fine-grained nesting of critical sections, *or* that are independence-preserving under clustered scheduling. However, while several protocols manage to come with two out of these three desirable …

    reykjavik Repository record for Temporal isolation of latency-sensitive tasks in real-time nested locking (opens in a new tab)

  5. Spectral approximation by the polar transformation

    … by the polar potential h(r). In many cases the optimal values $\{q\sb1,q\sb2\}$ of the power q can be chosen so that the corresponding polar functions $\{g\sb1,g\sb2\}$ have definite and opposite convexity. For such cases the spectral approximations provide both upper and lower bounds for the …

    concordia Download PDF for Spectral approximation by the polar transformation (opens in a new tab)

  6. Black Virus Disinfection in Chordal Rings

    … analyze the cost of all our solutions, providing optimal bounds for some classes of chordal rings.

    ottawa-retro Repository record for Black Virus Disinfection in Chordal Rings (opens in a new tab)

  7. From prepare-and-measure scenarios to certified quantum randomness

    … of finite detection efficiency by determining optimal bounds and critical thresholds, and derive new quantum bounds for dimension witnesses in scenarios with multiple measurement settings. These results show that realistic and relatively simple optical setups are already enough to produce …

    brazil-ufrn Repository record for From prepare-and-measure scenarios to certified quantum randomness (opens in a new tab)

  8. Understanding Scaled Prediction Variance Using Graphical Methods for Model Robustness, Measurement Error and Generalized Linear Models for Response Surface Designs

    … model space. Scaling the FDS curves by the G-optimal bounds of each model helps compare designs on the same model scale. FDS plots are also adapted for comparing designs under the GLM framework. Since parameter estimates need to be specified, robustness to parameter misspecification is …

    vt Repository record for Understanding Scaled Prediction Variance Using Graphical Methods for Model Robustness, Measurement Error and Generalized Linear Models for Response Surface Designs (opens in a new tab)

  9. Nonlinear embeddings into Banach spaces

    … some new results. In Section 3 we calculate new optimal bounds from below for distortion fo $\ell_q$ into $p$-uniformly convex Banach spaces. In particular, this allows us to present a new proof of the fact that there exists a doubling subset of $\ell_q$ that does not admit any bi-Lipschitz …

    tamu Repository record for Nonlinear embeddings into Banach spaces (opens in a new tab)

  10. Embeddings of infinite groups into Banach spaces

    … of such spaces. Consequently, we obtain optimal embeddings of such spaces into certain Banach spaces. The ideas here have been extended to other closed three-manifolds and to higher dimensional analogues of graph manifolds.</p> <p>In Chapter 4 we give an explicit method of embedding …

    oxford Repository record for Embeddings of infinite groups into Banach spaces (opens in a new tab)

  11. Second Order Dehn Functions of Finitely Presented Groups and Monoids

    … isomorphism type. In Chapters 4, we give upper bounds for asynchronously combable groups with departure function. In Chapter 5, we first give the general upper bounds for direct products. Then we concentrate on the calculations for the optimal bounds of second order Dehn functions of direct …

    glasgow Download PDF for Second Order Dehn Functions of Finitely Presented Groups and Monoids (opens in a new tab)

  12. Distributed fault tolerant distance computation in graphs : algorithms and lower bounds

    … distance-related computations, and to develop bounds on the limits to the efficiency of such algorithms by proving unconditional lower bounds. In this thesis, we develop distributed algorithms and lower bounds for the Replacement Paths problem, which addresses a shortest path between a pair of …

    texas Repository record for Distributed fault tolerant distance computation in graphs : algorithms and lower bounds (opens in a new tab)

  13. Lower bound methods for multiparty communication complexity

    … among multiple parties. Proving lower bounds in the “Number on the Forehead” model of Chandra, Furst, and Lipton has been quite difficult, but results are of importance in many areas including time-space tradeoffs and lower bounds for VLSI and Boolean circuits, as well as constructions …

    texas Repository record for Lower bound methods for multiparty communication complexity (opens in a new tab)

  14. Sweepouts of Riemannian Surfaces

    … and boundary length of M. We provide nearly optimal bounds for the lengths of curves in a sweepout and use it to obtain curvature-free upper bounds for lengths of simple closed geodesics on a 2-sphere. This is a joint work with A. Nabutovsky and R. Rotman. In the third chapter we construct a …

    toronto-retro Repository record for Sweepouts of Riemannian Surfaces (opens in a new tab)

  15. Advances in Quantum Metrology: Continuous Variables in Phase Space

    … thermal noise. In this setup, we also show the optimal measurement scheme, which is currently not employed in experiment. Throughout our metrology discussions, we will also discuss various quantum limits and use quantum Fisher information to show optimal bounds. When applicable, we also discuss …

    lsu-thes Repository record for Advances in Quantum Metrology: Continuous Variables in Phase Space (opens in a new tab)

  16. Optimal Success Bounds for Single Query Quantum Algorithms Computing the General SUM Problem

    … with in this thesis is whether this algorithm is optimal for the general sum case. The problem is expressed as a semidefinite program, given for all instances. The instance for strings of length two and algorithms making a single query is solved and a proof is given. Significant insight into the …

    waterloo Repository record for Optimal Success Bounds for Single Query Quantum Algorithms Computing the General SUM Problem (opens in a new tab)

  17. Algorithms and complexity analyses for some combinational optimization problems

    … fault-tolerant spanners having asymptotically optimal bounds for both the maximum degree and the total cost at the same time. Then an efficient algorithm is developed which finds fault-tolerant spanners with asymptotically optimal bound for the maximum degree and almost optimal bound for the …

    njit Repository record for Algorithms and complexity analyses for some combinational optimization problems (opens in a new tab)

  18. Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία και εξελικτικά δίκτυα

    … threshold. Finally, we give close to optimal bounds (that hold with probability that goes to 1 for a wide range of the parameters of the model) for important quantities (like the mixing time and the cover time) concerning random walks on random instances of ${\cal G}_{n, m, p}$. In the …

    greece Repository record for Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία και εξελικτικά δίκτυα (opens in a new tab)

  19. On word-representability of Apollonian graphs and 1-11-representability of graphs

    … in fact, permutationally so, and obtained near optimal bounds on representation length. We summarise this work and discuss the open questions it raises, which now form the natural sequel to the line of research begun in this thesis.

    strathclyde Repository record for On word-representability of Apollonian graphs and 1-11-representability of graphs (opens in a new tab)

  20. Risk Analysis: Measures of concordance, their compatibility and capital allocation

    … we show that Blomqvist's beta attains the optimal asymptotic variance and Spearman's rho outperforms van der Waerden's coefficient. We also find that the optimal bounds of the asymptotic variance are attained by Kendall's tau. The third topic of this thesis is to efficiently estimate risk …

    waterloo Repository record for Risk Analysis: Measures of concordance, their compatibility and capital allocation (opens in a new tab)

Page 1 of 2