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 40 for “"Bounded Error"”.

  1. Nonlinear Bounded-Error Target State Estimation Using Redundant States

    … passive sensors. As an alternative, we propose a bounded-error (or set-membership) approach to the target state estimation problem. Such estimators are nearly as old as the Kalman filter, but have enjoyed much less attention. In this study we develop a practical estimator that bounds the target …

    arizona-thes Repository record for Nonlinear Bounded-Error Target State Estimation Using Redundant States (opens in a new tab)

  2. Applications of interval methods to parameter set estimation from bounded-error data

    … compute the parameters so that the mean-squared error between the model output and the desired response is minimized. A robust approach to the estimation problem is possible when the error between the parametric model and the desired response is bounded. This approach, called parameter set …

    marquette Repository record for Applications of interval methods to parameter set estimation from bounded-error data (opens in a new tab)

  3. Models and characterizations of 1-way quantum finite automata

    … when they are restricted to acceptance with bounded error, and we show that, when they are not so restricted, they can solve the word problem over the free group. We show that they can be simulated by probabilistic finite automata, which implies that they are no more powerful than …

    ubc Repository record for Models and characterizations of 1-way quantum finite automata (opens in a new tab) Download PDF for Models and characterizations of 1-way quantum finite automata (opens in a new tab)

  4. Pseudorandom generators and structural complexity

    … polynomial-time hierarchy, the randomization in bounded-error probabilistic algorithms is interchangeable with that in random oracles. The proof of this theorem, essentially due to Nisan and Wigderson, provides new methods and results for using pseudorandom generators in solving problems in …

    iastate Repository record for Pseudorandom generators and structural complexity (opens in a new tab)

  5. Shape Approximation of Printed Images in VLSI Design

    … which approach the original shape with tighter error restriction, are preferable. Many existing approximation algorithms produce a single approximate polygon per shape, utilizing two main approaches: piecewise linear fit with a fixed number of segments or bounded error, and identification of …

    uiuc Repository record for Shape Approximation of Printed Images in VLSI Design (opens in a new tab)

  6. Query Complexity of Recursively Composed Functions

    … notions of randomized query complexity; bounded-error randomized ($\R(f)$), and zero-error randomized ($\R_0(f)$). These have their natural analogues from the classical model of computation, $\R$ corresponding to BPP or ``Monte Carlo" algorithms and $\R_0$ to ZPP or ``Las Vegas" …

    waterloo Repository record for Query Complexity of Recursively Composed Functions (opens in a new tab)

  7. Operators of Higher Order

    … in existential, universal and probabilistic bounded error quantifiers ranging over words and sets of words, i.e. oracles if we think in a Turing machine model. In addition to the standard oracle access mechanism, we also consider quantifiers ranging over oracles to which access is restricted …

    wurz-thes Repository record for Operators of Higher Order (opens in a new tab)

  8. Pure Likelihood-based Methods for Genetic Association Studies

    … operational characteristics, with small and bounded error probabilities, and the framework has been applied to genetic linkage and association studies. We discuss some of the well-recognized issues associated with the Frequentist framework in assessing association evidence in genetic …

    toronto-retro Repository record for Pure Likelihood-based Methods for Genetic Association Studies (opens in a new tab)

  9. Robust Beamforming for Cognitive and Cooperative Wireless Networks

    … is modeled using either a Stochastic Error (SE) model or a Norm Bounded Error (NBE) model. In the case of the SE model of uncertainty, the average performance measure and in the case of the NBE model of uncertainty, the worst case performance measures are optimized. In the former case …

    nus Repository record for Robust Beamforming for Cognitive and Cooperative Wireless Networks (opens in a new tab) Download file for Robust Beamforming for Cognitive and Cooperative Wireless Networks (opens in a new tab)

  10. Structural properties of one-tape Turing machines.

    … nondeterministic, co-nondeterministic, and bounded-error probabilistic computations recognize exactly regular languages whereas probabilistic and quantum Turing machines can recognize even non-regular languages.

    ottawa-retro Repository record for Structural properties of one-tape Turing machines. (opens in a new tab)

  11. Validation of a CFD Approach for Gas Turbine Internal Cooling Passage Heat Transfer Prediction

    … model of internal turbine cooling channels with bounded error allows for the identification of particular shortcomings of heat transfer correlations and provides a baseline for future CFD based exploration of internal turbine cooling concepts.

    calpoly Repository record for Validation of a CFD Approach for Gas Turbine Internal Cooling Passage Heat Transfer Prediction (opens in a new tab)

  12. Internal model control of uncertain Euler-Lagrange systems

    … These approaches provide formal guarantees of bounded error trajectories and form the theoretical foundation of the proposed control framework. The study begins with the development of an optimal controller for fully known systems and progresses to a robust design that incorporates an internal …

    brazil-ufrgs Repository record for Internal model control of uncertain Euler-Lagrange systems (opens in a new tab)

  13. Parameter Identification and the Design of Experiments for Continuous Non-Linear Dynamical Systems

    … the assumptions made about the behavior of the error in the statistical model. In this presentation we describe how to approach this problem using a combination of statistical and mathematical theory with reliable computation. More specifically, we present a new approach to bounded error …

    vt Repository record for Parameter Identification and the Design of Experiments for Continuous Non-Linear Dynamical Systems (opens in a new tab)

  14. Approximate Data Analytics Systems

    … where new data continuously arrives as an unbounded stream. In this thesis, we design and implement approximate computing techniques for processing and interacting with high-speed and large-scale stream data to achieve low latency and efficient utilization of resources. To achieve these …

    qucosa-diss

  15. A deep learning-assisted inherent strain method for predicting welding distortions in large stiffened panels

    … model achieves the lowest overall prediction error, while continuity tests across plate- and web-thickness variations produce smooth and bounded error trends. Against thermal elastic-plastic reference solutions, distortion predictions based on surrogate-generated strain fields achieve …

    ubc Repository record for A deep learning-assisted inherent strain method for predicting welding distortions in large stiffened panels (opens in a new tab) Download PDF for A deep learning-assisted inherent strain method for predicting welding distortions in large stiffened panels (opens in a new tab)

  16. Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing

    … system, we show that the approximation has bounded error. Furthermore, we show that the error bound of the approximation sequence improves as the approximation approaches the true problem. This presents a trade-off between computational complexity and accuracy of the solution. A decision …

    byu Repository record for Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing (opens in a new tab) Download PDF for Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing (opens in a new tab)

  17. Quantum algorithms for finding extrema with unary predicates

    … are required to solve the problem even with bounded error. Combining variants of the Grover's search [1, 2] algorithm and the optimal classical unary extrema finding algorithm, we have derived a series of new quantum algorithms, some running in time as fast as O(√n lg*n+lg|U|). This shows …

    ubc Repository record for Quantum algorithms for finding extrema with unary predicates (opens in a new tab) Download PDF for Quantum algorithms for finding extrema with unary predicates (opens in a new tab)

  18. Scalable, Efficient, and Fair Algorithms for Structured Convex Optimization Problems

    … regression problems can be carried out with bounded-error pre-conditioners. We also present conjectures regarding the running time of computing symmetric factorizations for Hankel matrices that imply faster-than-matrix-multiplication time algorithms for solving sparse poly-conditioned linear …

    gatech Repository record for Scalable, Efficient, and Fair Algorithms for Structured Convex Optimization Problems (opens in a new tab)

  19. From Theory to Practice: a Stochastic Framework for Utility-Driven Capital Allocation

    … The central mathematical results are a bounded error–propagation lemma, showingthat perturbations in forecasts affect utilities only linearly in the error size, and a latent–space contraction theorem, showing that state trajectories converge uniquely when embedded into appropriate …

    toronto-retro Repository record for From Theory to Practice: a Stochastic Framework for Utility-Driven Capital Allocation (opens in a new tab)

  20. Studies in classical simulation vs quantum advantage for algorithms and communication

    … if we allow for interaction or require only a bounded error solution. We conclude by stating and numerically justifying a conjecture about quantum state antidistinguishability that could have some implications for quantum foundations.</p>

    oxford Repository record for Studies in classical simulation vs quantum advantage for algorithms and communication (opens in a new tab)

Page 1 of 2