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 18 of 18 for “"Approximate algorithms"”.
-
Efficient Optimal and Approximate Algorithms in Optimization Under Uncertainty
… expensive to solve. We aim to develop efficient algorithms to solve optimization problems under uncertainty and construct approximate algorithms that quickly approximate the solution in instances that are too large to solve exactly. In Chapter 2, we discuss a secretary problem with generalized …
-
Optimization Models and Approximate Algorithms for the Aerial Refueling Scheduling and Rescheduling Problems
… and job priorities. Since ARSP is NP-hard, four approximate algorithms are proposed to obtain solutions in reasonable computational times, namely (1) apparent piecewise tardiness cost with release time rule (APTCR), (2) simulated annealing starting from random solution (SA<sub>random</sub> ), (3) …
-
Evaluating exact and approximate algorithms for integer linear programming formulations of MAP inference
… it tractable. In this work, we evaluate other approximate inference algorithms for the MAP estimate for structured prediction task in the CCM framework. We model the constrained structured prediction problem as a factor graph and use different graphical models based algorithms. We evaluate …
-
Approximate Algorithms for the Combined arrival-Departure Aircraft Sequencing and Reactive Scheduling Problems on Multiple Runways
… amount of time. Therefore, three greedy algorithms, namely the Adapted Apparent Tardiness Cost with Separation and Ready Times (AATCSR), the Earliest Ready Time (ERT) and the Fast Priority Index (FPI) are proposed. Moreover, metaheuristics including Simulated Annealing (SA) and the …
-
Optimal and Approximate Algorithms for the Multiple-Lots-per-Carrier Scheduling and Integrated Automated Material Handling and Lot Scheduling Problems in 300mm Wafer Fabs
… shop lot streaming problem. Then, we propose algorithms to find the optimal capacitated sublot sizes for the case of lots with (1) the same ratio of processing times, and, (2) different ratios of processing times on the machines. Since the optimal solutions obtained from the lot streaming …
-
Various Approximate Methods to Measure the Uniformity of Quasirandom Sequences
… problem, so we have been looking for effective approximate algorithms. The star discrepancy can be thought of as the maximum of a function called the local discrepancy, and we will develop approximate algorithms to maximize this function. In this dissertation, we introduce new algorithms for …
-
Algorithms and Analysis for Multi-Category Classification
… understanding of how to extend maximum margin algorithms to more complex settings and performance guarantees of large margin classifiers, complex outputs render traditional approaches intractable in more complex settings. We introduce a new algorithm for learning maximum margin classifiers …
-
Problems in Supply Chain Location and Inventory under Uncertainty
… for different types of facilities. Exact and approximate algorithms are developed. The models are used to analyze the location of fire stations in the city of Toronto. Using real traffic data we show that the current system design is quite far from optimality and provide recommendations for …
-
Sparse Learning using Discrete Optimization: Scalable Algorithms and Statistical Insights
… that best predict the outcome. We propose fast, approximate algorithms, based on coordinate descent and local combinatorial optimization, and establish convergence guarantees. Empirically, we identify important high-dimensional settings where L0-based estimators achieve better statistical …
-
Behaviorally-Informed Discrete Choice Models in Operations Management
… and multi-unit purchases and provides exact and approximate algorithms for assortment and pricing optimization. Collectively, these studies enhance the descriptive and prescriptive power of DCM-based Revenue Management by linking behavioral realism with analytical tractability, offering both …
-
Compositional analysis of the effects of uncertainty on computations
… may also resort to intentionally adding approximate algorithms and machine learning models to such computations in order to make them tractable. Uncertainty analyses provide developers with the means to ensure that uncertainty introduced into a computation in this manner does not lead to …
-
Compositional analysis of the effects of uncertainty on computations
… may also resort to intentionally adding approximate algorithms and machine learning models to such computations in order to make them tractable. Uncertainty analyses provide developers with the means to ensure that uncertainty introduced into a computation in this manner does not lead to …
-
A framework for promotion analysis in multi-dimensional space
… online and offline costs, we investigate exact algorithms as well as approximate algorithms with probabilistic guarantee. The promotion analysis framework not only provides an integrated solution for decision support applications, but also opens up new horizons for future research in other areas …
-
New algorithmic developments in maximum consensus robust fitting
… This thesis makes several contributions in the algorithms for consensus maximization. Randomized hypothesize-and-verify algorithms are arguably the most widely used class of techniques for robust estimation thanks to their simplicity. Though efficient, these randomized heuristic methods do not …
-
Long read mapping at scale: Algorithms and applications
… new direction of development for bioinformatics algorithms and software. We are now at the cusp of the next revolution in sequencing due to the development of long and ultra-long read sequencing technologies by Pacific Biosciences (PacBio) and Oxford Nanopore Technologies (ONT). Long reads are …
-
Robust distributed planning strategies for autonomous multi-agent teams
… changes in dynamic environments. Distributed approximate algorithms, where agents plan individually and coordinate with each other locally through consensus protocols, can alleviate many of these issues and have been successfully used to develop real-time conflict-free solutions for …
-
UAV-Enabled Wireless Communications: Deployment, Optimization, and Analysis
… our algorithm substantially outperforms baseline algorithms while guaranteeing complete user coverage and end-to-end connectivity. Finally, building upon these deployment optimization contributions, our third research thrust develops a comprehensive analytical framework for multi-hop UAV-assisted …