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 60 for “"Approximate algorithms"”.

  1. Exact and Approximate Algorithms for Some Combinatorial Problems

    … combinatorial problems are studied and efficient algorithms are presented for each of them. The first problem is concerned with lot-sizing, the second one arises in exam-scheduling, and the third lies on the intersection of the k-median and k-center clustering problems.

    cornell Repository record for Exact and Approximate Algorithms for Some Combinatorial Problems (opens in a new tab)

  2. 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 (SArandom ), (3) SA …

    odu Repository record for Optimization Models and Approximate Algorithms for the Aerial Refueling Scheduling and Rescheduling Problems (opens in a new tab)

  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 …

    uiuc Repository record for Evaluating exact and approximate algorithms for integer linear programming formulations of MAP inference (opens in a new tab)

  4. 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 …

    odu Repository record for Approximate Algorithms for the Combined arrival-Departure Aircraft Sequencing and Reactive Scheduling Problems on Multiple Runways (opens in a new tab)

  5. 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 …

    vt Repository record for Optimal and Approximate Algorithms for the Multiple-Lots-per-Carrier Scheduling and Integrated Automated Material Handling and Lot Scheduling Problems in 300mm Wafer Fabs (opens in a new tab)

  6. Dirbtinės bičių kolonijos algoritmo keliaujančio pirklio uždaviniui spręsti lygiagretinimas /

    … and return to his starting city. Many exact and approximate algorithms have been devised to solve this problem. One category of approximate algorithms is called population ­based-algorithms. One of the best known population algorithms is called Ant Colony Optimization (ACO). It simulates the …

    vilnius Repository record for Dirbtinės bičių kolonijos algoritmo keliaujančio pirklio uždaviniui spręsti lygiagretinimas / (opens in a new tab)

  7. 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 …

    uiuc Repository record for Algorithms and Analysis for Multi-Category Classification (opens in a new tab)

  8. 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 …

    toronto-retro Repository record for Problems in Supply Chain Location and Inventory under Uncertainty (opens in a new tab)

  9. Efficient Computations of Interesting Paths

    … for k ≥ 4. We design approximation and exact algorithms for it. For the IP problem, we give a proof of its NP-completeness. We also design corresponding approximate algorithms using various heuristics.

    carleton Repository record for Efficient Computations of Interesting Paths (opens in a new tab)

  10. Scalable machine learning for massive datasets: Fast summation algorithms

    … the computational complexity of machine learning algorithms. Most state-of-the-art nonparametric machine learning algorithms have a computational complexity of either O(N^2) or O(N^3), where N is the number of training examples. This has seriously restricted the use of massive data sets. The …

    maryland Repository record for Scalable machine learning for massive datasets: Fast summation algorithms (opens in a new tab)

  11. Local decision-making in multi-agent systems

    … control individual action choices.</p><p>Various approximate algorithms for local decision-making are developed for scenarios with and without sequentiality. The construction of these techniques is based strongly on methods of Bayesian inference. Their performance is tested on synthetic benchmark …

    oxford Repository record for Local decision-making in multi-agent systems (opens in a new tab)

  12. ATTRIBUTED RELATIONAL SIFT-BASED REGIONS GRAPH (ARSRG):DESCRIPTION, MATCHING AND APPLICATIONS

    … and art painting. The literature shows many approximate algorithms to solve these problems, so a comparison with the state of the art is performed in each step of the process. By using both local and spatial information, the proposed framework outperforms its competitors for the image …

    milano Repository record for ATTRIBUTED RELATIONAL SIFT-BASED REGIONS GRAPH (ARSRG):DESCRIPTION, MATCHING AND APPLICATIONS (opens in a new tab)

  13. Learning, Large Scale Inference, and Temporal Modeling of Determinantal Point Processes

    … many remarkable properties, they offer tractable algorithms for exact inference, including computing marginals, computing certain conditional probabilities, and sampling. In this thesis, we provide four main contributions that enable DPPs to be used in more general settings. First, we develop …

    penn Repository record for Learning, Large Scale Inference, and Temporal Modeling of Determinantal Point Processes (opens in a new tab)

  14. 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 …

    queens Repository record for Behaviorally-Informed Discrete Choice Models in Operations Management (opens in a new tab)

  15. Active Learning and Submodular Functions

    … optimization problems have efficient exact or approximate algorithms. We examine their connections. 1. We propose a new class of interactive submodular optimization problems which connect and generalize submodular optimization and active learning over a finite query set. We derive greedy …

    washington Repository record for Active Learning and Submodular Functions (opens in a new tab)

  16. Shortest-Path Solutions for Connecting Multiple Terminals via Deep Learning

    … Steiner minimum tree (OARMST)-solving algorithms that could be used to simplify indoor environments are, however, approximate algorithms that can produce incorrect shortest-path solutions. This work proposes a deep learning-based front-end method called MazeNet that successfully …

    rice Repository record for Shortest-Path Solutions for Connecting Multiple Terminals via Deep Learning (opens in a new tab)

  17. Robust maximum covering location problem (RMCLP)

    … solution under the worst-case scenario. Three algorithms were implemented to solve the problem and find the optimal solution, including an exact algorithm and two approximate algorithms. The algorithms were evalu- ated using various instances, including the OR-Library and randomly generated …

    lethbridge Repository record for Robust maximum covering location problem (RMCLP) (opens in a new tab)

  18. Complexity and algorithms related to two classes of graph problems

    … We show results of NP-completeness and efficient algorithms for certain convexity parameters for this new one, as well as approximate algorithms. We introduce the concept of generalized threshold processes, where the results are NP-completeness and efficient algorithms for both non relaxed and …

    brazil-uerj Repository record for Complexity and algorithms related to two classes of graph problems (opens in a new tab)

  19. Deadline-aware Service Function Orchestration under Demand Uncertainty

    … optimization problems and develop exact and approximate algorithms to solve them. To avoid continuous resource reprovisioning, our algorithms utilize uncertain demand knowledge to compute proactive service orchestration solutions that can cope with fluctuations in dynamic service demands. The …

    calgary Repository record for Deadline-aware Service Function Orchestration under Demand Uncertainty (opens in a new tab)

Page 1 of 3