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 998 for “"Upper bounds"”.

  1. Improved stick number upper bounds

    … of knots, although theoretical and observed bounds exist. There is a natural correspondence between stick knots and polygons in R3. Previous research has attempted to improve observed stick number upper bounds by computationally generating such polygons and identifying the knots that they …

    colostate Repository record for Improved stick number upper bounds (opens in a new tab)

  2. Upper bounds for cake cutting

    In this thesis we consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from $n$ agents. The problem has received attention in computer science, mathematics, and economics. It has been a major open problem whether there exists a …

    unsw Repository record for Upper bounds for cake cutting (opens in a new tab)

  3. UPPER BOUNDS ON THE SPLITTING OF THE EIGENVALUES

    We establish the upper bounds for the difference between the first two eigenvalues of the relative and absolute eigenvalue problems. Relative and absolute boundary conditions are generalization of Dirichlet and Neumann boundary conditions on functions to differential forms respectively. The domains …

    uky-thes Repository record for UPPER BOUNDS ON THE SPLITTING OF THE EIGENVALUES (opens in a new tab)

  4. Upper Bounds to the Capacity of Wireless Networks

    … thesis, I mainly focus on the evaluation of the upper bounds to the capacity of wireless networks. With the consideration of the two measures, the maximal transmission rate for any source-destination pair and the transport capacity of wireless networks, I summarize the most recent results to the …

    waterloo Repository record for Upper Bounds to the Capacity of Wireless Networks (opens in a new tab)

  5. ALGORITHMS FOR UPPER BOUNDS OF LOW DIMENSIONAL GROUP HOMOLOGY

    … present a series of algorithms that finds an upper bound on the second homology group of a finitely-presented group. In particular, given a finitely-presented group G, Hopf's formula expresses the second integral homology of G in terms of generators and relators; the algorithms exploit Hopf's …

    uky-thes Repository record for ALGORITHMS FOR UPPER BOUNDS OF LOW DIMENSIONAL GROUP HOMOLOGY (opens in a new tab)

  6. Upper bounds for the energy of hard-sphere hamiltonians

    zurich Restricted access

  7. Improved upper bounds and lower bounds on broadcast function

    … to construct broadcast graphs and to obtain upper bounds on B(n). In this thesis, we study the compounding and the vertex addition broadcast graph constructions, which improve the upper bound on B(n). We also present the first nontrivial general lower bound on B(n).

    concordia Download PDF for Improved upper bounds and lower bounds on broadcast function (opens in a new tab)

  8. Upper bounds on minimum distance of nonbinary quantum stabilizer codes

    … Sloane (July 1998) have constructed a table of upper bounds on the minimum distance of these codes using linear programming methods. However, not much is known in the case of nonbinary stabilizer codes. In this thesis, we establish a bridge between selforthogonal classical codes over the finite …

    tamu Repository record for Upper bounds on minimum distance of nonbinary quantum stabilizer codes (opens in a new tab)

  9. Polyhedra Study of Mixed Integer Programs With Variable Upper Bounds

    … and binary variables and in addition, variable upper bound constraints are present. We introduce the flow cover inequality, which is valid for a projection. We also give conditions under which this inequality is facet defining. We use sequence independent lifting to obtain valid inequalities for …

    uiuc Repository record for Polyhedra Study of Mixed Integer Programs With Variable Upper Bounds (opens in a new tab)

  10. Upper Bounds for the Mean Life of Self-Repairing Systems

    Made available in DSpace on 2014-12-08T22:23:24Z (GMT). No. of bitstreams: 1 6406094.pdf: 2132068 bytes, checksum: 2caf0e5a46b0ad8f1fb4fe18dcd3a3df (MD5) Previous issue date: 1963

    uiuc Repository record for Upper Bounds for the Mean Life of Self-Repairing Systems (opens in a new tab)

  11. Upper Bounds on the number of embeddings of minimally rigid graphs

    Στη θεωρία γραφημάτων (γράφων), ένα άκαμπτο γράφημα είναι ένα γράφημα που έχει πεπερασμένο αριθμό εμβυθίσεων στο $\mathbb{R}^d$, ως προς τις Ευκλείδιες κινήσεις, για δεδομένα μήκη ακμών. Η εμβύθιση γραφήματος στο $\mathbb{R}^d$ είναι μια ανάθεση των κορυφών σε σημεία στο $\mathbb{R}^d$, η οποία …

    athens Repository record for Upper Bounds on the number of embeddings of minimally rigid graphs (opens in a new tab)

  12. 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)

  13. Upper Bounds for the Number of Integral Points on Quadratic Curves and Surfaces

    … points at infinity, and ellipses. We give upper bounds for the number of integral points on such curves which depends on the number of divisors of the determinant of a given conic. Next we consider quadratic surfaces of the form q(x, y, z) = k, where k is an integer and q is a …

    waterloo Repository record for Upper Bounds for the Number of Integral Points on Quadratic Curves and Surfaces (opens in a new tab)

  14. Upper Bounds for the Gromov Width of Coadjoint Orbits of Compact Lie Groups

    … symplectic manifold. More precisely, we show an upper bound for the Gromov width of coadjoint orbits of compact Lie groups with respect to the Kostant-Kirillov-Souriau form. This upper bound extends a Theorem of Zoghi for regular coadjoint orbits; and in type A it complements a result of Pabiniak …

    toronto-retro Repository record for Upper Bounds for the Gromov Width of Coadjoint Orbits of Compact Lie Groups (opens in a new tab)

  15. Upper bounds of second Laplacian eigenvalues on the sphere and the projective space

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-05-01

    uiuc Repository record for Upper bounds of second Laplacian eigenvalues on the sphere and the projective space (opens in a new tab)

  16. On the Attainability of Upper Bounds for the Circular Chromatic Number of <em>K</em><sub>4</sub>-Minor-Free Graphs.

    … and Zhu have given a function μ(g) that gives an upper bound for the circular-chromatic number for every K4-minor-free graph Gg of odd girth at least g, g ≥ 3. In [7], they have shown that their upper bound in [6] can not be improved by constructing a sequence of graphs approaching μ(g) …

    etsu Repository record for On the Attainability of Upper Bounds for the Circular Chromatic Number of <em>K</em><sub>4</sub>-Minor-Free Graphs. (opens in a new tab) Download PDF for On the Attainability of Upper Bounds for the Circular Chromatic Number of <em>K</em><sub>4</sub>-Minor-Free Graphs. (opens in a new tab)

Page 1 of 50