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 4 of 4 for “"Computing bounds"”.

  1. Relay Aided Networks and Distributed Computing: Bounds and Algorithms for Cooperative Decentralized Systems

    … for the tasks of communication and distributed computing. In these systems, a central node uses a set of n cooperating decentralized nodes to perform an otherwise difficult/complex task. We primarily focus on two such systems: (i) a Gaussian half-duplex n relay network for communicating data …

    umn Repository record for Relay Aided Networks and Distributed Computing: Bounds and Algorithms for Cooperative Decentralized Systems (opens in a new tab)

  2. On Garabedian's method of solving the wave equation

    … theorem, and in the even dimensional case by computing bounds on the integrals.

    rice Repository record for On Garabedian's method of solving the wave equation (opens in a new tab)

  3. Scalable Model Counting for Program Analysis

    … methods have shown to be highly successful in computing bounds on the model count of a propositional formula. These hashing-based algorithms repeatedly check the satisfiability of a formula subject to random parity constraints (XOR streamlining) and give an estimate of the model count with a …

    umn Repository record for Scalable Model Counting for Program Analysis (opens in a new tab)

  4. Upper bounds on the values of the positive roots of polynomials

    This thesis describes new results on computing bounds on the values of the positive roots of polynomials. Bounding the roots of polynomials is an important sub-problem in many disciplines of scientific computing. Many numerical methods for finding roots of polynomials begin with an estimate of an …

    greece Repository record for Upper bounds on the values of the positive roots of polynomials (opens in a new tab)