Results 51 to 60 of about 2,283 (206)
Truss Sizing Optimization: Direct QUBO Method Repository
This repository contains the Python codes and Excel results sheet for the Direct QUBO chapter of my ...
Wils, Kevin
core +1 more source
Abstract Argumentation Goes Quantum: An Encoding to QUBO Problems
We present an encoding of some NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. A solution for a QUBO problem corresponds to minimize a quadratic function over binary variables (0/1), whose ...
Marco Baioletti, Francesco Santini
core +1 more source
A Scalable and Resource‐Efficient Pipelined p‐Computer for Probabilistic Ising Machines
(a) Block diagram of the portfolio optimization problem: given M assets, the goal is to determine the optimal weights w that maximize the expected return (based on the mean historical assets return u), while minimizing the risk, quantified by the assets covariance matrix S.
Deborah Volpe +9 more
wiley +1 more source
Influence of Different 3SAT-to-QUBO Transformations on the Solution Quality of Quantum Annealing: A Benchmark Study [PDF]
To solve 3SAT instances on quantum annealers they need to be transformed to an instance of Quadratic Unconstrained Binary Optimization (QUBO). When there are multiple transformations available, the question arises whether different transformations lead ...
Nüßlein, Jonas +5 more
core +1 more source
QuDASH: Quantum-Inspired Rate Adaptation Approach for DASH Video Streaming
Internet traffic is dramatically increasing with the development of network technologies and video streaming traffic accounts for large amount within the total traffic, which reveals the importance to guarantee the quality of content delivery service ...
Bo Wei +5 more
doaj +1 more source
Establishing Shape Correspondences: A Survey
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
Posiform planting: generating QUBO instances for benchmarking
We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible,
Georg Hahn +3 more
openaire +4 more sources
Faster QUBO Brute-Force Solving using Gray Code [PDF]
This article describes an improved brute-force solving strategy for Quadratic Unconstrained Binary Optimization (QUBO) problems that is faster than naive approaches and easily parallelizable. It exploits the Gray code ordering of natural numbers to allow
Mücke, Sascha
core
Solving Job-Shop Scheduling Problems with QUBO-Based Specialized Hardware
The emergence of specialized hardware, such as quantum computers and Digital/CMOS annealers, and the slowing of performance growth of general-purpose hardware raises an important question for our community: how can the high-performance, specialized ...
Lo Bianco, Giovanni +2 more
core +1 more source
We present a general method to compute canonical averages for physical models sampled via quantum or classical quadratic unconstrained binary optimization (QUBO).
Francesco Slongo, Cristian Micheletti
doaj +1 more source

