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 25 for “"Worst-Case Analysis"”.
-
DM EMI Noise Analysis for Single Channel and Interleaved Boost PFC in Critical Conduction Mode
… and have not been carefully investigated. The worst case of the EMI noise, which is the baseline to design the EMI filter, is difficult to be identified. In this paper, an approximate mathematical EMI noise model based on the investigation of the principle of the quasi-peak detection is …
-
Optimism and Robustness: Learning From Structured and Semi-Random Inputs
… algorithms have been studied under two regimes: worst-case analysis, which makes no assumptions about the input, and average-case analysis, which assumes that inputs are drawn from a certain distribution. However, real-world inputs rarely conform to either of these extremes. A new paradigm known …
-
Air assessment of open burning at Radford Army Ammunition Plant
… by open burning exceeds 99.9999 percent. A worst-case analysis is conducted using the Trinity INPUFF™ model. Based on this conservative estimate, the concentrations of lead, copper, and NO<sub>x</sub> compounds do not exceed the Short-Term Exposure Limits. However, the analysis exposes …
-
Performance evaluation of online call routing and admission control algorithms
… researchers in the context of competitive worst-case analysis. We first analyze the behavior of the EXP algorithm proposed by Gawlick et. al .[25] We propose small variations to the admission control algorithm that each greatly reduce the unfairness of EXP on a dense commercial network …
-
Game-Theoretic Approach with Cost Manipulation to Vehicular Collision Avoidance
… differential game in order to model and assess a worst-case analysis. The end result will be an almost analytic representation of a boundary between a "safe" set and a "unsafe" set. We will generalize the research in [27] to non-identical players and begin the setup of the boundary construction. …
-
Approximation algorithms for clustering and facility location problems
… there is an increasing emphasis on beyond worst-case analysis. In this thesis we consider both these approaches. In the first part we design worst case approximation algorithms for Uniform Submodular Facility Location (USFL), and Capacitated k-center (CapKCenter) problems. USFL is a …
-
Shop scheduling with availability constraints
… is not always an optimal solution then the worst-case analysis of this algorithm is undertaken in order to estimate either a relative error or an absolute error that holds for any given instance of the problem. Scheduling problems which are usually considered in the literature assume that …
-
Cooperative checkpointing for supercomputing systems
… overhead and I is the request interval, a worst-case analysis proves a lower bound of (2 + [C/I])-competitiveness for deterministic cooperative checkpointing algorithms, and proves that a number of simple algorithms meet this bound. Using an expected-case analysis, this thesis proves that …
-
Influence of Customer Locations on Heuristics and Solutions for the Vehicle Routing Problem
… and industry datasets. In Chapter 3, we derive worst-case analysis on how VRP objective functions and metrics relate to one another. These bounds depend on properties of customer locations. These bounds illustrate how customer locations can influence how different routes behave for different …
-
Three essays on sequencing and routing problems
… Kan. This bound is then utilized to improve the worst-case approximation algorithm of the Iterated Tour Partitioning (ITP) heuristic when the capacity of the vehicles is constant. Second, we analyze a particular case of the VRP, when the customers are uniformly distributed i.i.d. points on the …
-
Learning-Augmented Algorithms
Traditional worst case analysis of algorithms does not fully capture real world behavior in many instances. Inspired by the great success of machine learning algorithms for various practical tasks, there has been recent interest in moving beyond pessimistic analysis of algorithms through the use of …
-
Distribution-independent hierarchical N-body methods
… in computer graphics and numerical complex analysis. Research efforts have focused on reducing the O(N[superscript]2) time per iteration required by the naive algorithm of computing each pairwise interaction. Widely respected among these are the Barnes-Hut and Greengard methods. Greengard …
-
A Systems Approach to the Modeling and Control of Molecular, Microparticle, and Biological Distributions
… algorithm development, parameter sensitivity analysis, parameter estimation, model validation, optimal control formulation, and worst-case and distributional robustness analysis. Free radical bulk polymerization is the model system for molecular distributions. In situ ATR-FTIR spectroscopy was …
-
Bounds on multithreaded computations by work stealing
… that approach leads to a fruitful probabilistic analysis, it does not yield an interesting result for a worst-case analysis. We obtain tight upper bounds on the number of successful steals when the computation can be modeled by a computation tree. In particular, if the computation starts with a …
-
New benchmarking techniques in resource allocation problems: theory and applications in cloud systems
… From a technical standpoint, we apply either worst-case analysis with limited information from the system or adaptive analysis with stochastic results learned after making an irrevocable decision. A central aspect of this work is dynamic benchmarks as opposed to static or offline ones. Static …
-
Search and optimization with randomness in computational economics: equilibria, pricing, and decisions
… two categories: First, we address the smoothed analysis of Nash equilibrium computation. Second, we address two pricing problems in mechanism design, and solve two economically motivated stochastic optimization problems. Computing Nash equilibria is a central question in the game-theoretic study …
-
In pursuit of linear complexity in discrete and computational geometry
… enclosing k points, and many others. In several cases we get the first known linear time approximation algorithm for a given problem, where our approximation ratio matches that of previous work. The second topic we investigate is contour trees, a fundamental structure in computational topology. …
-
Reactive synthesis of action planners
An increase in the level of autonomy marks one of the fundamental focuses of current robotic systems. This involves the ability of a robot to reason about its environment and plan its motion in order to carry out assigned tasks. For all tasks, it generally involves abstractions into discrete, …
-
Robust Control Design and Analysis for Small Fixed-Wing Unmanned Aircraft Systems Using Integral Quadratic Constraints
… this work are applications of robust control and analysis methods to complex engineering systems, namely, small fixed-wing unmanned aircraft systems (UAS). Multiple path-following controllers for a small fixed-wing Telemaster UAS are presented, including a linear parameter-varying (LPV) controller …
-
Optimization Techniques for Performance and Power Dissipation in Test and Validation
… paths, subsequently, it determines the worst case execution time (WCET) in the HDL code.
Page 1 of 2