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 12778 for “"complexity"”.

  1. Fine-grained complexity meets communication complexity

    Fine-grained complexity aims to understand the exact exponent of the running time of fundamental problems in P. Basing on several important conjectures such as Strong Exponential Time Hypothesis (SETH), All-Pair Shortest Path Conjecture, and the 3-Sum Conjecture, tight conditional lower bounds are …

    mit Repository record for Fine-grained complexity meets communication complexity (opens in a new tab)

  2. Complexity and Partitions

    Computational complexity theory usually investigates the complexity of sets, i.e., the complexity of partitions into two parts. But often it is more appropriate to represent natural problems by partitions into more than two parts. A particularly interesting class of such problems consists of …

    wurz-thes Repository record for Complexity and Partitions (opens in a new tab)

  3. Algorithmic specified complexity.

    … improbable events convey information. Kolmogorov complexity captures the idea of information as something easily described. But not all easily described objects are information. The proposed Algorithmic Specified Complexity takes into account both Shannon Information and Kolmogorov complexity to …

    baylor Repository record for Algorithmic specified complexity. (opens in a new tab)

  4. Minimum description complexity

    … method of model selection: minimum description complexity (MDC). The approach is motivated by the Kullback-Leibler information distance. The method suggests choosing the model set for which the model set relative entropy is minimum. We provide a probabilistic method of MDC estimation for a class …

    mit Repository record for Minimum description complexity (opens in a new tab)

  5. Complexity analysis of lumped parameter models : development of complexity reduction algorithm

    … thesis, we analyze how tank models of varying complexity compare in terms of accuracy and utility. An algorithm called Complexity Reduction Algorithm (CRA) is developed that automatically finds those models that are likely to be the best by choosing a certain path through the model space. Since …

    reykjavik Repository record for Complexity analysis of lumped parameter models : development of complexity reduction algorithm (opens in a new tab)

  6. Cost of complexity : mitigating transition complexity in mixed-model assembly lines

    … confusion as the consequence of 'transition' complexity, which results not only from variety but also familiarity; how quickly can a new situation be recognized, and how quickly can associates remember what to do and recover the skills needed to succeed. Recommendations follow to mitigate the …

    mit Repository record for Cost of complexity : mitigating transition complexity in mixed-model assembly lines (opens in a new tab)

  7. Troubleshooting interactive complexity bugs

    The term “interactive complexity” was introduced by Charles Perrow in his famous book Normal Accidents: Living with High-Risk Technologies [1]. He used the term to describe the interacting tendency of systems with large number of components. He argued that, in systems with large number of …

    uiuc Repository record for Troubleshooting interactive complexity bugs (opens in a new tab)

  8. Reduced complexity adaptive beamformers

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms

    uiuc Repository record for Reduced complexity adaptive beamformers (opens in a new tab)

  9. A study on complexity

    This thesis explores quantum complexity for various quantum systems. Quantum complexity is a well defined quantity in quantum information theory that measures the difficulty of constructing a quantum state from a given reference state and so far, various methods within high energy physics …

    cape-town Repository record for A study on complexity (opens in a new tab)

  10. Composites cost modeling : complexity

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1993.

    mit Repository record for Composites cost modeling : complexity (opens in a new tab)

  11. Quantum query complexity revisited

    … look at the polynomial method for quantum query complexity and relate it to the BQPA = PA question for a random oracle A. We will also look at some open problems and improve some bounds relating classical and quantum complexity.

    mit Repository record for Quantum query complexity revisited (opens in a new tab)

  12. complexity form order structure

    … hierarchy and modularity. The presence of both complexity and order gives articulation to all scales of the project, allows for variety without chaos, and repetition without monotony. All of these characteristics are essential for the program of a high-rise residential building that accommodates …

    vt Repository record for complexity form order structure (opens in a new tab)

  13. Revealing the Simple Complexity

    "Revealing the simple complexity" is a series of explorations which investigates the wonders of Persian patterns and develops its principles through generative and interactive design.The exploration consists of four main stages of studies and manifestations. [1] Fundamental studies, delves into the …

    vt Repository record for Revealing the Simple Complexity (opens in a new tab)

  14. Low Complexity Multiview Video Coding

    … the cost of significantly higher computational complexity which hampers the real-world realization of MVC encoder in applications such as 3D live broadcasting and interactive Free Viewpoint Television (FTV), and (ii) compressed 3D videos can suffer from packet loss during transmission, which can …

    de-montfort Repository record for Low Complexity Multiview Video Coding (opens in a new tab)

  15. Algebraic closures in complexity theory

    … and structures which are derived from these in complexity theory. We classify problems with Boolean circuits and Boolean constraints according to their complexity. We transfer algebraic structures to structural complexity. We use the generation problem to classify important complexity classes.

    wurz-thes Repository record for Algebraic closures in complexity theory (opens in a new tab)

  16. TEXT COMPLEXITY AND TEXT SIMPLIFICATION

    … This thesis is concerned with the study of the complexity of the crisis management sub-language and with methods to produce new, clear texts and to rewrite pre-existing crisis management documents which are too complex to be understood. By doing this, this interdisciplinary study makes several …

    wlv Repository record for TEXT COMPLEXITY AND TEXT SIMPLIFICATION (opens in a new tab)

  17. Vocal Complexity in Indri indri

    unito Repository record for Vocal Complexity in Indri indri (opens in a new tab)

  18. Complexity over Finite-Dimensional Algebras

    <p>In this thesis we study two types of complexity of modules over finite-dimensional algebras.</p> <p>In the first part, we examine the Ω-complexity of a family of self-injective k-algebras where k is an algebraically closed field and Ω is the syzygy operator. More precisely, let T be the trivial …

    syracuse-diss Repository record for Complexity over Finite-Dimensional Algebras (opens in a new tab)

Page 1 of 639