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 “"LEXICOGRAPHICAL ORDERING"”.

  1. PLURIPOTENTIAL THEORY ASSOCIATED WITH CONVEX BODIES AND RELATED NUMERICSPLURIPOTENTIAL THEORY ASSOCIATED WITH CONVEX BODIES AND RELATED NUMERICS

    … of the foundational proofs rely on the precise lexicographical ordering of the monomials and the standard notion of degree. However, it has recently been shown that different orderings have value in polynomial approximation [Tre17]. This dissertation takes part in the effort to generalize …

    iu Repository record for PLURIPOTENTIAL THEORY ASSOCIATED WITH CONVEX BODIES AND RELATED NUMERICSPLURIPOTENTIAL THEORY ASSOCIATED WITH CONVEX BODIES AND RELATED NUMERICS (opens in a new tab)

  2. Verificación formal en ACL2 del algoritmo de Buchberger

    … properties. (2) These rings are equipped with an ordering relation induced by the terms (a lexicographical ordering on terms is defined). Its well-foundedness is proved and a polynomial embedding in epsilon0-ordinals is obtained. (3) An executable and verified ACL2 implementation of polynomials …

    cadiz Repository record for Verificación formal en ACL2 del algoritmo de Buchberger (opens in a new tab)

  3. Efficient String Algorithms for Data Security and Privacy

    … the orientation identification stage using lexicographical ordering to determine the correct orientation. Our first step was to extract the binary circular string from the scanned image using the proposed extraction method over specified radii to produce binary strings in linear time. …

    kings Repository record for Efficient String Algorithms for Data Security and Privacy (opens in a new tab) Download PDF for Efficient String Algorithms for Data Security and Privacy (opens in a new tab)

  4. ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΕΠΙΛΟΓΗΣ ΔΙΑΔΡΟΜΩΝ ΣΕ ΑΕΡΟΠΟΡΙΚΑ ΔΙΚΤΥΑ. ΑΛΓΟΡΙΘΜΙΚΗ ΠΡΟΣΕΓΓΙΣΗ

    … OF DIFFERENT TYPES ARE DEFINED AND ORDERED LEXICOGRAPHICALLY, ACCORDING TO THEIR IMPORTANCE. TWO ORIGINAL ALGORITHMS ARE DEVELOPED FOR THE MINMAX PATH PROBLEM. THREE ORIGINAL ALGORITHMS ARE DEVELOPED FOR THE LEXICOGRAPHICAL OPTIMAL PATH PROBLEM. THESE ALGORITHMS ARE TESTED IN RANDOM GRAPHS. …

    greece Repository record for ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΕΠΙΛΟΓΗΣ ΔΙΑΔΡΟΜΩΝ ΣΕ ΑΕΡΟΠΟΡΙΚΑ ΔΙΚΤΥΑ. ΑΛΓΟΡΙΘΜΙΚΗ ΠΡΟΣΕΓΓΙΣΗ (opens in a new tab)