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 26 for “"performance guarantee"”.

  1. A computational study of a geometric embedding of minimum multiway cut

    … to produce an approximation algorithm that has a performance guarantee of 3/2 - 1/k. In a subsequent study, Karger, Klein, Stein, Thorup, and Young discovered improved rounding schemes via computation experiments for various values of k, yielding approximation algorithms with improved performance

    mit Repository record for A computational study of a geometric embedding of minimum multiway cut (opens in a new tab)

  2. Pricing And Assortment Problems Under Correlated Product Evaluations

    … methods that allow the user to specify a performance guarantee a priori, where the final solutions are obtained by solving linear programs whose sizes scale gracefully with the specified performance guarantee. In addition, we develop a linear program that we can use to quickly obtain upper …

    cornell Repository record for Pricing And Assortment Problems Under Correlated Product Evaluations (opens in a new tab)

  3. Efficient Algorithms for High-Dimensional Data-Driven Sequential Decision-Making

    … which in many cases leads to significant performance upgrade/revenue increase. However, such data-driven decision-making also poses fundamental computational challenges, because they generally demand large-scale, more realistic and flexible (thus complicated) models. As a result, the …

    cornell Repository record for Efficient Algorithms for High-Dimensional Data-Driven Sequential Decision-Making (opens in a new tab)

  4. Approximation algorithms for packing and scheduling problems

    … we design an algorithm with an asymptotic performance guarantee arbitrarily close to optimal. In the general case, we give an algorithm that outputs a near-optimal solution, provided it is allowed to use slightly larger bins. Moreover, we extend these algorithmic ideas to handle a number of …

    mit Repository record for Approximation algorithms for packing and scheduling problems (opens in a new tab)

  5. Stability Analysis of Unconstrained Receding Horizon Control Schemes

    … loop and, in addition, to quantify the loss of performance in comparison to infinite horizon optimal control. To this end, a (stability) condition is derived based on a controllability assumption. Then, a sensitivity analysis is carried out with respect to the most important parameters in our …

    bayreuth Repository record for Stability Analysis of Unconstrained Receding Horizon Control Schemes (opens in a new tab)

  6. Multicriteria Approximation of Network Design and Network Upgrade Problems

    … compute near-optimal solutions with provable performance guarantee in polynomial time.

    wurz-thes Repository record for Multicriteria Approximation of Network Design and Network Upgrade Problems (opens in a new tab)

  7. Efficient and guaranteed algorithms for sparse inverse problems

    … by computationally efficient algorithms is guaranteed for certain randomized acquisition systems. However, there is a discrepancy between the theoretical guarantees and practical applications. In applications, including Fourier imaging in various modalities, the measurements are acquired by …

    uiuc Repository record for Efficient and guaranteed algorithms for sparse inverse problems (opens in a new tab)

  8. Synthetic Data Generation and Sampling for Online Training of DNN in Manufacturing Supervised Learning Problems

    … modeling, etc. However, there is a lack of performance guarantee of DNN models primarily due to data class imbalance, shifting distribution, multi-modality variables (e.g., time series and images) in training and testing datasets collected in manufacturing. Moreover, implementing these …

    vt Repository record for Synthetic Data Generation and Sampling for Online Training of DNN in Manufacturing Supervised Learning Problems (opens in a new tab)

  9. Visual-Inertial State Estimation With Information Deficiency

    … VIO can improve the state-of-the-art system performance and compensate for the lack of information in real-time. We identify deep learning as a key technology in tackling the information deficiencies in state estimation. We argue that developing hybrid frameworks that leverage its advantage …

    penn Repository record for Visual-Inertial State Estimation With Information Deficiency (opens in a new tab)

  10. On information filtering in social sensing

    … well empirically but also has a theoretical performance guarantee. We address the above challenges by algorithm design and system implementation and real-world data evaluations verify the efficiency of our proposed solutions.

    uiuc Repository record for On information filtering in social sensing (opens in a new tab)

  11. Quantum Computing from Graphs

    … simple efficient decoding algorithm and prove a performance guarantee for a certain classes of graphs. These results give evidence that graphs are generically useful for the study of quantum computing and its practical implementations.

    mit Repository record for Quantum Computing from Graphs (opens in a new tab)

  12. Revenue management and learning in systems of reusable resources

    … This thesis focuses on developing policies and guarantees for resource allocation problems with reusable resources and on learning models for personalized resource allocation. First, we address the problem of pricing and assortment optimization for reusable resources under time-homogeneous …

    mit Repository record for Revenue management and learning in systems of reusable resources (opens in a new tab)

  13. Information Freshness Optimization in Real-time Network Applications

    … exactly various scheduling policies impact AoI performance. Though there is a large body of work studying the AoI performance under different scheduling policies, the use of the update-size information and its combinations with other information (such as arrival-time information and service …

    vt Repository record for Information Freshness Optimization in Real-time Network Applications (opens in a new tab)

  14. Algorithms and Theory for Robust PCA and Phase Retrieval

    … and characterize the condition under which PCP guarantees exact recovery. We generalize these results by allowing non-uniform error corruptions over the low-rank matrix and characterize the conditions on the error corruption probability of each individual entry based on the local coherence of …

    syracuse-diss Repository record for Algorithms and Theory for Robust PCA and Phase Retrieval (opens in a new tab)

  15. Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications

    Delay is known to be a critical performance metric for various real-world routing applications including multimedia communication and freight delivery. Provisioning delay-minimal (or at least delay-bounded) routing services for all traffic of an application is highly important. As a basic paradigm …

    vt Repository record for Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications (opens in a new tab)

  16. Discrete and Continuous Sparse Recovery Methods and Their Applications

    … with an emphasis on efficient algorithms and performance analysis.</p><p>In considering the sparse recovery method with structured dictionary mismatches for the synthesis model, we exploit the joint sparsity between the mismatch parameters and original sparse signal. We demonstrate that by …

    wustl Repository record for Discrete and Continuous Sparse Recovery Methods and Their Applications (opens in a new tab)

  17. Statistical inference in networks: fundamental limits and efficient algorithms

    … estimation method and obtain a stronger performance guarantee than previously known. If the community sizes are linear in the total number of vertices, the guarantee matches up to a constant factor with the information limit which we also identify, and exactly matches without a constant …

    uiuc Repository record for Statistical inference in networks: fundamental limits and efficient algorithms (opens in a new tab)

  18. Three Essays on Data-driven Revenue Management and Pricing

    … pricing heuristic has a competent provable performance guarantee. Comprehensive numerical studies based on synthetic and real data suggest that our pricing approach is uniquely beneficial when the historical data has a limited size or is susceptible to model misspecification. In Chapter 3 we …

    toronto-retro Repository record for Three Essays on Data-driven Revenue Management and Pricing (opens in a new tab)

  19. Analysis and Optimization of Networks in Overload

    … high delay and packet loss, impairing network performance. In this thesis, we develop new models and methods to gain in-depth understanding of network overload in two aspects: (i) designing network control policies to optimize network performance; (ii) quantifying the capability of malicious …

    mit Repository record for Analysis and Optimization of Networks in Overload (opens in a new tab)

  20. Optimization-based auctions and stochastic assembly replenishment policies for industrial procurement

    … environment parameters. This bound constitutes a performance guarantee from the buyer's perspective, and provides insights on how capacity constraints affect relative market power. We then formulate a complete behavioral model and solution methodology based on the MBR rationale and the concept of …

    mit Repository record for Optimization-based auctions and stochastic assembly replenishment policies for industrial procurement (opens in a new tab)

Page 1 of 2