Search alternatives:
location algorithm » selection algorithm (Expand Search), encryption algorithm (Expand Search), correction algorithm (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
source location » resource allocation (Expand Search), source localization (Expand Search), source pollution (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data source » data sources (Expand Search)
binary wave » binary image (Expand Search)
wave model » naive model (Expand Search), game model (Expand Search), base model (Expand Search)
location algorithm » selection algorithm (Expand Search), encryption algorithm (Expand Search), correction algorithm (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
source location » resource allocation (Expand Search), source localization (Expand Search), source pollution (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data source » data sources (Expand Search)
binary wave » binary image (Expand Search)
wave model » naive model (Expand Search), game model (Expand Search), base model (Expand Search)
-
1
-
2
-
3
Data_Sheet_1_Pneumonia detection by binary classification: classical, quantum, and hybrid approaches for support vector machine (SVM).pdf
Published 2024“…A support vector machine (SVM) is attractive because binary classification can be represented as an optimization problem, in particular as a Quadratic Unconstrained Binary Optimization (QUBO) model, which, in turn, maps naturally to an Ising model, thereby making annealing—classical, quantum, and hybrid—an attractive approach to explore. …”
-
4
MCLP_quantum_annealer_V0.5
Published 2025“…Theoretical and applied experiments are conducted using four solvers: QBSolv, D-Wave Hybrid binary quadratic model 2, D-Wave Advantage system 4.1, and Gurobi. …”
-
5
Min-Cut/Max-Flow Problem Instances for Benchmarking
Published 2022“…</p> </li></ul> </li></ul> </div><div><p>The reason for releasing this collection is to provide a single place download all datasets used in our paper (and various previous paper) instead of having to scavenge from multiple sources. Furthermore, several of the problem instances typically used for benchmarking min-cut/max-flow algorithms are no longer available at their original locations and may be difficult to find. …”