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 11 of 11 for “"approximation framework"”.
-
Parameter Estimation for Delay Differential Equations: A New Galerkin Approximation Framework
… systems they model. In this thesis, we present a framework for determining the discrete delays, integral kernels, and other unknown model parameters for these equations from training data through a Galerkin approximation approach proposed by citet{CGLW16}. The adopted Galerkin approximation is …
-
Fast Approximation Framework for Timing and Power Analysis of Ultra-Low-Voltage Circuits
… in the Ultra-Low-Voltage region. While some frameworks and mathematical models exist to estimate power or delay, certain limitations exist, such as being applicable to either power or delay, or within a certain region of transistor operation. This thesis presents a simulation framework that …
-
Efficient Deterministic Approximate Bayesian Inference for Gaussian Process models
… extends them and allows new state-of-the-art approximations to emerge. We start by building a posterior approximation framework based on Power-Expectation Propagation for Gaussian process regression and classification. This framework relies on a structured approximate Gaussian process …
-
Successive convex approximation: analysis and applications
… blocks by successively minimizing a sequence of approximations of f which are either locally tight upper bounds of f or strictly convex local approximations of f. Different block selection rules are considered such as cyclic (Gauss-Seidel), greedy (Gauss-Southwell), randomized, or even multiple …
-
Adaptive robotic search and sampling of sparse natural phenomena
… planning to address two scenarios within this framework. In the first scenario, we assume the robot has prior knowledge about the expected density of discrete targets in the various substrates, however is operating without prior knowledge of substrate distributions. We develop a novel …
-
Distributed medium access control for an enhanced physical-link layer interface
… The MAC algorithm falls into the stochastic approximation framework with guaranteed convergence under mild conditions. We developed design procedures to satisfy these conditions and to ensure that the system should converge to a unique equilibrium. Simulation results are provided to …
-
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
… The new algorithm called MIQP-supported outer approximation (MIQPSOA) incorporates the successive solution of convex mixed-integer quadratic programs (MIQP) in a linear outer approximation framework. An extensive numerical competitive study based on several different MINLP solvers shows, that a …
-
Adaptive Robotic Search and Sampling of Sparse Natural Phenomena
… planning to address two scenarios within this framework. In the f irst scenario, we assume the robot has prior knowledge about the expected density of discrete targets in the various substrates, however is operating without prior knowledge of substrate distributions. We develop a novel …
-
Stochastic approximation schemes for stochastic optimization and variational problems: adaptive steplengths, smoothing, and regularization
Stochastic approximation (SA) methods, first proposed by Robbins and Monro in 1951 for root- finding problems, have been widely used in the literature to solve problems arising from stochastic convex optimization, stochastic Nash games and more recently stochastic variational inequalities. Several …
-
Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications
… our studied problems are all NP-hard, we design approximation algorithms with theoretical performance guarantee for solving each of them. To be specific, we claim the following contributions. Minimize maximum delay and average delay. First, we consider a single-unicast setting where in a …