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 51 for “"Binary Optimization"”.

  1. Binary Optimization: Applications To Regional Planning

    … is based on three related essays applying binary optimization, with a focus on discovering the best selection of nodes, parcels, and villages that are subject to a budget constraint. The applications are special cases of a mathematical problem called the knapsack problem. The first essay …

    cornell Repository record for Binary Optimization: Applications To Regional Planning (opens in a new tab)

  2. Improving binary optimization algorithms using genuine uniform initialization

    … play a crucial role in solving complex optimization problems. The effectiveness of these algorithms is significantly influenced by the initial population of candidate solutions. This thesis investigates the critical aspect of initialization in population-based metaheuristic algorithms. …

    uoit Repository record for Improving binary optimization algorithms using genuine uniform initialization (opens in a new tab)

  3. QUANTUM ALGORITHMS FOR BINARY OPTIMIZATION ON NOISY INTERMEDIATE SCALE QUANTUM DEVICES

    … classical solvers for Quadratic Unconstrained Binary Optimization (QUBO) problems. In this thesis, we first develop an encoding scheme to fit problems onto quantum devices using exponentially fewer qubits. Next, we provide a framework for using additional qubits to capture correlations between …

    nus Repository record for QUANTUM ALGORITHMS FOR BINARY OPTIMIZATION ON NOISY INTERMEDIATE SCALE QUANTUM DEVICES (opens in a new tab) Download file for QUANTUM ALGORITHMS FOR BINARY OPTIMIZATION ON NOISY INTERMEDIATE SCALE QUANTUM DEVICES (opens in a new tab)

  4. Dynamic data shapers optimize performance in Dynamic Binary Optimization (DBO) environment

    … were primarily targeted at execution time optimization. We present a dynamic technique piggybacked on the classical dynamic binary optimization (DBO) to shape the data view for each program phase differently resulting in program execution time reduction along with reductions</p> <p>in …

    iastate Repository record for Dynamic data shapers optimize performance in Dynamic Binary Optimization (DBO) environment (opens in a new tab)

  5. From Electron Glasses to Quantum Machine Learning: A Study in Quadratic Unconstrained Binary Optimization

    Quadratic unconstrained binary optimization (QUBO) problems are of paramount importance in scientific and industrial applications as many interesting non-deterministic polynomial (NP)- hard problems can be mapped to them. QUBO is a subset of combinatorial optimization in which one seeks the global …

    tamu Repository record for From Electron Glasses to Quantum Machine Learning: A Study in Quadratic Unconstrained Binary Optimization (opens in a new tab)

  6. New frontiers in population-based multi-objective feature selection

    … We frame feature selection as a multi-objective binary optimization task with the objectives of enhancing accuracy and reducing the feature count. Given that feature selection, along with binary optimization problems in general, is a NP-hard problem since the size of search space increases …

    uoit Repository record for New frontiers in population-based multi-objective feature selection (opens in a new tab)

  7. Techniques and Applications of the Quantum Approximate Optimization Algorithm

    The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm that has been shown to be effective at solving combinatorial optimization problems. While QAOA performs well at these problems, new methods of improving the performance of the algorithm are still being …

    utk-theses Repository record for Techniques and Applications of the Quantum Approximate Optimization Algorithm (opens in a new tab)

  8. Regret Models and Preprocessing Techniques for Combinatorial Optimization under Uncertainty

    … some probabilistic models for combinatorial optimization with uncertainty. The first model is to minimize the worst-case condition value-at-risk (WCVaR) of cost for a linear combinatorial optimization problem. We show that under the marginal distribution and marginal moment models, the …

    nus Repository record for Regret Models and Preprocessing Techniques for Combinatorial Optimization under Uncertainty (opens in a new tab) Download file for Regret Models and Preprocessing Techniques for Combinatorial Optimization under Uncertainty (opens in a new tab)

  9. Quantum Optimization of Physician Scheduling For Maximal Healthcare Capacity

    … computing, specifically the Quantum Approximate Optimization Algorithm (QAOA), as a novel approach to solving the Physician Scheduling Problem (PSP), a known combinatorial optimization task. Classical methods, Mixed Integer Linear Programming (MILP) with Gurobi and Satisfiability Modulo Theories …

    chalmers Repository record for Quantum Optimization of Physician Scheduling For Maximal Healthcare Capacity (opens in a new tab)

  10. Quantum-Powered Battery Scheduling in Modern Distribution Grids

    … (CQM) on D-Wave’s hybrid solver as well as a binary quadratic model (BQM), this thesis solves the optimal battery scheduling problem for a large number of batteries. To formulate the BQM, a quadratic unconstrained binary optimization (QUBO) format was chosen and in order to fine-tune the QUBO …

    denver Repository record for Quantum-Powered Battery Scheduling in Modern Distribution Grids (opens in a new tab)

  11. Kombinatorinių problemų sprendimas naudojant QAOA ir IBM Qiskit /

    … and tuning of the Quantum Approximate Optimization Algorithm (QAOA) for solving combinatorial optimization problems, such as the Traveling Salesman Problem (TSP) and Max-Cut, using IBM Qiskit. The study mainly focuses on the following aspects: evaluating the solution quality obtained by …

    vilnius Repository record for Kombinatorinių problemų sprendimas naudojant QAOA ir IBM Qiskit / (opens in a new tab)

  12. Vizer: A framework to analyze and vectorize Intel x86 binaries

    Binary optimization has become increasingly important due to the widespread use of legacy programs and the presence of environments that require dynamic optimizers. Although processor technology changes constantly, software developers usually compile their programs for older processors to maintain …

    rice Repository record for Vizer: A framework to analyze and vectorize Intel x86 binaries (opens in a new tab)

  13. Quantum machine intelligence in smart transportation

    … for solving prediction and combinatorial optimization problems with applications in Shared Mobility. We extensively used three methods of approach (a) Quantum Bayesian network which is quantum equivalent to classical Bayesian network for bike sharing demand prediction problems, (b) …

    wichita-thes Repository record for Quantum machine intelligence in smart transportation (opens in a new tab)

  14. Machine Learning and Quantum Computing for Optimization Problems in Power Systems

    While optimization problems are ubiquitous in all domains of engineering, they are of critical importance to power systems engineers. A safe and economical operation of the power systems entails solving many optimization problems such as security-constrained unit commitment, economic dispatch, …

    vt Repository record for Machine Learning and Quantum Computing for Optimization Problems in Power Systems (opens in a new tab)

  15. Surface Denoising based on The Variation of Normals and Retinal Shape Analysis

    … where the ENVT is used as a shape operator. A binary optimization technique is applied on the spectral components of the ENVT that helps the algorithm to retain sharp features in the concerned geometry and improves the convergence rate of the algorithm. Later, a stochastic analysis of the …

    fu-berlin Repository record for Surface Denoising based on The Variation of Normals and Retinal Shape Analysis (opens in a new tab)

  16. Inverse and Robust Models for Optimization with Objective Uncertainty

    Optimization models have become a cornerstone of the operations research and prescriptive analytics community. In practice, model parameters are seldom known with certainty and must instead be estimated from data. In this thesis, we present new algorithms for estimating and solving optimization …

    toronto-retro Repository record for Inverse and Robust Models for Optimization with Objective Uncertainty (opens in a new tab)

  17. Quantum Computing for Process Systems Optimization and Data Analytics

    … the ever-increasing complexity of combinatorial optimization problems accompanied by a quickly growing search space, there arises a need for novel solution approaches capable of overcoming limitations of the current optimization paradigms carried out on state-of-the-art classical computers. QC …

    cornell Repository record for Quantum Computing for Process Systems Optimization and Data Analytics (opens in a new tab)

  18. Quantum computing for biophysical and optimization problems

    … incorporates a QUBO (Quadratic Unconstrained Binary Optimization) encoding of the design problem that is amenable to adiabatic quantum platforms such as the D-Wave device. For the polymer sampling problem — where the objective is to sample both the sequence and the conformation of polymers …

    trento Repository record for Quantum computing for biophysical and optimization problems (opens in a new tab)

  19. Anwendung und Optimierung eingeschränkter Hamiltonians

    … Ising-Hamiltonians oder Quadratic Unconstrained Binary Optimization (QUBO) Probleme verwendet. Viele Realwelt-Anwendungsfälle enthalten zudem Nebenbedingungen, die bei der Lösung berücksichtigt werden müssen. In Bezug auf die Ising-Hamiltonians werden diese Bedingungen in Penalty-Terme kodiert …

    lmu-germany Repository record for Anwendung und Optimierung eingeschränkter Hamiltonians (opens in a new tab)

  20. Optimization of the gate assignment problem at Keflavík International Airport

    … and outlined. Based on the current practice a binary optimization model is developed. The objectives of the model are to minimize total passenger walking distance, the use of bus and walk-in, walk-out gates and to assign as many sensitive and heavy freight flights to the best suitable gates as …

    reykjavik Repository record for Optimization of the gate assignment problem at Keflavík International Airport (opens in a new tab)

Page 1 of 3