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 7 of 7 for “"lowerbound"”.

  1. Optimization Algorithms for Information Retrieval and Transmission in Distributed Ad Hoc Networks

    … retrieval requirement. In addition, we derive a lowerbound result for the object locating problem which shows that logarithmic storage overhead is asymptotically optimal to achieve linear retrieval cost for growth bounded networks. Bandwidth is a scarce resource for wireless ad hoc networks, and …

    tamu Repository record for Optimization Algorithms for Information Retrieval and Transmission in Distributed Ad Hoc Networks (opens in a new tab)

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

    … show clear evidence of the existence of a lowerbound capacity that typically ranges from 0.4 to 0.8 of the predicted capacity in both cohesive and cohesionless soils. Results from reliability analyses indicate that the presence of a lower-bound capacity can have a significant effect on …

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

  3. Distinct-element modelling of intermittent deformation behaviour and fatigue in two large rock slides

    … model using a homogeneous rockmass. Instead, lowerbound properties were applied to the slide, resulting in the development of a sliding surface similar to that interpreted at the site. As well, significant internal deformation was found using these properties, including some suggestive of a …

    ubc Repository record for Distinct-element modelling of intermittent deformation behaviour and fatigue in two large rock slides (opens in a new tab) Download PDF for Distinct-element modelling of intermittent deformation behaviour and fatigue in two large rock slides (opens in a new tab)

  4. Decomposition Methods For Managing Service Parts With Coupled Demands

    … is a lower bound for the exact problem. This lowerbound dynamic program has the advantage of using a state vector that does not need to distinguish among backorders of different ages. We decompose this lower-bound dynamic program using Clark and Scarf's (1960) approach to derive yet another …

    cornell Repository record for Decomposition Methods For Managing Service Parts With Coupled Demands (opens in a new tab)

  5. Performance analysis of wireless relay systems

    … MRC for any number of antennas. Upperbound and lowerbound on the system performance are then derived. Based on the bounds, it is shown that the system can achieve the maximal diversity. Furthermore, the tightness of the upperbound is demonstrated via simulation results. With only the statistics …

    sask Repository record for Performance analysis of wireless relay systems (opens in a new tab)

  6. Computing sparse multiples of polynomials

    We consider the problem of finding a sparse multiple of a polynomial. Given a polynomial f ∈ F[x] of degree d over a field F, and a desired sparsity t = O(1), our goal is to determine if there exists a multiple h ∈ F[x] of f such that h has at most t non-zero terms, and if so, to find such an h. …

    waterloo Repository record for Computing sparse multiples of polynomials (opens in a new tab)