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 2021 for “"lower bound"”.

  1. Lower Bound Confidence Intervals

    … component of variance o2a with a prescribed lower bound on the confidence coefficient. This method is compared with various approximations and with Williams' procedure [12], the only other bounded approximation. The actual confidence coefficient associated with the interval is then evaluated …

    central-wash Repository record for Lower Bound Confidence Intervals (opens in a new tab)

  2. Estimating imprecision lower bound in a neighbourhood of a known Cramér-Rao lower bound

    … outcomes, is determined by the Cramér-Rao lower bound (CRLB). However, which distribution pertains to the measurement setup can itself fluctuate for running each trial of the experiment or even within one run, meaning that we are estimating the distribution parameter in the case that we …

    calgary Repository record for Estimating imprecision lower bound in a neighbourhood of a known Cramér-Rao lower bound (opens in a new tab)

  3. Lower bound for scalable Byzantine agreement

    We consider the problem of computing Byzantine Agreement in a synchronous network with n processors each with a private random string, where each pair of processors is connected by a private communication line. The adversary is malicious and non-adaptive, i.e., it must choose the processors to …

    uvic Repository record for Lower bound for scalable Byzantine agreement (opens in a new tab)

  4. A lower bound for the Laplacian.

    … I study the Dirichlet Laplacian in an unbounded Euclidean domain of dimension n, Rⁿ, and in an unbounded domain in a hyperbolic space of dimension 2, H². The basic problem is to obtain estimates from below for the spectrum of the Laplacian, σ(Δ). In the case of an Euclidean domain the …

    arizona-thes Repository record for A lower bound for the Laplacian. (opens in a new tab)

  5. Lower bound methods for multiparty communication complexity

    … is distributed 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 …

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

  6. Lower bound resource requirements for machine intelligence

    … research effort is to provide an estimate on the lower bound resource requirements for machine intelligence. A working definition of machine intelligence for purposes of this research is provided, along with definitions of an abstract architecture, workflow, and performance model. Combined …

    iu Repository record for Lower bound resource requirements for machine intelligence (opens in a new tab)

  7. Sublinear Algorithm And Lower Bound For Combinatorial Problems

    … (SFM). In particular, we give a polynomial lower bound on the number of rounds we need to compute s − t max flow - a special case of SFM - in the streaming model. We also prove a polynomial lower bound on the number of rounds we need to solve the general SFM problem in polynomial queries.

    penn Repository record for Sublinear Algorithm And Lower Bound For Combinatorial Problems (opens in a new tab)

  8. An Almost Tight Lower Bound for Abortable Leader Election

    … The main result discussed here is a lower bound of Ω(log n/ log log n) remote memory references (RMR) of abortable leader election in both cache coherent (CC) and distributed shared memory (DSM) models. Hence, showing a gap in the RMR complexity of abortable and non-abortable leader …

    calgary Repository record for An Almost Tight Lower Bound for Abortable Leader Election (opens in a new tab)

  9. On the lower bound for the number ofn-ominoes

    Unit squares having their vertices at integer points in the Cartesian plane are called cells. A finite set of integer points forming a vertex set of a connected subgraph of the square-lattice-graph G in the Cartesian plane is called a polyomino. A polyomino with exactly n cells is called an …

    nebraska Repository record for On the lower bound for the number ofn-ominoes (opens in a new tab)

  10. The importance of lower-bound capacities in geotechnical reliability assessments

    … on the smallest available capacity. This lower-bound capacity is usually neglected in conventional reliability analyses. In this study, databases of load tests conducted on offshore and onshore deep foundations are analyzed to provide evidence for the existence of a lower-bound capacity …

    texas Repository record for The importance of lower-bound capacities in geotechnical reliability assessments (opens in a new tab)

  11. A constitutively consistent lower bound, direct shakedown and ratchet method

    … find the loads at the shakedown and ratchet boundaries have been developed in the past 3 decades. In general, lower bound methods are preferred for design and assessment methodologies. However, to date, the lower bound methods which have been proposed for shakedown and ratchet analysis have …

    strathclyde Repository record for A constitutively consistent lower bound, direct shakedown and ratchet method (opens in a new tab)

  12. Three Essays on Unconventional Monetary Policy at the Zero Lower Bound

    … “Impact of Quantitative Easing at the Zero Lower Bound (with J. Dorich, R. Mendes)”, we introduce imperfect asset substitution and segmented asset markets, along the lines of Andres et al. (2004), in an otherwise standard small open-economy model with nominal rigidities. We estimate the …

    ottawa-retro Repository record for Three Essays on Unconventional Monetary Policy at the Zero Lower Bound (opens in a new tab)

  13. Does zero lower bound policy affect managerial risk-taking and executive compensation?

    This study empirically examined whether the zero lower bound policy of 2008 promotes managerial risk-taking using samples of U.S. publicly traded firms. Based on the evidence documented in previous research, this policy can lead to a change in firms’ managerial risk-taking and in turn result in a …

    brock Repository record for Does zero lower bound policy affect managerial risk-taking and executive compensation? (opens in a new tab)

Page 1 of 102