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 8 of 8 for “"distance problem"”.

  1. On the Discrete Number of Tree Graphs

    We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem. Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible …

    vt Repository record for On the Discrete Number of Tree Graphs (opens in a new tab)

  2. ΜΙΑ ΠΡΟΤΑΣΗ ΓΙΑ ΝΕΕΣ ΠΡΟΔΙΑΓΡΑΦΕΣ ΜΕΛΕΤΗΣ ΔΑΣΙΚΩΝ ΔΡΟΜΩΝ

    … SIZE OF THE CROSS- SECTION. STUDY OF THE SIGHT DISTANCE PROBLEM GIVING TABLES AND ESTIMATION MODEL OF THE RELATIVE LENGTHS AND THE EFFECTS ON THE FORMATION OF FOREST ROADS. DETERMINATION OF THE PARAMETERS AND ESTIMATION OF THE DATA AFFECTING THE STUDY WHICH REFERS TO THE HORIZONTAL AND THE …

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

  3. Optimal Point Sets With Few Distinct Triangles

    … extension of a variant of the distinct distance problem put forward by ErdH{o}s and Fishburn cite{ErdosFishburn}.

    vt Repository record for Optimal Point Sets With Few Distinct Triangles (opens in a new tab)

  4. The Mattila-Sjölin Problem for Triangles

    … at least $frac{(d+1)}{2}$ then its set of distances has nonempty interior. In this dissertation, we present a similar result, namely that if a compact subset $E$ of $mathbb{R}^d$, with $d geq 3$, has a large enough Hausdorff dimension then the set of congruence classes of triangles formed …

    vt Repository record for The Mattila-Sjölin Problem for Triangles (opens in a new tab)

  5. ERES Methodology and Approximate Algebraic Computations

    … (LCM) of a set of polynomials are challenging problems that arise from several applications in applied mathematics and engineering. Several methods have been proposed for the computation of the GCD of polynomials using tools and notions either from linear algebra or linear systems theory. …

    city-london Repository record for ERES Methodology and Approximate Algebraic Computations (opens in a new tab)

  6. Safety Issues Of Red-light Running And Unprotected Left-turn At Signalized Intersections

    … Thirdly, geometric models to compute sight distances of unprotected left-turns were developed for different signalized intersection configurations including a straight approach leading to a straight one, a straight approach leading to a curved one, and a curved approach leading to a curved …

    ucf

  7. Optimization Models and Analysis of Routing, Location, Distribution, and Design Problems on Networks

    A variety of practical network optimization problems arising in the context of public supply and commercial transportation, emergency response and risk management, engineering design, and industrial planning are addressed in this study. The decisions to be made in these problems include the …

    vt Repository record for Optimization Models and Analysis of Routing, Location, Distribution, and Design Problems on Networks (opens in a new tab)

  8. Vergleichen und Aggregieren von partiellen Ordnungen

    … Kandidaten. Daneben werden aber auch Rangordnungsprobleme als eine Variante von Wahlsystemen untersucht. Bei diesen bringt jeder Wähler seine Meinung in Form einer totalen Ordnung über der Menge der Kandidaten zum Ausdruck, wodurch seine oftmals komplexe Meinung exakter repräsentiert werden kann …

    passau-thes Repository record for Vergleichen und Aggregieren von partiellen Ordnungen (opens in a new tab)