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 2078 for “"bounds"”.
-
Beyond Bounds
Like a slug, leaving a trail of mucus behind, I leave this long secretion of words. Stained pages, soiled underwear, spilled dreams. Life is not beautiful. It is the accumulation of scars, the imposition of cuts, the kniving of the womb, the stabbing of the soul, and the mind learning to lie and to …
-
Bounds on Urysohn width
… The main results of this thesis establish bounds on the width, relating local and global geometry of Riemannian manifolds in two contexts. One of them is bounding the global width of a manifold in terms of the width of its unit balls. The other one is waist-like inequalities, when a …
-
Bounds on baskets option prices
… approximations we present rigorous analytical bounds for the price of arithmetic basket options using the theory of comonotonicity. In this we follow the ideas in Deelstra et al. [7]. Additionally we provide an interval of hedge parameters (the Greeks). We carry out a numerical sensitivity …
-
Lower bounds in distributed computing
Distributed computing is the study of achieving cooperative behavior between independent computing processes with possibly conflicting goals. Distributed computing is ubiquitous in the Internet, wireless networks, multi-core and multi-processor computers, teams of mobile robots, etc. In this …
-
Contention Bounds for Locking Computations
… availability. In this work we present analytical bounds on the maximum possible contention incurred by a given program over all possible execution schedules, even when running alongside other programs in a busy environment or when scheduled by an adversary. Although we show that computing the …
-
Bounds on Total Domination Subdivision Numbers.
… thesis provides a complete survey of established bounds on the domination subdivision number and the total domination subdivision number. Then in Chapter 4, new results regarding bounds on the total domination subdivision number are given. Finally, a characterization of the total domination …
-
Optimal Simultaneous Confidence Bounds in Regression
… of finding optimal simultaneous confidence bounds for multilinear regression functions with intercept, over bounded regions, is considered. Conditions are derived which imply that the Scheffe-type bound beats the constant width bound for the case of one-sided or two-sided bounding, in the …
-
Uniform bounds in D-minimal structures
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-20 without embargo terms
-
Information-theoretic bounds in learning algorithms
… tools to construct performance bounds for the learning algorithms, with the goal of deepening the understanding of current algorithms and inspiring new learning techniques. The first problem considered involves a sequence of machine learning problems that vary in a bounded manner …
-
Information theoretic bounds for distributed computation
(cont.) In the second formulation, each node has an initial real-valued measurement. Nodes communicate their values via a network with fixed topology and noisy channels between nodes that are linked. The goal is for each node to estimate a given function of all the initial values in the network, so …
-
Error bounds for parallel communication channels.
Thesis: Sc. D., Massachusetts Institute of Technology, Department of Electrical Engineering, 1965
-
Upper and Lower Bounds for Sampling
… understanding of sampling by giving upper bounds and more importantly lower bounds for various sampling algorithms and problem classes. On the upper bound side, we propose new sampling algorithms, motivated by the perspective of sampling as optimization [JKO98], and give convergence …
-
A Metastudy of Algorithm Lower Bounds
… found that improvements to algorithm upper bounds have been steadily decreasing since the 1970s. In this work we aim to discover whether this could be because researchers have already found the optimal versions of many algorithms. In order to get a better sense of the picture, we compiled …
-
Bounds for the nonlinear filtering problem.
Thesis. 1976. M.S.--Massachusetts Institute of Technology. Dept. of Mathematics.
-
Crossing Number Bounds of Mosaic Knot Diagrams
In this thesis, we tabulate some previously undocumented link mosaic diagrams. Next we prove an upper and lower bound on crossing number of certain mosaic diagrams of knots in terms of winding number for knot diagrams that make only counterclockwise turns. Next we begin drawing mosaic diagrams that …
-
Heuristic search under time and cost bounds
<p>Intelligence is difficult to formally define, but one of its hallmarks is the ability find a solution to a novel problem. Therefore it makes good sense that heuristic search is a foundational topic in artificial intelligence. In this context "search" refers to the process of finding a solution …
-
Rigorous Bounds on Strong Interaction Coupling Constants
<p>We investigate the problem of deriving bounds on strong interaction scattering amplitudes from the results of axiomatic field theory. The bounds on the π-π scattering amplitude at points within its analyticity domain which have been obtained by Łukaszuk and Martin are especially interesting …
-
Lower Bounds and Algorithms for Searching Networks
… been revealed. In this thesis, we give new lower bounds on the fast search number. Using the new lower bounds, we prove an explicit formula for the fast search number of the cartesian product of an Eulerian graph and a path. We also give formulas for the fast search number of variants of the …
-
Vertex Connectivity of Graphs: Algorithms and Bounds
… of undirected graphs and presents new bounds and algorithms for these problems.
-
Decidability bounds for extensions of Presburger arithmetic
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms
Page 1 of 104